A privacy-preserving biometric matching protocol for iris codes verification

Kok Seng Wong, Myung Ho Kim

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

4 Citations (Scopus)

Abstract

Biometric-based authentication systems have been widely used in applications that require high reliable scheme. For instance, iris-based authentication systems had received great attention due to its high reliability for personal identification. However, the growing use of biometric systems in real life applications raises more attention and concern about the privacy issues. Unlike PIN or password which provides exact matches, iris-codes recognition provides a degree of probability or confidence that two iris-codes are similar based on some distance measurements. In iris verification, the biometric matching is performed by measuring the Hamming distance between the query feature vector and the template. The computation must not leak any sensitive information because the leakage of such information may allow any malicious party to reconstruct the original feature vector of the user. Once the original features have been revealed, the privacy of the user will be compromised forever. In view of this problem, we design a privacy preserving biometric matching protocol to facilitate the iris-codes matching in a privacy preserved environment. By introducing some chaff features in our computation, the malicious client who outputs an artificially low mismatch score can be easily detected by the server. Hence, our protocol makes it computationally infeasible for malicious client to impersonate as an enrolled user.

Original languageEnglish
Title of host publicationProceedings - 2012 3rd FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2012
Pages120-125
Number of pages6
DOIs
Publication statusPublished - Nov 1 2012
Externally publishedYes
Event2012 3rd FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2012 - Vancouver, BC, Canada
Duration: Jun 26 2012Jun 28 2012

Conference

Conference2012 3rd FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2012
CountryCanada
CityVancouver, BC
Period6/26/126/28/12

Fingerprint

Biometrics
Network protocols
Authentication
Hamming distance
Distance measurement
Servers

Keywords

  • Biometric-based Authentication System
  • Hamming Distance Computation
  • Iris Codes Comparison
  • Privacy preserving Protocol

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Wong, K. S., & Kim, M. H. (2012). A privacy-preserving biometric matching protocol for iris codes verification. In Proceedings - 2012 3rd FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2012 (pp. 120-125). [6305835] https://doi.org/10.1109/MUSIC.2012.28

A privacy-preserving biometric matching protocol for iris codes verification. / Wong, Kok Seng; Kim, Myung Ho.

Proceedings - 2012 3rd FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2012. 2012. p. 120-125 6305835.

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

Wong, KS & Kim, MH 2012, A privacy-preserving biometric matching protocol for iris codes verification. in Proceedings - 2012 3rd FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2012., 6305835, pp. 120-125, 2012 3rd FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2012, Vancouver, BC, Canada, 6/26/12. https://doi.org/10.1109/MUSIC.2012.28
Wong KS, Kim MH. A privacy-preserving biometric matching protocol for iris codes verification. In Proceedings - 2012 3rd FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2012. 2012. p. 120-125. 6305835 https://doi.org/10.1109/MUSIC.2012.28
Wong, Kok Seng ; Kim, Myung Ho. / A privacy-preserving biometric matching protocol for iris codes verification. Proceedings - 2012 3rd FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2012. 2012. pp. 120-125
@inproceedings{e0a772b219fc46a6b1e5e0c892990934,
title = "A privacy-preserving biometric matching protocol for iris codes verification",
abstract = "Biometric-based authentication systems have been widely used in applications that require high reliable scheme. For instance, iris-based authentication systems had received great attention due to its high reliability for personal identification. However, the growing use of biometric systems in real life applications raises more attention and concern about the privacy issues. Unlike PIN or password which provides exact matches, iris-codes recognition provides a degree of probability or confidence that two iris-codes are similar based on some distance measurements. In iris verification, the biometric matching is performed by measuring the Hamming distance between the query feature vector and the template. The computation must not leak any sensitive information because the leakage of such information may allow any malicious party to reconstruct the original feature vector of the user. Once the original features have been revealed, the privacy of the user will be compromised forever. In view of this problem, we design a privacy preserving biometric matching protocol to facilitate the iris-codes matching in a privacy preserved environment. By introducing some chaff features in our computation, the malicious client who outputs an artificially low mismatch score can be easily detected by the server. Hence, our protocol makes it computationally infeasible for malicious client to impersonate as an enrolled user.",
keywords = "Biometric-based Authentication System, Hamming Distance Computation, Iris Codes Comparison, Privacy preserving Protocol",
author = "Wong, {Kok Seng} and Kim, {Myung Ho}",
year = "2012",
month = "11",
day = "1",
doi = "10.1109/MUSIC.2012.28",
language = "English",
isbn = "9780769547275",
pages = "120--125",
booktitle = "Proceedings - 2012 3rd FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2012",

}

TY - GEN

T1 - A privacy-preserving biometric matching protocol for iris codes verification

AU - Wong, Kok Seng

AU - Kim, Myung Ho

PY - 2012/11/1

Y1 - 2012/11/1

N2 - Biometric-based authentication systems have been widely used in applications that require high reliable scheme. For instance, iris-based authentication systems had received great attention due to its high reliability for personal identification. However, the growing use of biometric systems in real life applications raises more attention and concern about the privacy issues. Unlike PIN or password which provides exact matches, iris-codes recognition provides a degree of probability or confidence that two iris-codes are similar based on some distance measurements. In iris verification, the biometric matching is performed by measuring the Hamming distance between the query feature vector and the template. The computation must not leak any sensitive information because the leakage of such information may allow any malicious party to reconstruct the original feature vector of the user. Once the original features have been revealed, the privacy of the user will be compromised forever. In view of this problem, we design a privacy preserving biometric matching protocol to facilitate the iris-codes matching in a privacy preserved environment. By introducing some chaff features in our computation, the malicious client who outputs an artificially low mismatch score can be easily detected by the server. Hence, our protocol makes it computationally infeasible for malicious client to impersonate as an enrolled user.

AB - Biometric-based authentication systems have been widely used in applications that require high reliable scheme. For instance, iris-based authentication systems had received great attention due to its high reliability for personal identification. However, the growing use of biometric systems in real life applications raises more attention and concern about the privacy issues. Unlike PIN or password which provides exact matches, iris-codes recognition provides a degree of probability or confidence that two iris-codes are similar based on some distance measurements. In iris verification, the biometric matching is performed by measuring the Hamming distance between the query feature vector and the template. The computation must not leak any sensitive information because the leakage of such information may allow any malicious party to reconstruct the original feature vector of the user. Once the original features have been revealed, the privacy of the user will be compromised forever. In view of this problem, we design a privacy preserving biometric matching protocol to facilitate the iris-codes matching in a privacy preserved environment. By introducing some chaff features in our computation, the malicious client who outputs an artificially low mismatch score can be easily detected by the server. Hence, our protocol makes it computationally infeasible for malicious client to impersonate as an enrolled user.

KW - Biometric-based Authentication System

KW - Hamming Distance Computation

KW - Iris Codes Comparison

KW - Privacy preserving Protocol

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

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

U2 - 10.1109/MUSIC.2012.28

DO - 10.1109/MUSIC.2012.28

M3 - Conference contribution

SN - 9780769547275

SP - 120

EP - 125

BT - Proceedings - 2012 3rd FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2012

ER -