Mauro Barni
ABSTRACT
We present a privacy preserving protocol for fingerprint-based authentication. We consider a scenario where a client equipped with a fingerprint reader is interested into learning if the acquired fingerprint belongs to the database of authorized entities managed by a server. For security, it is required that the client does not learn anything on the database and the server should not get any information about the requested biometry and the outcome of the matching process. The proposed protocol follows a multi-party computation approach and makes extensive use of homomorphic encryption as underlying cryptographic primitive. To keep the protocol complexity as low as possible, a particular representation of fingerprint images, named Fingercode, is adopted. Although the previous works on privacy-preserving biometric identification focus on selecting the best matching identity in the database, our main solution is a generic identification protocol and it allows to select and report all the enrolled identities whose distance to the user's fingercode is under a given threshold. Variants for simple authentication purposes are provided. Our protocols gain a notable bandwidth saving (about 25-39%) if compared with the best previous work (ICISC'09) and its computational complexity is still low and suitable for practical applications. Moreover, even if such protocols are presented in the context of a fingerprint-based system, they can be generalized to any biometric system that shares the same matching methodology, namely distance computation and thresholding.
- A. Sadeghi, T. Schneider, and I. Wehrenberg, "Efficient privacy-preserving face recognition," in ICISC '09: Proceedings of the 12th Annual International Conference on Information Security and Cryptology, ser. LNCS, vol. 5984. Springer-Verlag, December 2--4, 2009, pp. 235{253, full version available at http://eprint.iacr.org/2009/507. Google Scholar
Digital Library
- R. Bolle and S. Pankanti, Biometrics: Personal Identification in Networked Society, A. K. Jain, Ed. Norwell, MA, USA: Kluwer Academic Publishers, 1998.Google Scholar
- Z. Erkin, M. Franz, J. Guajardo, S. Katzenbeisser, I. Lagendijk, and T. Toft, "Privacy-preserving face recognition," in PETS '09: Proceedings of the 9th International Symposium on Privacy Enhancing Technologies. Berlin, Heidelberg: Springer-Verlag, 2009, pp. 235--253. Google ScholarDigital Library
- A. Jain, S. Prabhakar, L. Hong, and S. Pankanti, "Filterbank-based fingerprint matching," Image Processing, IEEE Transactions on, vol. 9, no. 5, pp. 846--859, May 2000. Google ScholarDigital Library
- D. Maltoni, D. Maio, A. K. Jain, and S. Prabhakar, Handbook of Fingerprint Recognition. Springer Publishing Company, Incorporated, 2009. Google ScholarDigital Library
- A. Jain, L. Hong, S. Pankanti, and R. Bolle, "An identity-authentication system using fingerprints." Proc. IEEE, 85, (9), pp. 1364--1388, 1997.Google ScholarCross Ref
- C. L. Wilson, C. Watson,, and E. Peak, "Effect of resolution and image quality on combined optical and neural network fingerprint matching," Putt. Recognit., 33, (Z), pp. 317--331, 2000.Google ScholarCross Ref
- C. Lee and S. Wang, "Fingerprint feature extraction using gabor filters," Eleclron. Lett., 35, (4), pp. 288--290, 1999.Google ScholarCross Ref
- H.-W. Sun, K.-Y. Lam, M. Gu, and J.-G. Sun, "An efficient algorithm for fingercode-based biometric identification," in OTM Workshops (1), 2006, pp. 469--478. Google ScholarDigital Library
- A. Jain, S. Prabhakar, and L. Hong, "A multichannel approach to fingerprint classification," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 21, no. 4, pp. 348--359, Apr 1999. Google ScholarDigital Library
- M. Turk and A. Pentland, "Face recognition using eigenfaces," in Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on, 1991, pp. 586--591.Google Scholar
- "Nist recommendation for key management," ser. NIST Special Publication, vol. 800--57, August 2005.Google Scholar
- P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in EUROCRYPT'99, ser. LNCS, J. Stern, Ed., vol. 1592. Springer-Verlag, Berlin, Germany, May 1999, pp. 223--238. Google ScholarDigital Library
- I. Damgård, M. Geisler, and M. Krøigard, "Efficient and secure comparison for on-line auctions," in ACISP, ser. Lecture Notes in Computer Science, J. Pieprzyk, H. Ghodosi, and E. Dawson, Eds., vol. 4586. Springer, 2007, pp. 416--430. Google ScholarDigital Library
- J. Cohen and M. Fischer, "A robust and verifiable cryptographically secure election scheme," in 26th FOCS. IEEE Computer Society Press, Oct. 1985. Google ScholarDigital Library
- T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," in CRYPTO'84, ser. LNCS, G. R. Blakley and D. Chaum, Eds., vol. 196. Springer-Verlag, Berlin, Germany, Aug. 1985, pp. 10--18. Google ScholarDigital Library
- "Standard for efficient cryptography, SEC1: Elliptic curves cryptography," Technical report, Certicom Research, 2000, available at http://www.secg.org.Google Scholar
- "Standard for efficient cryptography, SEC2: Recommended elliptic curves domain parameters," Technical report, Certicom Research, 2000, available at http://www.secg.org.Google Scholar
- V. Kolesnikov and T. Schneider, "Improved garbled circuit: Free xor gates and applications," in ICALP '08: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II. Berlin, Heidelberg: Springer-Verlag, 2008, pp. 486--498. Google ScholarDigital Library
- B. Pinkas, T. Schneider, N. Smart, and S. Williams, "Secure two-party computation is practical," in ASIACRYPT, ser. Lecture Notes in Computer Science, M. Matsui, Ed., vol. 5912. Springer, 2009, pp. 250--267. Google ScholarDigital Library
- D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, "Fairplay|a secure two-party computation system," in SSYM'04: Proceedings of the 13th conference on USENIX Security Symposium. Berkeley, CA, USA: USENIX Association, 2004, pp. 20--20. Google ScholarDigital Library
- M. Naor and B. Pinkas, "Efficient oblivious transfer protocols," in SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2001, pp. 448--457. Google ScholarDigital Library
Index Terms
- Privacy-preserving fingercode authentication
Recommendations
Privacy-preserving iris authentication using fully homomorphic encryption
AbstractRapid advancement in technology has led to the use of biometric authentication in every field. In particular, from the past few years, iris recognition systems has gained overwhelming advancement over other biometric traits due to its stability ...
Privacy-preserving continuous authentication using behavioral biometrics
AbstractContinuous authentication modalities collect and utilize users’ sensitive data to authenticate them continuously. Such data contain information about user activities, behaviors, and other demographic information, which causes privacy concerns. In ...
Privacy-preserving and verifiable multi-instance iris remote authentication using public auditor
AbstractHomomorphic Encryption (HE) is the most widely explored research area to construct privacy-preserving biometric authentication systems due to its advantages over cancelable biometrics and biometric cryptosystem. However, most of the existing ...
Comments