Error-tolerant searchable encryption

IEEE International Conference on Communications

Volumn , Issue , 2009, Pages

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

^a Sagem Securite   (France)

^b TELECOM PARISTECH   (France)

Author keywords

Error tolerance; Public key cryptography; Searchable encryption

Indexed keywords

BIOMETRIC IDENTIFICATIONS; ENCRYPTED DATA; ERROR TOLERANCE; ERROR TOLERANT; FIRST CONSTRUCTIONS; PERSONAL DATA; SEARCHABLE ENCRYPTION; SECURE DATABASE; SECURITY MODEL;

ANTHROPOMETRY; BIOMETRICS; COMPUTER PRIVACY; PUBLIC KEY CRYPTOGRAPHY;

NETWORK SECURITY;

EID: 70449490810     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2009.5199004     Document Type: Conference Paper

References (28)

1. J. Daugman, "High confidence visual recognition of persons by a test of statistical independence." IEEE Trans. Pattern Anal. Mach. Intell., vol. 15, no. 11, pp. 1148-1161, 1993.
2. J. Bringer, H. Chabanne, M. Izabachène, D. Pointcheval, Q. Tang, and S. Zimmer, "An application of the Goldwasser-Micali cryptosystem to biometric authentication." in ACISP, ser. LCNS, J. Pieprzyk, H. Ghodosi, and E. Dawson, Eds., vol. 4586. Springer, 2007, pp. 96-106.
3. J. Bringer, H. Chabanne, D. Pointcheval, and Q. Tang, "Extended private information retrieval and its application in biometrics authentications," in CANS, ser. LCNS, vol. 4856. Springer, 2007, pp. 175-193.
4. B. Schoenmakers and P. Tuyls, "Efficient binary conversion for Paillier encrypted values." in EUROCRYPT, vol. 4004. Springer, 2006, pp. 522-537.
5. D. X. Song, D. Wagner, and A. Perrig, "Practical techniques for searches on encrypted data." in IEEE Symposium on Security and Privacy, 2000, pp. 44-55.
6. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, "Public key encryption with keyword search." in EUROCRYPT, ser. LCNS, C. Cachin and J. Camenisch, Eds., vol. 3027. Springer, 2004, pp. 506-522.
7. E.-J. Goh, "Secure indexes," Cryptology ePrint Archive, Report 2003/216, 2003, http://eprint.iacr.org/2003/216/.
8. M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, "Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions." in CRYPTO, vol. 3621. Springer, 2005, pp. 205-222.
9. D. Khader, "Public key encryption with keyword search based on K-resilient IBE." in ICCSA (3), vol. 3982. Springer, 2006, pp. 298-308.
10. D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. E. Skeith III, "Public key encryption that allows PIR queries." in CRYPTO, vol. 4622. Springer, 2007, pp. 50-67.
11. M. Abdalla, E. Kiltz, and G. Neven, "Generalized key delegation for hierarchical identity-based encryption." in ESORICS, vol. 4734. Springer, 2007, pp. 139-154.
12. J. Birkett, A. W. Dent, G. Neven, and J. C. N. Schuldt, "Efficient chosen-ciphertext secure identity-based encryption with wildcards." in ACISP, ser. LCNS, J. Pieprzyk, H. Ghodosi, and E. Dawson, Eds., vol. 4586. Springer, 2007, pp. 274-292.
13. P. Indyk, "Nearest neighbors in high-dimensional spaces," in Handbook of Discrete and Computational Geometry, chapter 39. CRC Press, 2004, 2rd edition.
14. E. Kushilevitz, R. Ostrovsky, and Y. Rabani, "Efficient search for approximate nearest neighbor in high dimensional spaces." in Symposium on the Theory Of Computing, 1998, pp. 614-623.
15. A. Andoni and P. Indyk, "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions." Commun. ACM, vol. 51, no. 1, pp. 117-122, 2008.
16. F. Hao, J. Daugman, and P. Zielinski, "A fast search algorithm for a large fuzzy database," IEEE Trans. on Inf. Forensics and Security, 2008.
17. P. Indyk and R. Motwani, "Approximate nearest neighbors: Towards removing the curse of dimensionality." in Symposium on the Theory Of Computing, 1998, pp. 604-613.
18. A. Kirsch and M. Mitzenmacher, "Distance-sensitive Bloom filters," in Algorithm Engineering & Experiments, Jan 2006.
19. B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors." Commun. ACM, vol. 13, no. 7, pp. 422-426, 1970.
20. B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, "Private information retrieval." J. ACM, vol. 45, no. 6, pp. 965-981, 1998.
21. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, "Protecting data privacy in private information retrieval schemes." in STOC, 1998, pp. 151-160.
22. C. Gentry and Z. Ramzan, "Single-database private information retrieval with constant communication rate," in ICALP, ser. LCNS, vol. 3580. Springer, 2005, pp. 803-815.
23. H. Lipmaa, "An oblivious transfer protocol with log-squared communication." in ISC, vol. 3650. Springer, 2005, pp. 314-328.
24. W. I. Gasarch, "A survey on private information retrieval," http://www.cs.umd.edu/ gasarch/pir/pir.html.
25. R. Ostrovsky and V. Shoup, "Private information storage (extended abstract)." in STOC, 1997, pp. 294-303.
26. R. Ostrovsky and W. E. Skeith III, "Algebraic lower bounds for computing on encrypted data," Cryptology ePrint Archive, Report 2007/064, 2007, http://eprint.iacr.org/.
27. S. Goldwasser and S. Micali, "Probabilistic encryption." J. Comput. Syst. Sci., vol. 28, no. 2, pp. 270-299, 1984.
28. J. Pieprzyk, H. Ghodosi, and E. Dawson, Eds., Information Security and Privacy, 12th Australasian Conference, ACISP 2007, Proceedings, ser. LCNS, vol. 4586. Springer, 2007.