Unconditionally provably secure cancellable biometrics based on a quotient polynomial ring
Biometric authentication has attracted attention because of its high security and usability. However, biometric features such as fingerprints are unchangeable throughout the life of individuals. Thus, once biometric data have been compromised, they cannot be used for authentication securely ever again. To address this issue, an authentication scheme called cancellable biometrics has been studied. However, there remains a major challenge to achieve both strong security and practical accuracy. The correlation invariant random filtering (CIRF) is an algorithm for cancellable biometrics with provable security and practical accuracy. However, the security proof requires an unrealistically strong assumption with regard to biometric features. The authors examine the security of the CIRF when the assumption is not satisfied, and show that there are vulnerabilities. To address the problems, the authors interpret the CIRF from an algebraic point of view and generalise it based on a quotient polynomial ring. Then several theorems are proved, which derive a new transformation algorithm. The security of the algorithm without any condition on the biometric features is proved. The authors also evaluate the accuracy of the algorithm by applying it to the chip matching algorithm for fingerprint verification and show that it does not degrade the matching accuracy.
