TY - GEN
T1 - Security and accuracy trade-off in anonymous fingerprint recognition
AU - Farooq, Faisal
AU - Ratha, Nalini
AU - Jea, Tsai Yang
AU - Bolle, Ruud
PY - 2007
Y1 - 2007
N2 - The security, lack of anonymity and revocability of the biometric template are critical issues that need to be addressed in order to vindicate the viability of biometric based authentication systems. Several methods have been proposed to address these problems. However, most of these methods offer lower accuracies than the base system where the template is insecure. This is because in most systems the gain in the security is achieved as a result of loss in non-redundant information. In this paper, we describe tradeoff between accuracy of an anonymous system and the security of the biometrics system. As a case study we start with a highly secure representation of a fingerprint. Then we describe several methods and show experimental results proving that every time we add more information to the secure representation, the accuracy increases, however valuable information is revealed to an adversary. We propose, via a k-trial attack model, how the trade-off can be complemented by another security policy such as an account lockout after a given number of attempts.
AB - The security, lack of anonymity and revocability of the biometric template are critical issues that need to be addressed in order to vindicate the viability of biometric based authentication systems. Several methods have been proposed to address these problems. However, most of these methods offer lower accuracies than the base system where the template is insecure. This is because in most systems the gain in the security is achieved as a result of loss in non-redundant information. In this paper, we describe tradeoff between accuracy of an anonymous system and the security of the biometrics system. As a case study we start with a highly secure representation of a fingerprint. Then we describe several methods and show experimental results proving that every time we add more information to the secure representation, the accuracy increases, however valuable information is revealed to an adversary. We propose, via a k-trial attack model, how the trade-off can be complemented by another security policy such as an account lockout after a given number of attempts.
UR - https://www.scopus.com/pages/publications/48649094748
U2 - 10.1109/BTAS.2007.4401917
DO - 10.1109/BTAS.2007.4401917
M3 - Conference contribution
AN - SCOPUS:48649094748
SN - 9781424415977
T3 - IEEE Conference on Biometrics: Theory, Applications and Systems, BTAS'07
BT - IEEE Conference on Biometrics
T2 - 1st IEEE International Conference on Biometrics: Theory, Applications, and Systems, BTAS '07
Y2 - 27 September 2007 through 29 September 2007
ER -