Share Email Print

Proceedings Paper

Robust minutiae hash for fingerprint template protection
Author(s): Bian Yang; Christoph Busch; Patrick Bours; Davrondzhon Gafurov
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 27 January 2010
PDF: 9 pages
Proc. SPIE 7541, Media Forensics and Security II, 75410R (27 January 2010); doi: 10.1117/12.838998
Show Author Affiliations
Bian Yang, Gjøvik Univ. College (Norway)
Christoph Busch, Gjøvik Univ. College (Norway)
Patrick Bours, Gjøvik Univ. College (Norway)
Davrondzhon Gafurov, Gjøvik Univ. College (Norway)

Published in SPIE Proceedings Vol. 7541:
Media Forensics and Security II
Nasir D. Memon; Jana Dittmann; Adnan M. Alattar; Edward J. Delp III, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?