A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Probabilistic encryption & how to play mental poker keeping secret all partial information
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
Homomorphic encryption and secure comparison
International Journal of Applied Cryptography
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
Alice and Bob possess sequences xn and yn respectively and would like to compute d(xn, yn) where d(ċ , ċ) is a distortion measure. However, Alice and Bob do not trust each other and do not wish to reveal their data to each other. This paper describes and analyzes a protocol that uses homomorphic encryption for secure calculation of some special distortion functions without revealing xn and yn. The resulting distortion result is also in encrypted form. Two variants of the protocol are presented, one for the Hamming distance between binary vectors, and the other for squared error distortion between integer vectors. An application of the protocol for private biometric authentication is described in which Bob interacts with a remote encrypted fingerprint database (Alice) to achieve access control without revealing his own identity.