article · 2009
HOMOMORPHIC ENCRYPTION
Shantanu Rane, Wei Sun, Anthony Vetro, Shantanu D. Rane, Wei Sun, Anthony Vetro
Cited by 0Abstract and details only
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 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.
Cite this paper
Rane, S., Sun, W., Vetro, A., Rane, S. D., Sun, W., & Vetro, A. (2009). HOMOMORPHIC ENCRYPTION.
Rane, Shantanu, et al. “HOMOMORPHIC ENCRYPTION.” 2009.
Rane, Shantanu, Wei Sun, Anthony Vetro, Shantanu D. Rane, Wei Sun, and Anthony Vetro. 2009. “HOMOMORPHIC ENCRYPTION.”
Rane, S. et al. (2009) ‘HOMOMORPHIC ENCRYPTION’.
@article{rane2009homomorphic,
title = {{HOMOMORPHIC ENCRYPTION}},
author = {Rane, Shantanu and Sun, Wei and Vetro, Anthony and Rane, Shantanu D. and Sun, Wei and Vetro, Anthony},
year = {2009}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.