Skip to main content
placeholder image

Private fingerprint matching

Journal Article


Abstract


  • We propose a fully private fingerprint matching protocol that compares two fingerprints based on the most widely-used minutia-based fingerprint matching algorithm. The protocol enables two parties, each holding a private fingerprint, to find out if their fingerprints belong to the same individual. Unlike previous works, we do not make any simplifying assumption on the matching algorithm or use generic multiparty computation protocols in our constructions. We employ a commonly-used algorithm that works by first comparing minutia pairs from the two fingerprints based on their types, locations, and orientations, and then checking if the number of matching minutia pairs is more than a threshold, and we propose a concrete, scalable, and modular protocol. We prove security against honest-but-curious adversaries and discuss how security against malicious adversaries can be achieved using standard cryptographic techniques. Our protocol is realized using common cryptographic primitives and do not require pairing- or lattice-based cryptography.

Authors


  •   Shahandashti, Siamak F. (external author)
  •   Safavi-Naini, Rei (external author)
  •   Ogunbona, Philip O.

Publication Date


  • 2012

Citation


  • Shahandashti, S. F., Safavi-Naini, R. & Ogunbona, P. (2012). Private fingerprint matching. Lecture Notes in Computer Science, 7372 426-433. Wollongong, NSW Private fingerprint matching

Scopus Eid


  • 2-s2.0-84864828111

Ro Metadata Url


  • http://ro.uow.edu.au/infopapers/2114

Has Global Citation Frequency


Number Of Pages


  • 7

Start Page


  • 426

End Page


  • 433

Volume


  • 7372

Place Of Publication


  • Germany

Abstract


  • We propose a fully private fingerprint matching protocol that compares two fingerprints based on the most widely-used minutia-based fingerprint matching algorithm. The protocol enables two parties, each holding a private fingerprint, to find out if their fingerprints belong to the same individual. Unlike previous works, we do not make any simplifying assumption on the matching algorithm or use generic multiparty computation protocols in our constructions. We employ a commonly-used algorithm that works by first comparing minutia pairs from the two fingerprints based on their types, locations, and orientations, and then checking if the number of matching minutia pairs is more than a threshold, and we propose a concrete, scalable, and modular protocol. We prove security against honest-but-curious adversaries and discuss how security against malicious adversaries can be achieved using standard cryptographic techniques. Our protocol is realized using common cryptographic primitives and do not require pairing- or lattice-based cryptography.

Authors


  •   Shahandashti, Siamak F. (external author)
  •   Safavi-Naini, Rei (external author)
  •   Ogunbona, Philip O.

Publication Date


  • 2012

Citation


  • Shahandashti, S. F., Safavi-Naini, R. & Ogunbona, P. (2012). Private fingerprint matching. Lecture Notes in Computer Science, 7372 426-433. Wollongong, NSW Private fingerprint matching

Scopus Eid


  • 2-s2.0-84864828111

Ro Metadata Url


  • http://ro.uow.edu.au/infopapers/2114

Has Global Citation Frequency


Number Of Pages


  • 7

Start Page


  • 426

End Page


  • 433

Volume


  • 7372

Place Of Publication


  • Germany