Cancellable biometrics and annotations on BioHash

Lately, the once powerful one-factor authentication which is based solely on either password, token or biometric approach, appears to be insufficient in addressing the challenges of identity frauds. For example, the sole biometric approach suffers from the privacy invasion and nonrevocable issues. P...

Full description

Bibliographic Details
Main Authors: TEOH, A, KUAN, Y, LEE, S
Format: Article
Language:English
Published: PERGAMON-ELSEVIER SCIENCE LTD 2008
Subjects:
Online Access:http://shdl.mmu.edu.my/2662/
http://shdl.mmu.edu.my/2662/1/764.pdf
_version_ 1848790117323374592
author TEOH, A
KUAN, Y
LEE, S
author_facet TEOH, A
KUAN, Y
LEE, S
author_sort TEOH, A
building MMU Institutional Repository
collection Online Access
description Lately, the once powerful one-factor authentication which is based solely on either password, token or biometric approach, appears to be insufficient in addressing the challenges of identity frauds. For example, the sole biometric approach suffers from the privacy invasion and nonrevocable issues. Passwords and tokens are easily forgotten and lost. To address these issues, the notion of cancellable biometrics was introduced to denote biometric templates that can be cancelled and replaced with the inclusion of another independent authentication factor. BioHash is a form of cancellable biometrics which mixes a set of user-specific random vectors with biometric features. In verification setting, BioHash is able to deliver extremely low error rates as compared to the sole biometric approach when a genuine token is used. However, this raises the possibility of two identity theft scenarios: (i) stolen-biometrics, in which an impostor possesses intercepted biometric data of sufficient high quality to be considered genuine and (ii) stolen-token, in which an impostor has access to the genuine token and used by the impostor to claim as the genuine user. We found that the recognition rate for the latter case is poorer. In this paper, the quantised random projection ensemble based on the Johnson-Lindenstrauss Lemma is used to establish the mathematical foundation of BioHash. Based on this model, we elucidate the characteristics of BioHash in pattern recognition as well as security view points and propose new methods to rectify the stolen-token problem. (C) 2007 Elsevier Ltd. All rights reserved.
first_indexed 2025-11-14T18:07:31Z
format Article
id mmu-2662
institution Multimedia University
institution_category Local University
language English
last_indexed 2025-11-14T18:07:31Z
publishDate 2008
publisher PERGAMON-ELSEVIER SCIENCE LTD
recordtype eprints
repository_type Digital Repository
spelling mmu-26622014-02-25T03:05:02Z http://shdl.mmu.edu.my/2662/ Cancellable biometrics and annotations on BioHash TEOH, A KUAN, Y LEE, S T Technology (General) QA75.5-76.95 Electronic computers. Computer science Lately, the once powerful one-factor authentication which is based solely on either password, token or biometric approach, appears to be insufficient in addressing the challenges of identity frauds. For example, the sole biometric approach suffers from the privacy invasion and nonrevocable issues. Passwords and tokens are easily forgotten and lost. To address these issues, the notion of cancellable biometrics was introduced to denote biometric templates that can be cancelled and replaced with the inclusion of another independent authentication factor. BioHash is a form of cancellable biometrics which mixes a set of user-specific random vectors with biometric features. In verification setting, BioHash is able to deliver extremely low error rates as compared to the sole biometric approach when a genuine token is used. However, this raises the possibility of two identity theft scenarios: (i) stolen-biometrics, in which an impostor possesses intercepted biometric data of sufficient high quality to be considered genuine and (ii) stolen-token, in which an impostor has access to the genuine token and used by the impostor to claim as the genuine user. We found that the recognition rate for the latter case is poorer. In this paper, the quantised random projection ensemble based on the Johnson-Lindenstrauss Lemma is used to establish the mathematical foundation of BioHash. Based on this model, we elucidate the characteristics of BioHash in pattern recognition as well as security view points and propose new methods to rectify the stolen-token problem. (C) 2007 Elsevier Ltd. All rights reserved. PERGAMON-ELSEVIER SCIENCE LTD 2008-06 Article NonPeerReviewed text en http://shdl.mmu.edu.my/2662/1/764.pdf TEOH, A and KUAN, Y and LEE, S (2008) Cancellable biometrics and annotations on BioHash. Pattern Recognition, 41 (6). pp. 2034-2044. ISSN 00313203 http://dx.doi.org/10.1016/j.patcog.2007.12.002 doi:10.1016/j.patcog.2007.12.002 doi:10.1016/j.patcog.2007.12.002
spellingShingle T Technology (General)
QA75.5-76.95 Electronic computers. Computer science
TEOH, A
KUAN, Y
LEE, S
Cancellable biometrics and annotations on BioHash
title Cancellable biometrics and annotations on BioHash
title_full Cancellable biometrics and annotations on BioHash
title_fullStr Cancellable biometrics and annotations on BioHash
title_full_unstemmed Cancellable biometrics and annotations on BioHash
title_short Cancellable biometrics and annotations on BioHash
title_sort cancellable biometrics and annotations on biohash
topic T Technology (General)
QA75.5-76.95 Electronic computers. Computer science
url http://shdl.mmu.edu.my/2662/
http://shdl.mmu.edu.my/2662/
http://shdl.mmu.edu.my/2662/
http://shdl.mmu.edu.my/2662/1/764.pdf