Packed homomorphic encryption based on ideal lattices and its application to biometrics

Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationSecurity Engineering and Intelligence Informatics - CD-ARES 2013 Workshops
Subtitle of host publicationMoCrySEn and SeCIHD, Proceedings
Pages55-74
Number of pages20
Volume8128 LNCS
DOIs
Publication statusPublished - 2013
Externally publishedYes
EventCD-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 - Regensburg, Germany
Duration: 2013 Sep 22013 Sep 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8128 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherCD-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
CountryGermany
CityRegensburg
Period13/9/213/9/6

Fingerprint

Lattice Ideal
Homomorphic Encryption
Hamming Distance
Biometrics
Hamming distance
Cryptography
Privacy Preserving
Authentication
Public Key Encryption
Authentication Protocol
Feature Vector
Encryption
Binary
Metric

Keywords

  • Ideal lattices
  • Packed ciphertexts
  • Privacy-preserving biometrics
  • Secure Hamming distance
  • Somewhat homomorphic encryption

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yasuda, M., Shimoyama, T., Kogure, J., Yokoyama, K., & Koshiba, T. (2013). Packed homomorphic encryption based on ideal lattices and its application to biometrics. In Security Engineering and Intelligence Informatics - CD-ARES 2013 Workshops: MoCrySEn and SeCIHD, Proceedings (Vol. 8128 LNCS, pp. 55-74). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8128 LNCS). https://doi.org/10.1007/978-3-642-40588-4_5

Packed homomorphic encryption based on ideal lattices and its application to biometrics. / Yasuda, Masaya; Shimoyama, Takeshi; Kogure, Jun; Yokoyama, Kazuhiro; Koshiba, Takeshi.

Security Engineering and Intelligence Informatics - CD-ARES 2013 Workshops: MoCrySEn and SeCIHD, Proceedings. Vol. 8128 LNCS 2013. p. 55-74 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8128 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yasuda, M, Shimoyama, T, Kogure, J, Yokoyama, K & Koshiba, T 2013, Packed homomorphic encryption based on ideal lattices and its application to biometrics. in Security Engineering and Intelligence Informatics - CD-ARES 2013 Workshops: MoCrySEn and SeCIHD, Proceedings. vol. 8128 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8128 LNCS, pp. 55-74, 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, Regensburg, Germany, 13/9/2. https://doi.org/10.1007/978-3-642-40588-4_5
Yasuda M, Shimoyama T, Kogure J, Yokoyama K, Koshiba T. Packed homomorphic encryption based on ideal lattices and its application to biometrics. In Security Engineering and Intelligence Informatics - CD-ARES 2013 Workshops: MoCrySEn and SeCIHD, Proceedings. Vol. 8128 LNCS. 2013. p. 55-74. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-40588-4_5
Yasuda, Masaya ; Shimoyama, Takeshi ; Kogure, Jun ; Yokoyama, Kazuhiro ; Koshiba, Takeshi. / Packed homomorphic encryption based on ideal lattices and its application to biometrics. Security Engineering and Intelligence Informatics - CD-ARES 2013 Workshops: MoCrySEn and SeCIHD, Proceedings. Vol. 8128 LNCS 2013. pp. 55-74 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a9838ee728d84857b1def82322c6b4b1,
title = "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.",
keywords = "Ideal lattices, Packed ciphertexts, Privacy-preserving biometrics, Secure Hamming distance, Somewhat homomorphic encryption",
author = "Masaya Yasuda and Takeshi Shimoyama and Jun Kogure and Kazuhiro Yokoyama and Takeshi Koshiba",
year = "2013",
doi = "10.1007/978-3-642-40588-4_5",
language = "English",
isbn = "9783642405877",
volume = "8128 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "55--74",
booktitle = "Security Engineering and Intelligence Informatics - CD-ARES 2013 Workshops",

}

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

SN - 9783642405877

VL - 8128 LNCS

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

ER -