Paper Info
Title
Secure distortion computation among untrusting parties using homomorphic encryption
Abstract
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.
Year
DOI
Venue
2009
10.1109/ICIP.2009.5414544
Image Processing
Keywords
Field
DocType
cryptography,distortion,security of data,Hamming distance,access control,binary vectors,homomorphic encryption,integer vectors,secure distortion computation,squared error distortion,untrusting parties,Homomorphic Encryption,Paillier Encryption,Secure Multiparty Computation
Secure multi-party computation,Authentication,Alice and Bob,Cryptography,Computer science,Theoretical computer science,Encryption,Artificial intelligence,Distortion,Homomorphic encryption,Discrete mathematics,Pattern recognition,Hamming distance
Conference
ISSN
ISBN
Citations 
1522-4880 E-ISBN : 978-1-4244-5655-0
978-1-4244-5655-0
11
PageRank 
References 
Authors
0.66
5
3
Name
Order
Citations
PageRank
S. Rane11035.70
SUN Wei224726.63
Anthony Vetro31580115.57