Fuzzy private matching (extended abstract)

ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings

Volumn , Issue , 2008, Pages 327-334

  Chmielewski, Łukasz ^a   Hoepman, Jaap Henk ^a,b  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b TNO   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; HELIUM;

INTERNATIONAL CONFERENCES; MATCHING PROBLEMS; MESSAGE COMPLEXITY; TIME COMPLEXITIES;

LAWS AND LEGISLATION;

EID: 49049118519     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARES.2008.170     Document Type: Conference Paper

References (19)

1. D. Balfanz, G. Durfee, N. Shankar, D. Smetters, J. Staddon, and H.-C. Wong. Secret handshakes from pairing-based key agreements. In 24th IEEE Symposium on Security and Privacy, page 180, Oakland, CA, May 2003.
2. R Boudot, B. Schoenmakers, and J. Traorá. A fair and efficient solution to the socialist millionaires' problem. Discrete Applied Mathematics, 111(1-2):23-36, 2001.
3. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally composable two-party and multi-party secure computation. In STOC, pages 494-503, 2002.
4. C. Castelluccia, S. Jarecki, and G. Tsudik. Secret handshakes from ca-oblivious encryption. In In Advances in Cryptology - ASIACRYPT 2004: 10th International Conference on the Theory and Application of Cryptology and Information Security, volume 3329, pages 293-307, December 2004.
5. Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. Cryptology ePrint Archive, Report 2003/235, 2003.
6. K. Du and M. Atallah. Protocols for secure remote database access with approximate matching. In the First Workshop on Security and Privacy in E-Commerce, November 2000.
7. R. Fagin, M. Naor, and P. Winkler. Comparing information without leaking it. Communications of the ACM, 39(5):77-85, 1996.
8. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. J. Strauss, and R. N. Wright. Secure multiparty computation of approximations. Lecture Notes in Computer Science, 2076:927+, 2001.
9. M. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In Advances in Cryptology - EUROCRYPT 2004., pages 1-19, 2004.
10. B. Goethals, S. Laur, H. Lipmaa, and T. Mielikainen. On private scalar product computation for privacy-preserving data mining. Lecture Notes in Computer Science, 3506:104-120, 2004.
11. O. Goldreich. Secure multi-party computation. Cambridge University Press, 2002.
12. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In STOC, pages 218-229. ACM, 1987.
13. J.-H. Hoepman. Private handshakes. In 4th Eur. Symp. on Security and Privacy in Ad hoc and Sensor Networks, 2007.
14. P. Indyk and D. Woodruff. Polylogarithmic private approximations and efficient matching. In The third Theory of Cryptography conference 2006, volume 3876 of LNCS, pages 245-264, 2006.
15. L. Kissner and D. Song. Privacy-preserving set operations. In Advances in Cryptology - CRYPTO 2005, pages 68-80, 2005.
16. M. Naor and K. Nissim. Communication complexity and secure function evaluation. CoRR, cs.CR/0109011, 2001.
17. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In Thirty-First Annual ACM Symposium on the Theory of Computing, pages 245-254, May 1999.
18. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology - EUROCRYPT 1999., pages 223-238, May 1999.
19. A. Shamir. How to share a secret. In Communications of the ACM, vol. 22, n.11, pages 612-613, November 1979.