z-logo
open-access-imgOpen Access
A Cancelable Fuzzy Vault Algorithm Based on Transformed Fingerprint Features
Author(s) -
You Lin,
Yang Ling,
Yu Wangke,
Wu Zhendong
Publication year - 2017
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2017.01.009
Subject(s) - vault (architecture) , fingerprint (computing) , biometrics , computer science , cryptography , fuzzy logic , matching (statistics) , key (lock) , computational complexity theory , algorithm , fingerprint recognition , data mining , approximate string matching , blossom algorithm , pattern recognition (psychology) , artificial intelligence , theoretical computer science , computer security , mathematics , pattern matching , engineering , statistics , structural engineering
Juels and Sudan proposed in 2002 an algorithm for computing a fuzzy vault that binds a user's biometric template with his secret. It was suggested that this vault could be used to securely store one's secret or a cryptographic key without losing his biometric information. However, in this classical fuzzy vault, if an attacker captures multiple vaults generated from one biometric template, he is able to obtain some biometric template information by cross‐matching, and then he can use it to illegally recover the secret message. To overcome this disadvantage, in this paper, a cancelable fuzzy vault algorithm is proposed based on the user's transformed fingerprint features which are used to generate a fuzzy vault. Our novel fuzzy vault is secure and can overcome the cross‐matching attack without intensive computational complexity. Also, the use of three check values makes our vault have a much higher probability to detect a false query fingerprint template than some other vault versions, and it will highly improve the probability whether the reconstructed polynomial is correct or not.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here