Paper 2012/219 Original: eprint.iacr.org/2012/219 ↗
Private Fingerprint Matching
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2012-04-22: last updated
- 2012-04-22: published
- Short URL
- https://ia.cr/2012/219
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2012/219,
author = {Siamak F. Shahandashti and Reihaneh Safavi-Naini and Philip Ogunbona},
title = {Private Fingerprint Matching},
howpublished = {Cryptology {ePrint} Archive, Paper 2012/219},
year = {2012},
url = {https://eprint.iacr.org/2012/219}
}