Ranking Based Locality Sensitive Hashing Enabled Cancelable Biometrics: Index-of-Max Hashing
Authors:
- Zhe JinZJZhe Jin
- Yen-Lung LaiYLYen-Lung Lai
- Jung-Yeon HwangJHJung-Yeon Hwang
- Soohyung KimSKSoohyung Kim
- Andrew Beng Jin TeohATAndrew Beng Jin Teoh
Preprint
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 enjoy serveral merits. Firstly, IoM hashing empowers strong concealment to the biometric information. This contributes to the solid ground of non-invertibility guarantee. Secondly, IoM hashing is insensitive to the features magnitude, hence is more robust against biometric features variation. Thirdly, 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.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Cancellable iris template generation based on Indexing-First-One hashingPattern Recognition, 2017
- A blind system identification approach to cancelable fingerprint templatesPattern Recognition, 2016
- Cancelable Biometrics: A reviewIEEE Signal Processing Magazine, 2015
- Biometric Template Protection: Bridging the performance gap between theory and practiceIEEE Signal Processing Magazine, 2015
- On application of bloom filters to iris biometricsIET Biometrics, 2014
- A non-invertible Randomized Graph-based Hamming Embedding for generating cancelable fingerprint templatePattern Recognition Letters, 2014
- Enhanced multi-line code for minutiae-based fingerprint template protectionPattern Recognition Letters, 2013
- Noninvertible Minutia Cylinder-Code RepresentationIEEE Transactions on Information Forensics and Security, 2012
- High security Iris verification system based on random secret integrationComputer Vision and Image Understanding, 2006
- Improved approximation algorithms for MAXk-CUT and MAX BISECTIONAlgorithmica, 1997