Efficient Private Matching and Set Intersection

  • Michael J. Freedman
  • Kobbi Nissim
  • Benny Pinkas
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3027)

Abstract

We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has many applications for online collaboration. We present protocols, based on the use of homomorphic encryption and balanced hashing, for both semi-honest and malicious environments. For lists of length k, we obtain O(k) communication overhead and O(k ln ln k) computation. The protocol for the semi-honest environment is secure in the standard model, while the protocol for the malicious environment is secure in the random oracle model. We also consider the problem of approximating the size of the intersection, show a linear lower-bound for the communication overhead of solving this problem, and provide a suitable secure protocol. Lastly, we investigate other variants of the matching problem, including extending the protocol to the multi-party setting as well as considering the problem of approximate matching.

References

  1. 1.
    Aiello, B., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 119. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. 2.
    Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations. SIAM Journal on Computing 29(1), 180–200 (1999)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Boudot, F., Schoenmakers, B., Traore, J.: A fair and efficient solution to the socialist millionaires’ problem. Discrete Applied Mathematics 111(1-2), 23–36 (2001)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Broder, A.Z., Mitzenmacher, M.: Using multiple hash functions to improve ip lookups. In: IEEE INFOCOM 2001, Anchorage, Alaska, April 2001, pp. 1454–1463 (2001)Google Scholar
  5. 5.
    Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402–414. Springer, Heidelberg (1999)Google Scholar
  6. 6.
    Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, Nevada, October 2001, pp. 136–145 (2001)Google Scholar
  7. 7.
    Damgård, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier’s probabilistic public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 13–15. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Evfimievski, A., Gehrke, J., Srikant, R.: Limiting privacy breaches in privacy preserving data mining. In: Proc. 22nd ACM Symposium on Principles of Database Systems (PODS 2003), San Diego, CA, June 2003, pp. 211–222 (2003)Google Scholar
  9. 9.
    Fagin, R., Naor, M., Winkler, P.: Comparing information without leaking it. Communications of the ACM 39(5), 77–85 (1996)CrossRefGoogle Scholar
  10. 10.
    Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M., Wright, R.N.: Secure multiparty computation of approximations. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 927–938. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  11. 11.
    Goldreich, O.: Secure multi-party computation. In: Available at Theory of Cryptography Library (1999), http://philby.ucsb.edu/cryptolib/BOOKS
  12. 12.
    Huberman, B.A., Franklin, M., Hogg, T.: Enhancing privacy and trust in electronic communities. In: Proc. ACM Conference on Electronic Commerce, Denver, Colorado, November 1999, pp. 78–86 (1999)Google Scholar
  13. 13.
    Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proc. 21st Annual ACM Symposium on Theory of Computing, Seattle, Washington, May 1989, pp. 44–61 (1989)Google Scholar
  14. 14.
    Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM J. Discrete Mathematics 5(4), 545–557 (1992)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Kiayias, A., Yung, M.: Secure games with polynomial expressions. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 939–950. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  16. 16.
    Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)MATHGoogle Scholar
  17. 17.
    Lipmaa, H.: Verifiable homomorphic oblivious transfer and private equality test. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 416–433. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  18. 18.
    Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proc. 31st Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, May 1999, pp. 245–254 (1999)Google Scholar
  19. 19.
    Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SIAM Symposium on Discrete Algorithms (SODA), Washington, D.C., January 2001, pp. 448–457 (2001)Google Scholar
  20. 20.
    Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)Google Scholar
  21. 21.
    Paillier, P.: Trapdooring discrete logarithms on elliptic curves over rings. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 573–584. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  22. 22.
    Razborov, A.A.: Application of matrix methods to the theory of lower bounds in computational complexity. Combinatorica 10(1), 81–93 (1990)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Michael J. Freedman
    • 1
  • Kobbi Nissim
    • 2
  • Benny Pinkas
    • 3
  1. 1.New York University 
  2. 2.Microsoft Research SVC 
  3. 3.HP Labs 

Personalised recommendations