Secure fingerprint hashes using subsets of local structures

Tom Effland; Mariel Schneggenburger; Jim Schuler; Bingsheng Zhang; Jesse Hartloff; Jimmy Dobler; Sergey Tulyakov; Atri Rudra; Venu Govindaraju

doi:10.1117/12.2050477

29 May 2014 Secure fingerprint hashes using subsets of local structures

Tom Effland, Mariel Schneggenburger, Jim Schuler, Bingsheng Zhang, Jesse Hartloff, Jimmy Dobler, Sergey Tulyakov, Atri Rudra, Venu Govindaraju

Author Affiliations +

Proceedings Volume 9075, Biometric and Surveillance Technology for Human and Activity Identification XI; 90750D (2014) https://doi.org/10.1117/12.2050477
Event: SPIE Defense + Security, 2014, Baltimore, MD, United States

Abstract

In order to fulfill the potential of fingerprint templates as the basis for authentication schemes, one needs to design a hash function for fingerprints that achieves acceptable matching accuracy and simultaneously has provable security guarantees, especially for parameter regimes that are needed to match fingerprints in practice. While existing matching algorithms can achieve impressive matching accuracy, they have no security guarantees. On the other hand, provable secure hash functions have bad matching accuracy and/or do not guarantee security when parameters are set to practical values. In this work, we present a secure hash function that has the best known tradeoff between security guarantees and matching accuracy. At a high level, our hash function is simple: we apply an off-the shelf hash function on certain collections of minutia points (in particular, triplets of minutia triangles"). However, to realize the potential of this scheme, we have to overcome certain theoretical and practical hurdles. In addition to the novel idea of combining clustering ideas from matching algorithms with ideas from the provable security of hash functions, we also apply an intermediate translation-invariant but rotation-variant map to the minutia points before applying the hash function. This latter idea helps improve the tradeoff between matching accuracy and matching efficiency.

Citation Download Citation

Tom Effland, Mariel Schneggenburger, Jim Schuler, Bingsheng Zhang, Jesse Hartloff, Jimmy Dobler, Sergey Tulyakov, Atri Rudra, and Venu Govindaraju "Secure fingerprint hashes using subsets of local structures", Proc. SPIE 9075, Biometric and Surveillance Technology for Human and Activity Identification XI, 90750D (29 May 2014); https://doi.org/10.1117/12.2050477

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

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.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available