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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.