27 January 2010 Robust minutiae hash for fingerprint template protection
Author Affiliations +
A robust fingerprint minutiae hash generation algorithm is proposed in this paper to extract a binary secure hash bit string from each fingerprint minutia and its vicinity. First, ordering of minutiae points and rotation and translation geometric alignment of each minutiae vicinity are achieved; second, the ordered and aligned points are diversified by offsetting their coordinates and angles in a random way; and finally, an ordered binary minutia hash bit string is extracted by quantizing the coordinates and angle values of the points in the diversified minutiae vicinity. The generated hashes from all minutiae vicinities in the original template form a protected template, which can be used to represent the original minutia template for identity verification. Experiments show desirable comparison performance (average Equal Error Rate 0.0233 using the first two samples of each finger in FVC2002DB2_A) by the proposed algorithm. The proposed biometric reference requires less template storage capacity compared to their unprotected counterparts. A security analysis is also given for the proposed algorithm.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bian Yang, Bian Yang, Christoph Busch, Christoph Busch, Patrick Bours, Patrick Bours, Davrondzhon Gafurov, Davrondzhon Gafurov, } "Robust minutiae hash for fingerprint template protection", Proc. SPIE 7541, Media Forensics and Security II, 75410R (27 January 2010); doi: 10.1117/12.838998; https://doi.org/10.1117/12.838998


Security analysis for fingerprint fuzzy vaults
Proceedings of SPIE (May 30 2013)
A hybrid approach for face template protection
Proceedings of SPIE (March 16 2008)
Face biometrics with renewable templates
Proceedings of SPIE (February 14 2006)

Back to Top