Identification with encrypted biometric data

Security and Communication Networks

Volumn 4, Issue 5, 2011, Pages 548-562

  Bringer, Julien ^a   Chabanne, Hervé ^a,b   Kindarji, Bruno ^a,b  

^a Sagem Securite   (France)

^b TELECOM PARISTECH   (France)

Author keywords

Biometrics; Identification; Privacy; Searchable encryption

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY; DIGITAL STORAGE; IDENTIFICATION (CONTROL SYSTEMS);

BIOMETRIC IDENTIFICATIONS; BIOMETRIC TRAITS; HUMAN IDENTIFICATION; IDENTIFICATION SCHEME; IDENTIFICATION TECHNIQUES; LOCALITY SENSITIVE HASHING; PRIVACY CONCERNS; SEARCHABLE ENCRYPTIONS;

BIOMETRICS;

EID: 79955005687     PISSN: 19390114     EISSN: 19390122     Source Type: Journal    
DOI: 10.1002/sec.206     Document Type: Article

References (51)

1. Bringer J, Chabanne H, Kindarji B. Error-Tolerant Searchable Encryption. IEEE International Conference on Communication (ICC'09), 2009.
2. Jain AK, Nandakumar K, Nagar A. Biometric template security. EURASIP Journal on Advances in Signal Processing (Jan. 2008), pp 1-17, 2008.
3. Jain AK, Ross A, Uludag U. Biometric template security: challenges and solutions. Proceedings of 13th European Signal Processing Conference (EUSIPCO), Antalya, Turkey, 2005.
4. Bolle RM, Connell JH, Ratha NK. Biometric perils and patches. Pattern Recognition 2002; 35(12): 2727-2738.
5. Daugman J. High confidence visual recognition of persons by a test of statistical independence. IEEE Transactions on Pattern Analysis and Machine Intelligence 1993; 15(11): 1148-1161.
6. Jain AK, Prabhakar S, Hong L, Pankanti S. Fingercode: a filterbank for fingerprint representation and matching. IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'99) - Volume 2, pp 2187, 2009.
7. Tuyls P, Akkermans AHM, Kevenaar TAM, Schrijen GJ, Bazen AM, Veldhuis RNJ. Practical biometric authentication with template protection. In AVBPA, Vol. 3546, Kanade T, Jain AK, Ratha NK (eds). Springer: Berlin/Heidelberg, 2005; 436-446.
8. Dodis Y, Reyzin L, Smith A. Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. Cachin and Camenisch [49] 523-540.
9. Juels A, Wattenberg M. A fuzzy commitment scheme. ACM Conference on Computer and Communications Security, 1999; 28-36.
10. Sutcu Y, Li Q, Memon N. Protecting biometric templates with sketch: theory and practice. Information Forensics and Security, IEEE Transactions on 2007; 2(3): 503-512. DOI: 10.1109/TIFS.2007.902022
11. Nandakumar K, Nagar A, Jain AK. Hardening fingerprint fuzzy vault using password. In ICB, Lecture Notes in Computer Science, Vol. 4642, Lee SW, Li SZ (eds). Springer: Berlin/Heidelberg, 2007; 927-937.
12. Hao F, Anderson R, Daugman J. Combining crypto with biometrics effectively. Computers, IEEE Transactions on 2006; 55(9): 1081-1088. DOI: 10.1109/TC.2006.138
13. Bringer J, Chabanne H, Do QD. A fuzzy sketch with trapdoor. IEEE Transactions on Information Theory 2006; 52(5): 2266-2269.
14. Bringer J, Chabanne H, Cohen G, Kindarji B, Zémor G. Theoretical and practical boundaries of binary secure sketches. IEEE Transactions on Information Forensics and Security 2008; 3(4): 673-683.
15. Bringer J, Chabanne H, Kindarji B. The best of both worlds: applying secure sketches to cancelable biometrics. Science of Computer Programming 2008; 74(1-2): 43-51 (Special Issue on Security and Trust).
16. Nagar A, Nandakumar K, Jain AK. Securing fingerprint template: fuzzy vault with minutiae descriptors. ICPR, IEEE, 2008; 1-4.
17. Bringer J, Chabanne H, Tang Q. An application of the Naccache-Stern knapsack cryptosystem to biometric authentication. AutoID, IEEE, 2007; 180-185.
18. Bringer J, Chabanne H, Izabachène M, Pointcheval D, Tang Q, Zimmer S. An application of the Goldwasser-Micali cryptosystem to biometric authentication. In ACISP, Lecture Notes in Computer Science, Vol. 4586, Pieprzyk J, Ghodosi H, Dawson E (eds). Springer: Berlin/Heidelberg, 2007; 96-106.
19. Bringer J, Chabanne H, Pointcheval D, Tang Q. Extended private information retrieval and its application in biometrics authentications. In CANS, Lecture Notes in Computer Science, Vol. 4856, Bao F, Ling S, Okamoto T, Wang H, Xing C (eds). Springer: Berlin/Heidelberg, 2007; 175-193.
20. Schoenmakers B, Tuyls P. Efficient binary conversion for Paillier encrypted values. In EUROCRYPT, Vol. 4004, Vaudenay S (ed.). Springer: Berlin/Heidelberg, 2006; 522-537.
21. Tang Q, Bringer J, Chabanne H, Pointcheval D. A formal study of the privacy concerns in biometric-based remote authentication schemes. In ISPEC, Lecture Notes in Computer Science, Vol. 4991, Chen L, Mu Y, Susilo W (eds). Springer: Berlin/Heidelberg, 2008; 56-70.
22. Upmanyu M, Namboodiri AM, Srinathan K, Jawahar CV. Efficient biometric verification in encrypted domain. In ICB, Lecture Notes in Computer Science, Vol. 5558, Tistarelli M, Nixon MS (eds). Springer: Berlin/Heidelberg, 2009; 899-908.
23. Bringer J, Chabanne H. An authentication protocol with encrypted biometric data. In AFRICACRYPT, Lecture Notes in Computer Science, Vol. 5023, Vaudenay S (ed.), Springer: Berlin/Heidelberg, 2008; 109-124.
24. Bringer J, Chabanne H, Pointcheval D, Zimmer S. An application of the boneh and shacham group signature scheme to biometric authentication. In IWSEC, Lecture Notes in Computer Science, Vol. 5312, Matsuura K, Fujisaki E (eds). Springer: Berlin/Heidelberg, 2008; 219-230.
25. Indyk P. Nearest neighbors in high-dimensional spaces. Handbook of Discrete and Computational Geometry (2nd edition), Chapter 39, Goodman JE, O'Rourke J (eds). CRC Press LLC, Boca Raton, FL, Avril 2004.
26. Hao F, Daugman J, Zielinski P. A fast search algorithm for a large fuzzy database. Information Forensics and Security, IEEE Transactions on 2008; 3(2): 203-212. DOI: 10.1109/TIFS.2008.920726
27. Boneh D, Di Crescenzo G, Ostrovsky R, Persiano G. Public key encryption with keyword search. Cachin and Camenisch[49]; 506-522.
28. Goh EJ. Secure indexes. Cryptology ePrint Archive, Report 2003/216 2003.
29. Bethencourt J, Song DX, Waters B. New constructions and practical applications for private stream searching (extended abstract). IEEE Symposium on Security and Privacy, 2006; 132-139.
30. Byun JW, Lee DH, Lim J. Efficient conjunctive keyword search on encrypted data storage system. In EuroPKI, Vol. 4043, Atzeni AS, Lioy A (eds). Springer: Berlin/Heidelberg, 2006; 184-196.
31. Khader D. Public key encryption with keyword search based on K-resilient IBE. In ICCSA (3), Vol. 3982, Gavrilova ML, Gervasi O, Kumar V, Tan CJK, Taniar D, Laganà A, Mun Y, Choo H (eds). Springer: Berlin/Heidelberg, 2006; 298-308.
32. Ryu EK, Takagi T. Efficient conjunctive keyword-searchable encryption. AINA Workshops (1), 2007; 409-414 (IEEE Computer Society).
33. Boneh D, Kushilevitz E, Ostrovsky R, Skeith III WE. Public key encryption that allows PIR queries. In CRYPTO, Vol. 4622, Menezes A (ed.). Springer, 2007; 50-67.
34. Indyk P, Motwani R. Approximate nearest neighbors: towards removing the curse of dimensionality. Symposium on the Theory of Computing, 1998; 604-613.
35. Kushilevitz E, Ostrovsky R, Rabani Y. Efficient search for approximate nearest neighbor in high dimensional spaces. Symposium on the Theory of Computing, 1998; 614-623.
36. Kirsch A, Mitzenmacher M. Distance-sensitive Bloom filters. Algorithm Engineering & Experiments, 2006.
37. Andoni A, Indyk P. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM 2008; 51(1): 117-122.
38. Bloom BH. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 1970; 13(7): 422-426.
39. Goldwasser S, Micali S. Probabilistic encryption. Journal of Computer and System Sciences 1984; 28(2): 270-299.
40. El Gamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. CRYPTO 1984; 10-18.
41. Paillier P. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology, Proceedings of EUROCRYPT'99, LCNS, Vol. 1592, Springer: Berlin/Heidelberg, 1999; 223-238.
42. Chor B, Kushilevitz E, Goldreich O, Sudan M. Private information retrieval. Journal of the ACM 1998; 45(6): 965-981.
43. Gertner Y, Ishai Y, Kushilevitz E, Malkin T. Protecting data privacy in private information retrieval schemes. STOC 1998; 151-160.
44. Gentry C, Ramzan Z. Single-database private information retrieval with constant communication rate. In ICALP, Lecture Notes in Computer Science, Vol. 3580, Caires L, Italiano GF, Monteiro L, Palamidessi C, Yung M (eds). Springer: Berlin/Heidelberg, 2005; 803-815.
45. Lipmaa H. An oblivious transfer protocol with log-squared communication. In ISC, Vol. 3650, Zhou J, Lopez J, Deng RH, Bao F (eds). Springer: Berlin/Heidelberg, 2005; 314-328.
46. Gasarch WI. A survey on private information retrieval.
47. Ostrovsky R, Shoup V. Private information storage (extended abstract). STOC 1997; 294-303.
48. Ostrovsky R, Skeith III WE. Algebraic lower bounds for computing on encrypted data. Cryptology ePrint Archive, Report 2007/064 2007.
49. Cachinquery C, Camenisch J (eds). Advances in Cryptology-EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, 2-6 May 2004, Proceedings, LCNS, Vol. 3027, Springer: Berlin/Heidelberg, 2004.
50. Shamir A. How to share a secret. Communications of the ACM 1979; 22(11): 612-613.
51. Herzberg A, Jarecki S, Krawczyk H, Yung M. Proactive secret sharing or: how to cope with perpetual leakage. In CRYPTO, Vol. 963, Springer: Berlin/Heidelberg, 1995; 339-352.