Abstract
In [12] a private approximation of a function f is defined to be another function F that approximates f in the usual sense, but does not reveal any information about x other than what can be deduced from f(x). We give the first two-party private approximation of the l 2 distance with polylogarithmic communication. This, in particular, resolves the main open question of [12].
We then look at the private near neighbor problem in which Alice has a query point in {0,1}d and Bob a set of n points in {0,1}d, and Alice should privately learn the point closest to her query. We improve upon existing protocols, resolving open questions of [13,10]. Then, we relax the problem by defining the private approximate near neighbor problem, which requires introducing a notion of secure computation of approximations for functions that return sets of points rather than values. For this problem we give several protocols with sublinear communication.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-540-32732-5_32
Chapter PDF
Similar content being viewed by others
References
Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: STOC (1996)
Bharat, K., Broder, A.: Estimating the relative size and overlap of public web search engines. In: WWW (1998)
Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers computation in private information retrieval: PIR with preprocessing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, p. 55. Springer, Heidelberg (2000)
Benaloh, J.D.C.: Verifiable secret-ballot elections. PhD thesis, Yale University (1987)
Cachin, C., Camenisch, J., Kilian, J., Müller, J.: One-round secure computation and secure autonomous mobile agents. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, p. 512. Springer, Heidelberg (2000)
Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 402. Springer, Heidelberg (1999)
Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable twoparty computation. In: STOC (2002)
Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords, Technical Report CS0917, Department of Computer Science, Technion (1997)
Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: FOCS (1995)
Du, W., Attalah, M.J.: Protocols for secure remote database access with approximate matching. In: CCS - Workshop on Security and Privacy in E-commerce (2000)
Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM (1985)
Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M., Wright, R.: Secure multiparty computation of approximations. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, p. 927. Springer, Heidelberg (2001)
Freedman, M., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: UROCRYPT (2004)
Goethals, B., Laur, S., Lipmaa, H., Mielikainen, T.: On secure scalar product computation for privacy-preserving data mining. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 104–120. Springer, Heidelberg (2005)
Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: Construction of a pseudorandom generator from any one-way function, Technical Report TR-91-068, International Computer Science Institute (1991)
Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: STOC (1998)
Goldreich, O.: Secure multi-party computation (1998), Available at, http://philby.ucsd.edu/
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC (1987)
Goldwasser, S., Micali, S.: Probabilistic encryption. In: JCSS (1984)
Halevi, S., Krauthgamer, R., Kushilevitz, E., Nissim, K.: Private approximation of NP-hard functions. In: STOC (2001)
Impagliazzo, R., Luby, M.: One-way functions are essential for complexity-based cryptography. In: FOCS (1989)
Indyk, P.: High-dimensional computational geometry. PhD Thesis, Stanford University (2000)
Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC (1998)
Indyk, P., Woodruff, D.: Polylogarithmic private approximations and efficient matching, ECCC, Technical Report TR05-117 (2005)
Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. In: STOC (1998)
Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, p. 36. Springer, Heidelberg (2000)
Milman, V.D., Schechtman, G.: Asymptotic Theory of Finite Dimensional Normed Spaces. Lecture Notes in Mathematics, vol. 1200. Springer Verlag, Heidelberg (1986)
Naccache, D., Stern, J.: A new public-key cryptosystem. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 27–36. Springer, Heidelberg (1997)
Naor, M., Nissim, K.: Communication complexity and secure function evaluation. In: STOC (2001)
Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC (1999)
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Eucrocrypt (1999)
Rabin, M.: How to exchange secrets by oblivious transfer. Technical report TR81, Aiken Computation Lab (1981)
Yao, A.C.: Protocols for secure computations. In: FOCS (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Indyk, P., Woodruff, D. (2006). Polylogarithmic Private Approximations and Efficient Matching. In: Halevi, S., Rabin, T. (eds) Theory of Cryptography. TCC 2006. Lecture Notes in Computer Science, vol 3876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11681878_13
Download citation
DOI: https://doi.org/10.1007/11681878_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32731-8
Online ISBN: 978-3-540-32732-5
eBook Packages: Computer ScienceComputer Science (R0)