{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T13:29:51Z","timestamp":1776778191226,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134061","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"1243-1255","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":283,"title":["Fast Private Set Intersection from Homomorphic Encryption"],"prefix":"10.1145","author":[{"given":"Hao","family":"Chen","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Kim","family":"Laine","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Peter","family":"Rindal","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, OR, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Albrecht Martin R","unstructured":"Martin R Albrecht. 2017. On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 103--129."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.80"},{"key":"e_1_3_2_2_4_1","unstructured":"Frederik Armknecht Colin Boyd Christopher Carr Kristian Gj\u00f8steen Angela J\"aschke Christian A Reuter and Martin Strand. 2015. A guide to fully homomorphic encryption. bibinfotypeTechnical Report. IACR Cryptology ePrint Archive (2015\/1192)."},{"key":"e_1_3_2_2_5_1","volume-title":"Multiparty computation with low communication, computation and interaction via threshold FHE Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Asharov Gilad","unstructured":"Gilad Asharov, Abhishek Jain, Adriana L\u00f3pez-Alt, Eran Tromer, Vinod Vaikuntanathan, and Daniel Wichs 2012. Multiparty computation with low communication, computation and interaction via threshold FHE Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 483--501."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48285-7_24"},{"key":"e_1_3_2_2_8_1","volume-title":"Improved security for a ring-based fully homomorphic encryption scheme. Cryptography and Coding","author":"Bos Joppe W","unstructured":"Joppe W Bos, Kristin Lauter, Jake Loftus, and Michael Naehrig 2013. Improved security for a ring-based fully homomorphic encryption scheme. Cryptography and Coding. Springer, 45--64."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44618-9_24"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44618-9_24"},{"key":"e_1_3_2_2_11_1","volume-title":"Packed ciphertexts in LWE-based homomorphic encryption. Public-Key Cryptography-PKC","author":"Brakerski Zvika","year":"2013","unstructured":"Zvika Brakerski, Craig Gentry, and Shai Halevi. 2013. Packed ciphertexts in LWE-based homomorphic encryption. Public-Key Cryptography-PKC 2013. Springer, 1--13."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski Craig Gentry and Vinod Vaikuntanathan. 2012. (Leveled) fully homomorphic encryption without bootstrapping Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. ACM 309--325.","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/120868669"},{"key":"e_1_3_2_2_14_1","volume-title":"Which Ring Based Somewhat Homomorphic Encryption Scheme is Best? Cryptographers' Track at the RSA Conference","author":"Costache Ana","unstructured":"Ana Costache and Nigel P Smart 2016. Which Ring Based Somewhat Homomorphic Encryption Scheme is Best? Cryptographers' Track at the RSA Conference. Springer, 325--340."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01957-9_8"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00500-8"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_19"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Changyu Dong Liqun Chen and Zikai Wen 2013. When private set intersection meets big data: an efficient and scalable protocol Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security. ACM 789--800.","DOI":"10.1145\/2508859.2516701"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3081770.3081782"},{"key":"e_1_3_2_2_20_1","volume-title":"Ericsson Mobility Report: ON THE PULSE OF THE NETWORKED SOCIETY","author":"Ericsson","year":"2016","unstructured":"Ericsson 2016. Ericsson Mobility Report: ON THE PULSE OF THE NETWORKED SOCIETY. Stockholm, Sweden (2016)."},{"key":"e_1_3_2_2_22_1","volume-title":"Space efficient hash tables with worst case constant access time Annual Symposium on Theoretical Aspects of Computer Science","author":"Fotakis Dimitris","unstructured":"Dimitris Fotakis, Rasmus Pagh, Peter Sanders, and Paul Spirakis 2003. Space efficient hash tables with worst case constant access time Annual Symposium on Theoretical Aspects of Computer Science. Springer, 271--282."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--24676--3_1"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_37"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_2_26_1","volume-title":"Homomorphic evaluation of the AES circuit. Advances in Cryptology--CRYPTO","author":"Gentry Craig","year":"2012","unstructured":"Craig Gentry, Shai Halevi, and Nigel P Smart. 2012. Homomorphic evaluation of the AES circuit. Advances in Cryptology--CRYPTO 2012. Springer, 850--867."},{"key":"e_1_3_2_2_27_1","volume-title":"i-hop homomorphic encryption and rerandomizable Yao circuits Annual Cryptology Conference","author":"Gentry Craig","unstructured":"Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. 2010. i-hop homomorphic encryption and rerandomizable Yao circuits Annual Cryptology Conference. Springer, 155--172."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4"},{"key":"e_1_3_2_2_29_1","volume-title":"CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy Proceedings of The 33rd International Conference on Machine Learning. 201--210","author":"Gilad-Bachrach Ran","unstructured":"Ran Gilad-Bachrach, Nathan Dowlin, Kim Laine, Kristin Lauter, Michael Naehrig, and John Wernsing. 2016. CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy Proceedings of The 33rd International Conference on Machine Learning. 201--210."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"e_1_3_2_2_31_1","volume-title":"Efficient set operations in the presence of malicious adversaries International Workshop on Public Key Cryptography","author":"Hazay Carmit","unstructured":"Carmit Hazay and Kobbi Nissim 2010. Efficient set operations in the presence of malicious adversaries International Workshop on Public Key Cryptography. Springer, 312--331."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-011-9098-x"},{"key":"e_1_3_2_2_33_1","unstructured":"Yan Huang David Evans and Jonathan Katz 2012. Private set intersection: Are garbled circuits better than custom protocols? NDSS."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45472-5_13"},{"key":"e_1_3_2_2_38_1","unstructured":"Kim Laine Hao Chen and Rachel Player 2016. Simple Encrypted Arithmetic Library - SEAL (v2.1). bibinfotypeTechnical Report. Microsoft Research. https:\/\/www.microsoft.com\/en-us\/research\/publication\/simple-encrypted-arithmetic-library-seal-v2--1\/"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Adriana L\u00f3pez-Alt Eran Tromer and Vinod Vaikuntanathan. 2012. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption Proceedings of the forty-fourth annual ACM symposium on Theory of computing. ACM 1219--1234.","DOI":"10.1145\/2213977.2214086"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_2_43_1","unstructured":"Moxie Marlinspike. 2014. The Difficulty Of Private Contact Discovery. A company sponsored blog post. (2014). https:\/\/whispersystems.org\/blog\/contact-discovery\/."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_3_2_2_45_1","volume-title":"Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection Cryptographers' Track at the RSA Conference","author":"Orr\u00f9 Michele","unstructured":"Michele Orr\u00f9, Emmanuela Orsini, and Peter Scholl. 2017. Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection Cryptographers' Track at the RSA Conference. Springer, 381--396."},{"key":"e_1_3_2_2_46_1","volume-title":"Cuckoo hashing European Symposium on Algorithms","author":"Pagh Rasmus","unstructured":"Rasmus Pagh and Flemming Friche Rodler 2001. Cuckoo hashing European Symposium on Algorithms. Springer, 121--133."},{"key":"e_1_3_2_2_47_1","volume-title":"Phasing: Private set intersection using permutation-based hashing 24th USENIX Security Symposium (USENIX Security 15). 515--530","author":"Pinkas Benny","unstructured":"Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner 2015. Phasing: Private set intersection using permutation-based hashing 24th USENIX Security Symposium (USENIX Security 15). 515--530."},{"key":"e_1_3_2_2_48_1","volume-title":"Usenix Security","volume":"14","author":"Pinkas Benny","year":"2014","unstructured":"Benny Pinkas, Thomas Schneider, and Michael Zohner. 2014. Faster Private Set Intersection Based on OT Extension. Usenix Security, Vol. Vol. 14. 797--812."},{"key":"e_1_3_2_2_50_1","volume-title":"enquoteBalls into Bins -- A Simple and Tight Analysis International Workshop on Randomization and Approximation Techniques in Computer Science","author":"Raab Martin","unstructured":"Martin Raab and Angelika Steger 1998. enquoteBalls into Bins -- A Simple and Tight Analysis International Workshop on Randomization and Approximation Techniques in Computer Science. Springer, 159--170."},{"key":"e_1_3_2_2_51_1","volume-title":"Average Size of Mobile Games for iOS Increased by a Whopping 42% between March and September","author":"Research ABI","year":"2012","unstructured":"ABI Research. 2012. Average Size of Mobile Games for iOS Increased by a Whopping 42% between March and September. London, United Kingdom (2012)."},{"key":"e_1_3_2_2_53_1","volume-title":"On data banks and privacy homomorphisms. Foundations of secure computation","author":"Rivest Ronald L","year":"1978","unstructured":"Ronald L Rivest, Len Adleman, and Michael L Dertouzos. 1978. On data banks and privacy homomorphisms. Foundations of secure computation Vol. 4, 11 (1978), 169--180."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9720-4"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","location":"Dallas Texas USA","acronym":"CCS '17","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134061","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:03Z","timestamp":1750212663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":48,"alternative-id":["10.1145\/3133956.3134061","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134061","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}