Cancelable Biometrics: A review
- 12 August 2015
- journal article
- review article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Magazine
- Vol. 32 (5), 54-65
- https://doi.org/10.1109/msp.2015.2434151
Abstract
Recent years have seen an exponential growth in the use of various biometric technologies for trusted automatic recognition of humans. With the rapid adaptation of biometric systems, there is a growing concern that biometric technologies may compromise the privacy and anonymity of individuals. Unlike credit cards and passwords, which can be revoked and reissued when compromised, biometrics are permanently associated with a user and cannot be replaced. To prevent the theft of biometric patterns, it is desirable to modify them through revocable and noninvertible transformations to produce cancelable biometric templates. In this article, we provide an overview of various cancelable biometric schemes for biometric template protection. We discuss the merits and drawbacks of available cancelable biometric systems and identify promising avenues of research in this rapidly evolving field.Keywords
This publication has 61 references indexed in Scilit:
- A survey on biometric cryptosystems and cancelable biometricsEURASIP Journal on Information Security, 2011
- Cancelable Biometrics with Provable Security and Its Application to Fingerprint VerificationIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011
- Dictionary Attack on Functional Transform-Based Cancelable Fingerprint TemplatesETRI Journal, 2009
- Cancellable biometrics and annotations on BioHashPattern Recognition, 2008
- An improved BioHashing for human authenticationPattern Recognition, 2006
- A Fuzzy Vault SchemeDesigns, Codes and Cryptography, 2006
- An analysis of BioHashing and its variantsPattern Recognition, 2005
- PalmHashing: a novel approach for cancelable biometricsInformation Processing Letters, 2004
- Biohashing: two factor authentication featuring fingerprint data and tokenised random numberPattern Recognition, 2004
- An elementary proof of a theorem of Johnson and LindenstraussRandom Structures & Algorithms, 2002