Private fingerprint matching

RIS ID

63517

Publication Details

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

Additional Publication Information

17th Australasian Conference on Information Security and Privacy, ACISP 2012 volumeNumber: 7372 LNCS date of conference: 9 July 2012 through 11 July 2012

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.

Please refer to publisher version or contact your library.

Share

COinS
 

Link to publisher version (DOI)

http://dx.doi.org/10.1007/978-3-642-31448-3_32