{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:15:54Z","timestamp":1779174954953,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"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":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560670","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"209-222","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Secret-Shared Joins with Multiplicity from Aggregation Trees"],"prefix":"10.1145","author":[{"given":"Saikrishna","family":"Badrinarayanan","sequence":"first","affiliation":[{"name":"Snap, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sourav","family":"Das","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana Champaign, Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gayathri","family":"Garimella","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Raghuraman","sequence":"additional","affiliation":[{"name":"Visa Research, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Rindal","sequence":"additional","affiliation":[{"name":"Visa Research, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3284028.3284032"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243836"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Hao Chen Kim Laine and Peter Rindal. 2017. Fast Private Set Intersection from Homomorphic Encryption. In CCS.  Hao Chen Kim Laine and Peter Rindal. 2017. Fast Private Set Intersection from Homomorphic Encryption. In CCS.","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_2_1_6_1","unstructured":"Koji Chida Koki Hamada Dai Ikarashi Ryo Kikuchi Naoto Kiribuchi and Benny Pinkas. 2019a. An Efficient Secure Three-Party Sorting Protocol with an Honest Majority. IACR Cryptol. ePrint Arch. (2019) 695. https:\/\/eprint.iacr.org\/2019\/695  Koji Chida Koki Hamada Dai Ikarashi Ryo Kikuchi Naoto Kiribuchi and Benny Pinkas. 2019a. An Efficient Secure Three-Party Sorting Protocol with an Honest Majority. IACR Cryptol. ePrint Arch. (2019) 695. https:\/\/eprint.iacr.org\/2019\/695"},{"key":"e_1_3_2_1_9_1","unstructured":"Morten Dahl Justin Patriquin Yann Dupis and et. al. 2020. TF Encrypted: Encrypted Deep Learning in TensorFlow. (2020). https:\/\/tf-encrypted.io\/  Morten Dahl Justin Patriquin Yann Dupis and et. al. 2020. TF Encrypted: Encrypted Deep Learning in TensorFlow. (2020). https:\/\/tf-encrypted.io\/"},{"key":"e_1_3_2_1_10_1","volume-title":"Crypten: A research tool for secure machine learning in PyTorch.","year":"2020","unstructured":"Facebook. 2020 . Crypten: A research tool for secure machine learning in PyTorch. (2020). https:\/\/crypten.ai\/ Facebook. 2020. Crypten: A research tool for secure machine learning in PyTorch. (2020). https:\/\/crypten.ai\/"},{"key":"e_1_3_2_1_11_1","volume-title":"CRYPTO 2021, Virtual Event, August 16--20, 2021, Proceedings, Part II (Lecture Notes in Computer Science","volume":"425","author":"Garimella Gayathri","year":"2021","unstructured":"Gayathri Garimella , Benny Pinkas , Mike Rosulek , Ni Trieu , and Avishay Yanai . 2021 . Oblivious Key-Value Stores and Amplification for Private Set Intersection. In Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference , CRYPTO 2021, Virtual Event, August 16--20, 2021, Proceedings, Part II (Lecture Notes in Computer Science , Vol. 12826), Tal Malkin and Chris Peikert (Eds.). Springer, 395-- 425 . https:\/\/doi.org\/10.1007\/978--3-030--84245--1_14 10.1007\/978--3-030--84245--1_14 Gayathri Garimella, Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. 2021. Oblivious Key-Value Stores and Amplification for Private Set Intersection. In Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16--20, 2021, Proceedings, Part II (Lecture Notes in Computer Science, Vol. 12826), Tal Malkin and Chris Peikert (Eds.). Springer, 395--425. https:\/\/doi.org\/10.1007\/978--3-030--84245--1_14"},{"key":"e_1_3_2_1_12_1","volume-title":"32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26--30, 2013. Proceedings (Lecture Notes in Computer Science","volume":"591","author":"Gordon S. Dov","year":"2013","unstructured":"S. Dov Gordon , Tal Malkin , Mike Rosulek , and Hoeteck Wee . 2013 . Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction. In Advances in Cryptology - EUROCRYPT 2013 , 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26--30, 2013. Proceedings (Lecture Notes in Computer Science , Vol. 7881), Thomas Johansson and Phong Q. Nguyen (Eds.). Springer, 575-- 591 . https:\/\/doi.org\/10.1007\/978--3--642--38348--9_34 10.1007\/978--3--642--38348--9_34 S. Dov Gordon, Tal Malkin, Mike Rosulek, and Hoeteck Wee. 2013. Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction. In Advances in Cryptology - EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26--30, 2013. Proceedings (Lecture Notes in Computer Science, Vol. 7881), Thomas Johansson and Phong Q. Nguyen (Eds.). Springer, 575--591. https:\/\/doi.org\/10.1007\/978--3--642--38348--9_34"},{"key":"e_1_3_2_1_14_1","first-page":"738","article-title":"Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions","volume":"2017","author":"Ion Mihaela","year":"2017","unstructured":"Mihaela Ion , Ben Kreuter , Erhan Nergiz , Sarvar Patel , Shobhit Saxena , Karn Seth , David Shanahan , and Moti Yung . 2017 b. Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions . IACR Cryptology ePrint Archive , Vol. 2017 (2017), 738 . Mihaela Ion, Ben Kreuter, Erhan Nergiz, Sarvar Patel, Shobhit Saxena, Karn Seth, David Shanahan, and Moti Yung. 2017b. Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions. IACR Cryptology ePrint Archive , Vol. 2017 (2017), 738.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0044"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov Ranjit Kumaresan Mike Rosulek and Ni Trieu. 2016. Efficient Batched Oblivious PRF with Applications to Private Set Intersection. In CCS.  Vladimir Kolesnikov Ranjit Kumaresan Mike Rosulek and Ni Trieu. 2016. Efficient Batched Oblivious PRF with Applications to Private Set Intersection. In CCS.","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov Naor Matania Benny Pinkas Mike Rosulek and Ni Trieu. 2017. Practical Multi-party Private Set Intersection from Symmetric-Key Techniques. In CCS.  Vladimir Kolesnikov Naor Matania Benny Pinkas Mike Rosulek and Ni Trieu. 2017. Practical Multi-party Private Set Intersection from Symmetric-Key Techniques. In CCS.","DOI":"10.1145\/3133956.3134065"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38980-1_6"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38980-1_6"},{"key":"e_1_3_2_1_20_1","volume-title":"Secrecy: Secure collaborative analytics on secret-shared data. CoRR","author":"Liagouris John","year":"2021","unstructured":"John Liagouris , Vasiliki Kalavri , Muhammad Faisal , and Mayank Varia . 2021 . Secrecy: Secure collaborative analytics on secret-shared data. CoRR , Vol. abs\/ 2102 .01048 (2021). showeprint[arXiv]2102.01048 https:\/\/arxiv.org\/abs\/2102.01048 John Liagouris, Vasiliki Kalavri, Muhammad Faisal, and Mayank Varia. 2021. Secrecy: Secure collaborative analytics on secret-shared data. CoRR , Vol. abs\/2102.01048 (2021). showeprint[arXiv]2102.01048 https:\/\/arxiv.org\/abs\/2102.01048"},{"key":"e_1_3_2_1_21_1","unstructured":"Yehuda Lindell. 2016. How To Simulate It - A Tutorial on the Simulation Proof Technique. Cryptology ePrint Archive Paper 2016\/046. https:\/\/eprint.iacr.org\/2016\/046 https:\/\/eprint.iacr.org\/2016\/046.  Yehuda Lindell. 2016. How To Simulate It - A Tutorial on the Simulation Proof Technique. Cryptology ePrint Archive Paper 2016\/046. https:\/\/eprint.iacr.org\/2016\/046 https:\/\/eprint.iacr.org\/2016\/046."},{"key":"e_1_3_2_1_22_1","unstructured":"Meta. 2022. What Are Privacy-Enhancing Technologies (PETs) and How Will They Apply to Ads? https:\/\/about.fb.com\/news\/2021\/08\/privacy-enhancing-technologies-and-ads\/.  Meta. 2022. What Are Privacy-Enhancing Technologies (PETs) and How Will They Apply to Ads? https:\/\/about.fb.com\/news\/2021\/08\/privacy-enhancing-technologies-and-ads\/."},{"key":"e_1_3_2_1_23_1","first-page":"403","article-title":"ABY3: A Mixed Protocol Framework for Machine Learning","volume":"2018","author":"Mohassel Payman","year":"2018","unstructured":"Payman Mohassel and Peter Rindal . 2018 a. ABY3: A Mixed Protocol Framework for Machine Learning . IACR Cryptology ePrint Archive , Vol. 2018 (2018), 403 . https:\/\/eprint.iacr.org\/2018\/403 Payman Mohassel and Peter Rindal. 2018a. ABY3: A Mixed Protocol Framework for Machine Learning. IACR Cryptology ePrint Archive , Vol. 2018 (2018), 403. https:\/\/eprint.iacr.org\/2018\/403","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_25_1","volume-title":"Fast Database Joins and PSI for Secret Shared Data","author":"Mohassel Payman","unstructured":"Payman Mohassel , Peter Rindal , and Mike Rosulek . 2020. Fast Database Joins and PSI for Secret Shared Data . Association for Computing Machinery , New York, NY, USA , 1271--1287. https:\/\/doi.org\/10.1145\/3372297.3423358 10.1145\/3372297.3423358 Payman Mohassel, Peter Rindal, and Mike Rosulek. 2020. Fast Database Joins and PSI for Secret Shared Data. Association for Computing Machinery, New York, NY, USA, 1271--1287. https:\/\/doi.org\/10.1145\/3372297.3423358"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. 2019a. SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension. In CRYPTO.  Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. 2019a. SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension. In CRYPTO.","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. 2020. PSI from PaXoS: Fast Malicious Private Set Intersection. In EUROCRYPT.  Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. 2020. PSI from PaXoS: Fast Malicious Private Set Intersection. In EUROCRYPT.","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"e_1_3_2_1_29_1","volume-title":"Phasing: Private Set Intersection Using Permutation-based Hashing. In 24th USENIX Security Symposium, USENIX Security 15","author":"Pinkas Benny","year":"2015","unstructured":"Benny Pinkas , Thomas Schneider , Gil Segev , and Michael Zohner . 2015 a. Phasing: Private Set Intersection Using Permutation-based Hashing. In 24th USENIX Security Symposium, USENIX Security 15 , Washington, D.C., USA, August 12--14 , 2015., Jaeyeon Jung and Thorsten Holz (Eds.). USENIX Association, 515--530. https:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/pinkas Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. 2015a. Phasing: Private Set Intersection Using Permutation-based Hashing. In 24th USENIX Security Symposium, USENIX Security 15, Washington, D.C., USA, August 12--14, 2015., Jaeyeon Jung and Thorsten Holz (Eds.). USENIX Association, 515--530. https:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/pinkas"},{"key":"e_1_3_2_1_30_1","volume-title":"Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX.","author":"Pinkas Benny","year":"2015","unstructured":"Benny Pinkas , Thomas Schneider , Gil Segev , and Michael Zohner . 2015 b. Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX. Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. 2015b. Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Thomas Schneider Oleksandr Tkachenko and Avishay Yanai. 2019b. Efficient Circuit-Based PSI with Linear Communication. In EUROCRYPT.  Benny Pinkas Thomas Schneider Oleksandr Tkachenko and Avishay Yanai. 2019b. Efficient Circuit-Based PSI with Linear Communication. In EUROCRYPT.","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Thomas Schneider Christian Weinert and Udi Wieder. 2018. Efficient Circuit-Based PSI via Cuckoo Hashing. In EUROCRYPT.  Benny Pinkas Thomas Schneider Christian Weinert and Udi Wieder. 2018. Efficient Circuit-Based PSI via Cuckoo Hashing. In EUROCRYPT.","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"e_1_3_2_1_34_1","volume-title":"Faster Private Set Intersection Based on OT Extension. In 23rd USENIX Security Symposium (USENIX Security 14)","author":"Pinkas Benny","year":"2014","unstructured":"Benny Pinkas , Thomas Schneider , and Michael Zohner . 2014 a. Faster Private Set Intersection Based on OT Extension. In 23rd USENIX Security Symposium (USENIX Security 14) . USENIX Association, San Diego, CA, 797--812. https:\/\/www.usenix.org\/conference\/usenixsecurity14\/technical-sessions\/presentation\/pinkas Benny Pinkas, Thomas Schneider, and Michael Zohner. 2014a. Faster Private Set Intersection Based on OT Extension. In 23rd USENIX Security Symposium (USENIX Security 14). USENIX Association, San Diego, CA, 797--812. https:\/\/www.usenix.org\/conference\/usenixsecurity14\/technical-sessions\/presentation\/pinkas"},{"key":"e_1_3_2_1_35_1","unstructured":"Benny Pinkas Thomas Schneider and Michael Zohner. 2014b. Faster Private Set Intersection Based on OT Extension. In USENIX.  Benny Pinkas Thomas Schneider and Michael Zohner. 2014b. Faster Private Set Intersection Based on OT Extension. In USENIX."},{"key":"e_1_3_2_1_37_1","volume-title":"Aranha","author":"Davi Resende Amanda Cristina","year":"2018","unstructured":"Amanda Cristina Davi Resende and Diego F . Aranha . 2018 . Faster Unbalanced Private Set Intersection . Amanda Cristina Davi Resende and Diego F. Aranha. 2018. Faster Unbalanced Private Set Intersection."},{"key":"e_1_3_2_1_38_1","volume-title":"XONN: XNOR-based Oblivious Deep Neural Network Inference. In 28th USENIX Security Symposium, USENIX Security 2019","author":"Riazi M. Sadegh","year":"2019","unstructured":"M. Sadegh Riazi , Mohammad Samragh , Hao Chen , Kim Laine , Kristin E. Lauter , and Farinaz Koushanfar . 2019 . XONN: XNOR-based Oblivious Deep Neural Network Inference. In 28th USENIX Security Symposium, USENIX Security 2019 , Santa Clara, CA, USA, August 14--16 , 2019, , Nadia Heninger and Patrick Traynor (Eds.). USENIX Association, 1501--1518. https:\/\/www.usenix.org\/conference\/usenixsecurity19\/presentation\/riazi M. Sadegh Riazi, Mohammad Samragh, Hao Chen, Kim Laine, Kristin E. Lauter, and Farinaz Koushanfar. 2019. XONN: XNOR-based Oblivious Deep Neural Network Inference. In 28th USENIX Security Symposium, USENIX Security 2019, Santa Clara, CA, USA, August 14--16, 2019, , Nadia Heninger and Patrick Traynor (Eds.). USENIX Association, 1501--1518. https:\/\/www.usenix.org\/conference\/usenixsecurity19\/presentation\/riazi"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"e_1_3_2_1_41_1","volume-title":"Secure Multiparty PageRank Algorithm for Collaborative Fraud Detection","author":"Sangers Alex","unstructured":"Alex Sangers , Maran van Heesch , Thomas Attema , Thijs Veugen , Mark Wiggerman , Jan Veldsink , Oscar Bloemen , and Dani\u00ebl Worm . 2019. Secure Multiparty PageRank Algorithm for Collaborative Fraud Detection . In Financial Cryptography and Data Security, Ian Goldberg and Tyler Moore (Eds.). Springer International Publishing , Cham , 605--623. Alex Sangers, Maran van Heesch, Thomas Attema, Thijs Veugen, Mark Wiggerman, Jan Veldsink, Oscar Bloemen, and Dani\u00ebl Worm. 2019. Secure Multiparty PageRank Algorithm for Collaborative Fraud Detection. In Financial Cryptography and Data Security, Ian Goldberg and Tyler Moore (Eds.). Springer International Publishing, Cham, 605--623."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0035"},{"key":"e_1_3_2_1_43_1","unstructured":"John Wilander. 2019. Privacy Preserving Ad Click Attribution for the Web. webkit.org\/blog\/8943\/privacy-preserving-ad-click-attribution-for-the-web\/.io  John Wilander. 2019. Privacy Preserving Ad Click Attribution for the Web. webkit.org\/blog\/8943\/privacy-preserving-ad-click-attribution-for-the-web\/.io"}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560670","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560670","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:59Z","timestamp":1750182539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560670"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":35,"alternative-id":["10.1145\/3548606.3560670","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560670","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}