Ranking-Based Locality Sensitive Hashing-Enabled Cancelable Biometrics: Index-of-Max Hashing

Zhe Jin, Jung Yeon Hwang, Yen Lung Lai, Soohyung Kim, Andrew Beng Jin Teoh

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

In this paper, we propose a ranking-based locality sensitive hashing inspired two-factor cancelable biometrics, dubbed 'Index-of-Max' (IoM) hashing for biometric template protection. With externally generated random parameters, IoM hashing transforms a real-valued biometric feature vector into discrete index (max ranked) hashed code. We demonstrate two realizations from IoM hashing notion, namely, Gaussian random projection-based and uniformly random permutation-based hashing schemes. The discrete indices representation nature of IoM hashed codes enjoys several merits. First, IoM hashing empowers strong concealment to the biometric information. This contributes to the solid ground of non-invertibility guarantee. Second, IoM hashing is insensitive to the features magnitude, hence is more robust against biometric features variation. Third, the magnitude-independence trait of IoM hashing makes the hash codes being scale-invariant, which is critical for matching and feature alignment. The experimental results demonstrate favorable accuracy performance on benchmark FVC2002 and FVC2004 fingerprint databases. The analyses justify its resilience to the existing and newly introduced security and privacy attacks as well as satisfy the revocability and unlinkability criteria of cancelable biometrics.

Original languageEnglish
Article number8038818
Pages (from-to)393-407
Number of pages15
JournalIEEE Transactions on Information Forensics and Security
Volume13
Issue number2
DOIs
Publication statusPublished - 2018 Feb

Fingerprint

Biometrics

All Science Journal Classification (ASJC) codes

  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications

Cite this

@article{05dafd45569247deb8ec7d77f39148f3,
title = "Ranking-Based Locality Sensitive Hashing-Enabled Cancelable Biometrics: Index-of-Max Hashing",
abstract = "In this paper, we propose a ranking-based locality sensitive hashing inspired two-factor cancelable biometrics, dubbed 'Index-of-Max' (IoM) hashing for biometric template protection. With externally generated random parameters, IoM hashing transforms a real-valued biometric feature vector into discrete index (max ranked) hashed code. We demonstrate two realizations from IoM hashing notion, namely, Gaussian random projection-based and uniformly random permutation-based hashing schemes. The discrete indices representation nature of IoM hashed codes enjoys several merits. First, IoM hashing empowers strong concealment to the biometric information. This contributes to the solid ground of non-invertibility guarantee. Second, IoM hashing is insensitive to the features magnitude, hence is more robust against biometric features variation. Third, the magnitude-independence trait of IoM hashing makes the hash codes being scale-invariant, which is critical for matching and feature alignment. The experimental results demonstrate favorable accuracy performance on benchmark FVC2002 and FVC2004 fingerprint databases. The analyses justify its resilience to the existing and newly introduced security and privacy attacks as well as satisfy the revocability and unlinkability criteria of cancelable biometrics.",
author = "Zhe Jin and Hwang, {Jung Yeon} and Lai, {Yen Lung} and Soohyung Kim and Teoh, {Andrew Beng Jin}",
year = "2018",
month = "2",
doi = "10.1109/TIFS.2017.2753172",
language = "English",
volume = "13",
pages = "393--407",
journal = "IEEE Transactions on Information Forensics and Security",
issn = "1556-6013",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

Ranking-Based Locality Sensitive Hashing-Enabled Cancelable Biometrics : Index-of-Max Hashing. / Jin, Zhe; Hwang, Jung Yeon; Lai, Yen Lung; Kim, Soohyung; Teoh, Andrew Beng Jin.

In: IEEE Transactions on Information Forensics and Security, Vol. 13, No. 2, 8038818, 02.2018, p. 393-407.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Ranking-Based Locality Sensitive Hashing-Enabled Cancelable Biometrics

T2 - Index-of-Max Hashing

AU - Jin, Zhe

AU - Hwang, Jung Yeon

AU - Lai, Yen Lung

AU - Kim, Soohyung

AU - Teoh, Andrew Beng Jin

PY - 2018/2

Y1 - 2018/2

N2 - In this paper, we propose a ranking-based locality sensitive hashing inspired two-factor cancelable biometrics, dubbed 'Index-of-Max' (IoM) hashing for biometric template protection. With externally generated random parameters, IoM hashing transforms a real-valued biometric feature vector into discrete index (max ranked) hashed code. We demonstrate two realizations from IoM hashing notion, namely, Gaussian random projection-based and uniformly random permutation-based hashing schemes. The discrete indices representation nature of IoM hashed codes enjoys several merits. First, IoM hashing empowers strong concealment to the biometric information. This contributes to the solid ground of non-invertibility guarantee. Second, IoM hashing is insensitive to the features magnitude, hence is more robust against biometric features variation. Third, the magnitude-independence trait of IoM hashing makes the hash codes being scale-invariant, which is critical for matching and feature alignment. The experimental results demonstrate favorable accuracy performance on benchmark FVC2002 and FVC2004 fingerprint databases. The analyses justify its resilience to the existing and newly introduced security and privacy attacks as well as satisfy the revocability and unlinkability criteria of cancelable biometrics.

AB - In this paper, we propose a ranking-based locality sensitive hashing inspired two-factor cancelable biometrics, dubbed 'Index-of-Max' (IoM) hashing for biometric template protection. With externally generated random parameters, IoM hashing transforms a real-valued biometric feature vector into discrete index (max ranked) hashed code. We demonstrate two realizations from IoM hashing notion, namely, Gaussian random projection-based and uniformly random permutation-based hashing schemes. The discrete indices representation nature of IoM hashed codes enjoys several merits. First, IoM hashing empowers strong concealment to the biometric information. This contributes to the solid ground of non-invertibility guarantee. Second, IoM hashing is insensitive to the features magnitude, hence is more robust against biometric features variation. Third, the magnitude-independence trait of IoM hashing makes the hash codes being scale-invariant, which is critical for matching and feature alignment. The experimental results demonstrate favorable accuracy performance on benchmark FVC2002 and FVC2004 fingerprint databases. The analyses justify its resilience to the existing and newly introduced security and privacy attacks as well as satisfy the revocability and unlinkability criteria of cancelable biometrics.

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

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

U2 - 10.1109/TIFS.2017.2753172

DO - 10.1109/TIFS.2017.2753172

M3 - Article

AN - SCOPUS:85030212455

VL - 13

SP - 393

EP - 407

JO - IEEE Transactions on Information Forensics and Security

JF - IEEE Transactions on Information Forensics and Security

SN - 1556-6013

IS - 2

M1 - 8038818

ER -