TY - GEN
T1 - Packed homomorphic encryption based on ideal lattices and its application to biometrics
AU - Yasuda, Masaya
AU - Shimoyama, Takeshi
AU - Kogure, Jun
AU - Yokoyama, Kazuhiro
AU - Koshiba, Takeshi
PY - 2013
Y1 - 2013
N2 - Among many approaches for privacy-preserving biometric authentication, we focus on the approach with homomorphic encryption, which is public key encryption supporting some operations on encrypted data. In biometric authentication, the Hamming distance is often used as a metric to compare two biometric feature vectors. In this paper, we propose an efficient method to compute the Hamming distance on encrypted data using the homomorphic encryption based on ideal lattices. In our implementation of secure Hamming distance of 2048-bit binary vectors with a lattice of 4096 dimension, encryption of a vector, secure Hamming distance, and decryption respectively take about 19.89, 18.10, and 9.08 milliseconds (ms) on an Intel Xeon X3480 at 3.07 GHz. We also propose a privacy-preserving biometric authentication protocol using our method, and compare it with related protocols. Our protocol has faster performance and shorter ciphertext size than the state-of-the-art prior work using homomorphic encryption.
AB - Among many approaches for privacy-preserving biometric authentication, we focus on the approach with homomorphic encryption, which is public key encryption supporting some operations on encrypted data. In biometric authentication, the Hamming distance is often used as a metric to compare two biometric feature vectors. In this paper, we propose an efficient method to compute the Hamming distance on encrypted data using the homomorphic encryption based on ideal lattices. In our implementation of secure Hamming distance of 2048-bit binary vectors with a lattice of 4096 dimension, encryption of a vector, secure Hamming distance, and decryption respectively take about 19.89, 18.10, and 9.08 milliseconds (ms) on an Intel Xeon X3480 at 3.07 GHz. We also propose a privacy-preserving biometric authentication protocol using our method, and compare it with related protocols. Our protocol has faster performance and shorter ciphertext size than the state-of-the-art prior work using homomorphic encryption.
KW - Ideal lattices
KW - Packed ciphertexts
KW - Privacy-preserving biometrics
KW - Secure Hamming distance
KW - Somewhat homomorphic encryption
UR - http://www.scopus.com/inward/record.url?scp=84889051084&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84889051084&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-40588-4_5
DO - 10.1007/978-3-642-40588-4_5
M3 - Conference contribution
AN - SCOPUS:84889051084
SN - 9783642405877
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 55
EP - 74
BT - Security Engineering and Intelligence Informatics - CD-ARES 2013 Workshops
T2 - CD-ARES 2013 Workshops: 2nd International Workshop on Modern Cryptography and Security Engineering, MoCrySEn 2013 and 3rd International Workshop on Security and Cognitive Informatics for Homeland Defense, SeCIHD 2013
Y2 - 2 September 2013 through 6 September 2013
ER -