Polylogarithmic private approximations and efficient matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3876 LNCS, Issue , 2006, Pages 245-264

  Indykl, Piotr ^a   Woodruff, David ^a,b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Communication complexity; Nearest neighbor; Private approximations; Secure multiparty computation

Indexed keywords

COMMUNICATION COMPLEXITY; NEAREST NEIGHBOR; PRIVATE APPROXIMATIONS; SECURE MULTIPARTY COMPUTATION;

COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; INFORMATION ANALYSIS; NETWORK PROTOCOLS; PROBLEM SOLVING; QUERY LANGUAGES;

POLYNOMIAL APPROXIMATION;

EID: 33745565439     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (33)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments, STOC, 1996.
2. K. Bharat and A. Broder. Estimating the relative size and overlap of public web search engines, WWW, 1998.
3. A. Beimel, Y. Ishai, T. Malkin. Reducing the servers computation in private information retrieval: PIR with preprocessing, CRYPTO, 2000.
4. J. D. C. Benaloh, Verifiable secret-ballot elections, PhD thesis, Yale University, 1987.
5. C. Cachin, J. Camenisch, J. Kilian and J. Müller. One-round secure computation and secure autonomous mobile agents, ICALP, 2000.
6. C. Cachin, S. Micali and M. Stadler. Computationally private information retrieval with polylogarithmic communication, Eurocrypt, 1999.
7. R. Canetti, Y. Lindeil, R. Ostrovsky, and A. Sahai, Universally composable twoparty computation, STOC, 2002.
8. B. Chor, N. Gilboa and M. Naor, Private information retrieval by keywords, Technical Report CS0917, Department of Computer Science, Technion, 1997.
9. B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan. Private information retrieval, FOCS, 1995.
10. W. Du and M. J. Attalah. Protocols for secure remote database access with approximate matching, CCS - Workshop on Security and Privacy in E-commerce, 2000.
11. S. Even, O. Goldreich and A. Lempel. A randomized protocol for signing contracts, Communications of the ACM, 1985.
12. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. Strauss, and R. Wright. Secure multiparty computation of approximations, ICALP 2001.
13. M. Freedman, K. Nissim and B. Pinkas. Efficient private matching and set intersection, Eurocrypt, 2004.
14. B. Goethals, S. Laur, H. Lipmaa, and T. Mielikainen. On secure scalar product computation for privacy-preserving data mining, ICISC, 2004.
15. J. Hastad, R. Impagliazzo, L. A. Levin, and M. Luby. Construction of a pseudorandom generator from any one-way function, Technical Report TR-91-068, International Computer Science Institute, 1991.
16. Y. Gertner, Y. Ishai, E. Kushilevitz and T. Malkin, Protecting data privacy in private information retrieval schemes, STOC, 1998.
17. O. Goldreich. Secure multi-party computation, 1998. Available at http://philby.ucsd.edu/
18. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game, STOC, 1987.
19. S. Goldwasser and S. Micali. Probabilistic encryption, JCSS, 1984.
20. S. Halevi, R. Krauthgamer, E. Kushilevitz, and K. Nissim. Private approximation of NP-hard functions, STOC 2001.
21. R. Impagliazzo and M. Luby. One-way functions are essential for complexity-based cryptography, FOCS, 1989.
22. P. Indyk. High-dimensional computational geometry. PhD Thesis, Stanford University, 2000.
23. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality, STOC, 1998.
24. P. Indyk and D. Woodruff. Polylogarithmic private approximations and efficient matching, ECCC, Technical Report TR05-117, 2005.
25. E. Kushilevitz, R. Ostrovsky and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces, STOC, 1998.
26. Y. Lindell and B. Pinkas. Privacy preserving data mining, Crypto, 2000.
27. V.D. Milman and G. Schechtman. Asymptotic Theory of Finite Dimensional Normed Spaces. Lecture Notes in Mathematics, 1200, Springer Verlag, 1986
28. D. Naccache and J. Stern. A new public key cryptosystem, Eurocrypt, 1997.
29. M. Naor and K. Nissim. Communication complexity and secure function evaluation, STOC, 2001.
30. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation, STOC, 1999.
31. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes, Eucrocrypt, 1999.
32. M. Rabin. How to exchange secrets by oblivious transfer. Technical report TR81, Aiken Computation Lab, 1981.
33. A, C. Yao. Protocols for secure computations, FOCS, 1982.