Ranking-Based Locality Sensitive Hashing-Enabled Cancelable Biometrics: Index-of-Max Hashing
- 15 September 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 13 (2) , 393-407
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.Keywords
All Related Versions
Funding Information
- Institute for Information and Communications Technology Promotion (IITP) through the Korean Government (MSIT) (Development of Biometrics-Based Key Infrastructure Technology for On-line Identification) (2016-0-00097)
This publication has 41 references indexed in Scilit:
- Cancellable iris template generation based on Indexing-First-One hashingPattern Recognition, 2017
- Linear Subspace Ranking Hashing for Cross-Modal RetrievalIEEE Transactions on Pattern Analysis and Machine Intelligence, 2016
- Noninvertible Minutia Cylinder-Code RepresentationIEEE Transactions on Information Forensics and Security, 2012
- Relative attributes2011
- The power of comparative reasoning2011
- Dimensionality reduction: beyond the Johnson-Lindenstrauss bound2011
- Random Multispace Quantization as an Analytic Mechanism for BioHashing of Biometric and Random Identity InputsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2006
- Similarity estimation techniques from rounding algorithms2002
- Nonlinear Component Analysis as a Kernel Eigenvalue ProblemNeural Computation, 1998
- Improved approximation algorithms for MAXk-CUT and MAX BISECTIONAlgorithmica, 1997