Faster private set intersection based on OT extension

Proceedings of the 23rd USENIX Security Symposium

Volumn , Issue , 2014, Pages 797-812

  Pinkas, Benny ^a   Schneider, Thomas ^b   Zohner, Michael ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENCY IMPROVEMENT; RUNTIMES; SECURE COMPUTATION; SEMI-HONEST ADVERSARIES; SET INTERSECTION;

EID: 85076311386     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (49)

1. G. Asharov, Y. Lindell, T. Schneider, and M. Zohner. More efficient oblivious transfer and extensions for faster secure computation. In Computer and Communications Security (CCS'13), pages 535-548. ACM, 2013.
2. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. SIAM Journal of Computing, 29(1):180-200, 1999.
3. P. Baldi, R. Baronio, E. De Cristofaro, P. Gasti, and G. Tsudik. Countering GATTACA: efficient and secure testing of fully-sequenced human genomes. In Computer and Communications Security (CCS'11), pages 691-702. ACM, 2011.
4. R. W. Baldwin and W. C. Gramlich. Cryptographic protocol for trustable matchmaking. In IEEE S & P'85, pages 92-100. IEEE, 1985.
5. D. Beaver. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology - CRYPTO'91, Volume 576 of LNCS, pages 420-432. Springer, 1991.
6. D. Beaver. Correlated pseudorandomness and the complexity of private computations. In Symposium on Theory of Computing (STOC'96), pages 479-488. ACM, 1996.
7. M. Bellare, V. Hoang, S. Keelveedhi, and P. Rogaway. Efficient garbling from a fixed-key block-cipher. In IEEE S & P'13, pages 478-492. IEEE, 2013.
8. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Computer and Communications Security (CCS'93), pages 62-73. ACM, 1993.
9. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
10. E. Bursztein, M. Hamburg, J. Lagarenne, and D. Boneh. OpenConflict: Preventing real time map hacks in online games. In IEEE S & P'11, pages 506-520. IEEE, 2011.
11. H. Carter, C. Amrutkar, I. Dacosta, and P. Traynor. For your phone only: Custom protocols for efficient secure function evaluation on mobile devices. Journal of Security and Communication Networks (SCN), 2013.
12. S. G. Choi, K.-W. Hwang, J. Katz, T. Malkin, and D. Rubenstein. Secure multi-party computation of Boolean circuits with applications to privacy in online marketplaces. In Cryptographers' Track at the RSA Conference (CT-RSA'12), Volume 7178 of LNCS, pages 416-432. Springer, 2012.
13. E. De Cristofaro, J. Kim, and G. Tsudik. Linear-complexity private set intersection protocols secure in malicious model. In Advances in Cryptology - ASIACRYPT'10, Volume 6477 of LNCS, pages 213-231. Springer, 2010.
14. E. De Cristofaro and G. Tsudik. Practical private set intersection protocols with linear complexity. In Financial Cryptography and Data Security (FC'10), Volume 6052 of LNCS, pages 143-159. Springer, 2010.
15. E. De Cristofaro and G. Tsudik. Experimenting with fast private set intersection. In Trust and Trustworthy Computing (TRUST'12), Volume 7344, pages 55-73. LNCS, 2012.
16. D. Dachman-Soled, T. Malkin, M. Raykova, and M. Yung. Efficient robust private set intersection. In Applied Cryptography and Network Security (ACNS'09), Volume 5536 of LNCS, pages 125-142. Springer, 2009.
17. C. Dong, L. Chen, and Z. Wen. When private set intersection meets big data: An efficient and scalable protocol. In Computer and Communications Security (CCS'13), pages 789-800. ACM, 2013.
18. M. Fischlin, B. Pinkas, A.-R. Sadeghi, T. Schneider, and I. Visconti. Secure set intersection with un-trusted hardware tokens. In Cryptographers' Track at the RSA Conference (CT-RSA'11), Volume 6558 of LNCS, pages 1-16. Springer, 2011.
19. M. J. Freedman, C. Hazay, K. Nissim, and B. Pinkas. Efficient set-intersection with simulation-based security. In Journal of Cryptology, 2013. To appear.
20. M. J. Freedman, Y. Ishai, B. Pinkas, and O. Reingold. Keyword search and oblivious pseudorandom functions. In Theory of Cryptography Conference (TCC'05), Volume 3378 of LNCS, pages 303-324. Springer, 2005.
21. M. J. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In Advances in Cryptology - EUROCRYPT'04, Volume 3027 of LNCS, pages 1-19. Springer, 2004.
22. O. Goldreich. Foundations of Cryptography, Volume 2: Basic Applications. Cambridge University Press, 2004.
23. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Symposium on Theory of Computing (STOC'87), pages 218-229. ACM, 1987.
24. G. H. Gonnet. Expected length of the longest probe sequence in hash code searching. Journal of the ACM, 28(2):289-304, 1981.
25. C. Hazay and Y. Lindell. Constructions of truly practical secure protocols using standardsmartcards. In Computer and Communications Security (CCS'08), pages 491-500. ACM, 2008.
26. C. Hazay and K. Nissim. Efficient set operations in the presence of malicious adversaries. In Public Key Cryptography (PKC'10), Volume 6056 of LNCS, pages 312-331. Springer, 2010.
27. Y. Huang, D. Evans, and J. Katz. Private set intersection: Are garbled circuits better than custom protocols? In Network and Distributed System Security (NDSS'12). The Internet Society, 2012.
28. Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In USENIX Security Symposium, pages 539-554. USENIX, 2011.
29. B. A. Huberman, M. Franklin, and T. Hogg. Enhancing privacy and trust in electronic communities. In ACM Conference on Electronic Commerce (EC'99), pages 78-86. ACM, 1999.
30. Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In Advances in Cryptology - CRYPTO'03, Volume 2729 of LNCS, pages 145-161. Springer, 2003.
31. S. Jarecki and X. Liu. Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In Theory of Cryptography Conference (TCC'09), Volume 5444 of LNCS, pages 577-594. Springer, 2009.
32. S. Kamara, P. Mohassel, M. Raykova, and S. Sadeghian. Scaling private set intersection to billion-element sets. In Financial Cryptography and Data Security (FC'14), LNCS. Springer, 2014.
33. A. Kirsch, M. Mitzenmacher, and U. Wieder. More robust hashing: Cuckoo hashing with a stash. SIAM J. Comput., 39(4):1543-1561, 2009.
34. L. Kissner and D. Song. Privacy-preserving set operations. In Advances in Cryptology - CRYPTO'05, Volume 3621 of LNCS, pages 241-257. Springer, 2005.
35. V. Kolesnikov and R. Kumaresan. Improved OT extension for transferring short secrets. In Advances in Cryptology - CRYPTO'13 (2), Volume 8043 of LNCS, pages 54-70. Springer, 2013.
36. C. Meadows. A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In IEEE S & P'86, pages 134-137. IEEE, 1986.
37. G. Mezzour, A. Perrig, V. D. Gligor, and P. Papadimitratos. Privacy-preserving relationship path discovery in social networks. In Cryptology and Network Security (CANS'09), Volume 5888 of LNCS, pages 189-208. Springer, 2009.
38. M. D. Mitzenmacher. The power of two choices in randomized load balancing. IEEE Transactions on Parallel and Distributed Systems, 12(10):1094-1104, 2001.
39. P. Mohassel and S. S. Sadeghian. How to hide circuits in MPC an efficient framework for private function evaluation. In Advances in Cryptology - EUROCRYPT'13, Volume 7881 of LNCS, pages 557-574. Springer, 2013.
40. S. Nagaraja, P. Mittal, C.-Y. Hong, M. Caesar, and N. Borisov. BotGrep: Finding P2P bots with structured graph analysis. In USENIX Security Symposium, pages 95-110. USENIX, 2010.
41. M. Nagy, E. De Cristofaro, A. Dmitrienko, N. Asokan, and A.-R. Sadeghi. Do I know you? - efficient and privacy-preserving common friend-finder protocols and applications. In Annual Computer Security Applications Conference (AC-SAC'13), pages 159-168. ACM, 2013.
42. M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In SIAM Symposium On Discrete Algorithms (SODA'01), pages 448-457. Society for Industrial and Applied Mathematics (SIAM), 2001.
43. A. Narayanan, N. Thiagarajan, M. Lakhani, M. Hamburg, and D. Boneh. Location privacy via private proximity testing. In Network and Distributed System Security (NDSS'11). The Internet Society, 2011.
44. J. B. Nielsen, P. S. Nordholt, C. Orlandi, and S. S. Burra. A new approach to practical active-secure two-party computation. In Advances in Cryptology - CRYPTO'12, Volume 7417 of LNCS, pages 681-700. Springer, 2012.
45. NIST. NIST Special Publication 800-57, Recommendation for Key Management Part 1: General (Rev. 3). Technical report, National Institute of Standards and Technology (NIST), 2012.
46. R. Pagh and F. F. Rodler. Cuckoo hashing. In European Symposium on Algorithms (ESA'01), Volume 2161 of LNCS, pages 121-133. Springer, 2001.
47. B. Pinkas, T. Schneider, and M. Zohner. Faster private set intersection based on OT extension. Cryptology ePrint Archive, Report 2014/447, 2014. http://eprint.iacr.org/2014/447.
48. M. Raab and A. Steger. "Balls into bins" - a simple and tight analysis. In Randomization and Approximation Techniques in Computer Science (RAN-DOM'98), Volume 1518 of LNCS, pages 159-170. Springer, 1998.
49. T. Schneider and M. Zohner. GMW vs. Yao? Efficient secure two-party computation with low depth circuits. In Financial Cryptography and Data Security (FC'13), Volume 7859 of LNCS, pages 275-292. Springer, 2013.