The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
L'authentification biométrique a attiré l'attention en raison de sa haute sécurité et de sa commodité. Cependant, les fonctionnalités biométriques telles que les empreintes digitales ne peuvent pas être révoquées comme les mots de passe. Ainsi, une fois que les données biométriques d'un utilisateur stockées dans le système ont été compromises, elles ne peuvent plus être utilisées pour une authentification sécurisée pendant toute sa vie. Pour résoudre ce problème, un système d'authentification appelé biométrie annulable a été étudié. Cependant, il reste un défi majeur à relever pour parvenir à la fois à une sécurité élevée et à une précision pratique. Dans cet article, nous proposons un nouvel algorithme fondamental pour la biométrie annulable appelé filtrage aléatoire invariant par corrélation (CIRF) avec une sécurité prouvable. Ensuite, nous construisons une méthode pour générer des modèles d'empreintes digitales annulables basées sur l'algorithme de correspondance de puces et le CIRF. L'évaluation expérimentale montre que notre méthode a presque la même précision que la vérification conventionnelle des empreintes digitales basée sur l'algorithme de correspondance des puces.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Kenta TAKAHASHI, Shinji HIRATA, "Cancelable Biometrics with Provable Security and Its Application to Fingerprint Verification" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 1, pp. 233-244, January 2011, doi: 10.1587/transfun.E94.A.233.
Abstract: Biometric authentication has attracted attention because of its high security and convenience. However, biometric feature such as fingerprint can not be revoked like passwords. Thus once the biometric data of a user stored in the system has been compromised, it can not be used for authentication securely for his/her whole life long. To address this issue, an authentication scheme called cancelable biometrics has been studied. However, there remains a major challenge to achieve both strong security and practical accuracy. In this paper, we propose a novel and fundamental algorithm for cancelable biometrics called correlation-invariant random filtering (CIRF) with provable security. Then we construct a method for generating cancelable fingerprint templates based on the chip matching algorithm and the CIRF. Experimental evaluation shows that our method has almost the same accuracy as the conventional fingerprint verification based on the chip matching algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.233/_p
Copier
@ARTICLE{e94-a_1_233,
author={Kenta TAKAHASHI, Shinji HIRATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Cancelable Biometrics with Provable Security and Its Application to Fingerprint Verification},
year={2011},
volume={E94-A},
number={1},
pages={233-244},
abstract={Biometric authentication has attracted attention because of its high security and convenience. However, biometric feature such as fingerprint can not be revoked like passwords. Thus once the biometric data of a user stored in the system has been compromised, it can not be used for authentication securely for his/her whole life long. To address this issue, an authentication scheme called cancelable biometrics has been studied. However, there remains a major challenge to achieve both strong security and practical accuracy. In this paper, we propose a novel and fundamental algorithm for cancelable biometrics called correlation-invariant random filtering (CIRF) with provable security. Then we construct a method for generating cancelable fingerprint templates based on the chip matching algorithm and the CIRF. Experimental evaluation shows that our method has almost the same accuracy as the conventional fingerprint verification based on the chip matching algorithm.},
keywords={},
doi={10.1587/transfun.E94.A.233},
ISSN={1745-1337},
month={January},}
Copier
TY - JOUR
TI - Cancelable Biometrics with Provable Security and Its Application to Fingerprint Verification
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 233
EP - 244
AU - Kenta TAKAHASHI
AU - Shinji HIRATA
PY - 2011
DO - 10.1587/transfun.E94.A.233
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2011
AB - Biometric authentication has attracted attention because of its high security and convenience. However, biometric feature such as fingerprint can not be revoked like passwords. Thus once the biometric data of a user stored in the system has been compromised, it can not be used for authentication securely for his/her whole life long. To address this issue, an authentication scheme called cancelable biometrics has been studied. However, there remains a major challenge to achieve both strong security and practical accuracy. In this paper, we propose a novel and fundamental algorithm for cancelable biometrics called correlation-invariant random filtering (CIRF) with provable security. Then we construct a method for generating cancelable fingerprint templates based on the chip matching algorithm and the CIRF. Experimental evaluation shows that our method has almost the same accuracy as the conventional fingerprint verification based on the chip matching algorithm.
ER -