Sciweavers

Share
ICIP
2009
IEEE

Secure Distortion Computation Among Untrusting Parties Using Homomorphic Encryption

9 years 5 months ago
Secure Distortion Computation Among Untrusting Parties Using Homomorphic Encryption
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 other for squared errors 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. IEEE International Conference on Image Processing 2009 This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to c...
Added 10 Nov 2009
Updated 26 Dec 2009
Type Conference
Year 2009
Where ICIP
Comments (0)
books