Overview of Secure Comparison
Document type :
Autre communication scientifique (congrès sans actes - poster - séminaire...)
Title :
Overview of Secure Comparison
Author(s) :
Sinh, Quentin [Auteur]
Machine Learning in Information Networks [MAGNET]
Ramon, Jan [Auteur]
Machine Learning in Information Networks [MAGNET]
Machine Learning in Information Networks [MAGNET]
Ramon, Jan [Auteur]
Machine Learning in Information Networks [MAGNET]
Publication date :
2024-06-14
English keyword(s) :
Secure Comparison
Secret Sharing
Homomorphic Encryption
Function Secret Sharing
Secret Sharing
Homomorphic Encryption
Function Secret Sharing
HAL domain(s) :
Informatique [cs]
Informatique [cs]/Cryptographie et sécurité [cs.CR]
Informatique [cs]/Cryptographie et sécurité [cs.CR]
English abstract : [en]
Introduced by Yao's Millionaires' problem, Secure Comparison (SC) allows parties to compare two secrets in a privacy-preserving manner. This article gives an overview of the different SC techniques in various settings such ...
Show more >Introduced by Yao's Millionaires' problem, Secure Comparison (SC) allows parties to compare two secrets in a privacy-preserving manner. This article gives an overview of the different SC techniques in various settings such as Secret Sharing (SS) or Homomorphic Encryption (HE).Show less >
Show more >Introduced by Yao's Millionaires' problem, Secure Comparison (SC) allows parties to compare two secrets in a privacy-preserving manner. This article gives an overview of the different SC techniques in various settings such as Secret Sharing (SS) or Homomorphic Encryption (HE).Show less >
Language :
Anglais
Popular science :
Non
European Project :
Collections :
Source :
Files
- document
- Open access
- Access the document
- IEEE_Conference_Template-5.pdf
- Open access
- Access the document