Secure Hamming distance computation for biometrics using ideal-lattice and ring-LWE homomorphic encryption

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

With widespread development of biometrics, concerns about security and privacy are rapidly increasing. Homomorphic encryption enables us to operate on encrypted data without decryption, and it can be applied to construct a privacy-preserving biometric system. In this article, we apply two homomorphic encryption schemes based on ideal-lattice and ring-LWE (Learning with Errors), which both have homomorphic correctness over the ring of integers of a cyclotomic field. We compare the two schemes in applying them to privacy-preserving biometrics. In biometrics, the Hamming distance is used as a metric to compare two biometric feature vectors for authentication. We propose an efficient method for secure Hamming distance. Our method can pack a biometric feature vector into a single ciphertext, and it enables efficient computation of secure Hamming distance over our packed ciphertexts.

Original languageEnglish
Pages (from-to)85-103
Number of pages19
JournalInformation Security Journal
Volume26
Issue number2
DOIs
Publication statusPublished - Mar 4 2017

Fingerprint

Hamming distance
Biometrics
Cryptography
Authentication
Encryption

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications
  • Information Systems and Management

Cite this

Secure Hamming distance computation for biometrics using ideal-lattice and ring-LWE homomorphic encryption. / Yasuda, Masaya.

In: Information Security Journal, Vol. 26, No. 2, 04.03.2017, p. 85-103.

Research output: Contribution to journalArticle

@article{e3b82a9fdef34cdca4c12868df725356,
title = "Secure Hamming distance computation for biometrics using ideal-lattice and ring-LWE homomorphic encryption",
abstract = "With widespread development of biometrics, concerns about security and privacy are rapidly increasing. Homomorphic encryption enables us to operate on encrypted data without decryption, and it can be applied to construct a privacy-preserving biometric system. In this article, we apply two homomorphic encryption schemes based on ideal-lattice and ring-LWE (Learning with Errors), which both have homomorphic correctness over the ring of integers of a cyclotomic field. We compare the two schemes in applying them to privacy-preserving biometrics. In biometrics, the Hamming distance is used as a metric to compare two biometric feature vectors for authentication. We propose an efficient method for secure Hamming distance. Our method can pack a biometric feature vector into a single ciphertext, and it enables efficient computation of secure Hamming distance over our packed ciphertexts.",
author = "Masaya Yasuda",
year = "2017",
month = "3",
day = "4",
doi = "10.1080/19393555.2017.1293199",
language = "English",
volume = "26",
pages = "85--103",
journal = "Information Security Journal",
issn = "1939-3555",
publisher = "Taylor and Francis Ltd.",
number = "2",

}

TY - JOUR

T1 - Secure Hamming distance computation for biometrics using ideal-lattice and ring-LWE homomorphic encryption

AU - Yasuda, Masaya

PY - 2017/3/4

Y1 - 2017/3/4

N2 - With widespread development of biometrics, concerns about security and privacy are rapidly increasing. Homomorphic encryption enables us to operate on encrypted data without decryption, and it can be applied to construct a privacy-preserving biometric system. In this article, we apply two homomorphic encryption schemes based on ideal-lattice and ring-LWE (Learning with Errors), which both have homomorphic correctness over the ring of integers of a cyclotomic field. We compare the two schemes in applying them to privacy-preserving biometrics. In biometrics, the Hamming distance is used as a metric to compare two biometric feature vectors for authentication. We propose an efficient method for secure Hamming distance. Our method can pack a biometric feature vector into a single ciphertext, and it enables efficient computation of secure Hamming distance over our packed ciphertexts.

AB - With widespread development of biometrics, concerns about security and privacy are rapidly increasing. Homomorphic encryption enables us to operate on encrypted data without decryption, and it can be applied to construct a privacy-preserving biometric system. In this article, we apply two homomorphic encryption schemes based on ideal-lattice and ring-LWE (Learning with Errors), which both have homomorphic correctness over the ring of integers of a cyclotomic field. We compare the two schemes in applying them to privacy-preserving biometrics. In biometrics, the Hamming distance is used as a metric to compare two biometric feature vectors for authentication. We propose an efficient method for secure Hamming distance. Our method can pack a biometric feature vector into a single ciphertext, and it enables efficient computation of secure Hamming distance over our packed ciphertexts.

UR - http://www.scopus.com/inward/record.url?scp=85015646769&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015646769&partnerID=8YFLogxK

U2 - 10.1080/19393555.2017.1293199

DO - 10.1080/19393555.2017.1293199

M3 - Article

VL - 26

SP - 85

EP - 103

JO - Information Security Journal

JF - Information Security Journal

SN - 1939-3555

IS - 2

ER -