Skip to Main content Skip to Navigation
Conference papers

Packed Homomorphic Encryption Based on Ideal Lattices and Its Application to Biometrics

Abstract : 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.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Wednesday, April 12, 2017 - 10:25:01 AM
Last modification on : Thursday, March 5, 2020 - 4:47:24 PM
Long-term archiving on: : Thursday, July 13, 2017 - 12:39:45 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License


  • HAL Id : hal-01506566, version 1


Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba. Packed Homomorphic Encryption Based on Ideal Lattices and Its Application to Biometrics. 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES), Sep 2013, Regensburg, Germany. pp.55-74. ⟨hal-01506566⟩



Record views


Files downloads