{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:31:19Z","timestamp":1773329479018,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"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"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-2001096,CCF-2220450"],"award-info":[{"award-number":["CNS-2001096,CCF-2220450"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"United States ? Israel Binational Science Foundation","award":["2015782,2018393"],"award-info":[{"award-number":["2015782,2018393"]}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2774\/20"],"award-info":[{"award-number":["2774\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR0011-20-2-0025"],"award-info":[{"award-number":["HR0011-20-2-0025"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["742754"],"award-info":[{"award-number":["742754"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3559378","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"531-545","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["PSI from Ring-OLE"],"prefix":"10.1145","author":[{"given":"Wutichai","family":"Chongchitmate","sequence":"first","affiliation":[{"name":"Chulalongkorn University, Bangkok, Thailand"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Steve","family":"Lu","sequence":"additional","affiliation":[{"name":"Stealth Software Technologies, Inc., Los Angeles, CA, USA"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Polynomial Representation Is Tricky: Maliciously Secure Private Set Intersection Revisited. In European Symposium on Research in Computer Security (Lecture Notes in Computer Science","volume":"742","author":"Abadi Aydin","year":"2021","unstructured":"Aydin Abadi , Steven J Murdoch , and Thomas Zacharias . 2021 . Polynomial Representation Is Tricky: Maliciously Secure Private Set Intersection Revisited. In European Symposium on Research in Computer Security (Lecture Notes in Computer Science , Vol. 12973). Springer, Cham, 721-- 742 . Aydin Abadi, Steven J Murdoch, and Thomas Zacharias. 2021. Polynomial Representation Is Tricky: Maliciously Secure Private Set Intersection Revisited. In European Symposium on Research in Computer Security (Lecture Notes in Computer Science, Vol. 12973). Springer, Cham, 721--742."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57990-6_7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"e_1_3_2_1_4_1","volume-title":"Advances in Cryptology -- CRYPTO 2020 (Lecture Notes in Computer Science","author":"Boyle Elette","unstructured":"Elette Boyle , Geoffroy Couteau , Niv Gilboa , Yuval Ishai , Lisa Kohl , and Peter Scholl . 2020. Efficient Pseudorandom Correlation Generators from Ring-LPN . In Advances in Cryptology -- CRYPTO 2020 (Lecture Notes in Computer Science , Vol. 12171). Springer, Cham, 387-- 416 . Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. 2020. Efficient Pseudorandom Correlation Generators from Ring-LPN. In Advances in Cryptology -- CRYPTO 2020 (Lecture Notes in Computer Science, Vol. 12171). Springer, Cham, 387--416."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0_25"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_29"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_3_2_1_10_1","volume-title":"Keyword Search and Oblivious Pseudorandom Functions. In Theory of Cryptography Conference, TCC 2005 (Lecture Notes in Computer Science","volume":"324","author":"Freedman Michael J.","year":"2005","unstructured":"Michael J. Freedman , Yuval Ishai , Benny Pinkas , and Omer Reingold . 2005 . Keyword Search and Oblivious Pseudorandom Functions. In Theory of Cryptography Conference, TCC 2005 (Lecture Notes in Computer Science , Vol. 3378). Springer, Berlin, Heidelberg, 303-- 324 . https:\/\/doi.org\/10.1007\/978-3-540-30576-7_17 10.1007\/978-3-540-30576-7_17 Michael J. Freedman, Yuval Ishai, Benny Pinkas, and Omer Reingold. 2005. Keyword Search and Oblivious Pseudorandom Functions. In Theory of Cryptography Conference, TCC 2005 (Lecture Notes in Computer Science, Vol. 3378). Springer, Berlin, Heidelberg, 303--324. https:\/\/doi.org\/10.1007\/978-3-540-30576-7_17"},{"key":"e_1_3_2_1_11_1","volume-title":"International Conference on the Theory and Applications of Cryptographic Techniques","volume":"19","author":"Freedman Michael J.","year":"2004","unstructured":"Michael J. Freedman , Kobbi Nissim , and Benny Pinkas . 2004 . Efficient Private Matching and Set Intersection. In Advances in Cryptology - EUROCRYPT 2004 , International Conference on the Theory and Applications of Cryptographic Techniques , Interlaken, Switzerland , May 2-6, 2004, Proceedings (Lecture Notes in Computer Science, Vol. 3027). Springer, Berlin, Heidelberg, 1-- 19 . https:\/\/doi.org\/10.1007\/978-3-540-24676-3_1 10.1007\/978-3-540-24676-3_1 Michael J. Freedman, Kobbi Nissim, and Benny Pinkas. 2004. Efficient Private Matching and Set Intersection. In Advances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004, Proceedings (Lecture Notes in Computer Science, Vol. 3027). Springer, Berlin, Heidelberg, 1--19. https:\/\/doi.org\/10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0053"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_22"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646764.703977"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_7"},{"key":"e_1_3_2_1_19_1","unstructured":"Kyoohyung Han Dukjae Moon and Yongha Son. 2021. Improved Circuit-based PSI via Equality Preserving Compression. Cryptology ePrint Archive Paper 2021\/1440. https:\/\/eprint.iacr.org\/2021\/1440 https:\/\/eprint.iacr.org\/2021\/1440.  Kyoohyung Han Dukjae Moon and Yongha Son. 2021. Improved Circuit-based PSI via Equality Preserving Compression. Cryptology ePrint Archive Paper 2021\/1440. https:\/\/eprint.iacr.org\/2021\/1440 https:\/\/eprint.iacr.org\/2021\/1440."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354258"},{"key":"e_1_3_2_1_21_1","volume-title":"19th Annual Network and Distributed System Security Symposium, NDSS 2012","author":"Huang Yan","year":"2012","unstructured":"Yan Huang , David Evans , and Jonathan Katz . 2012 . Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? . In 19th Annual Network and Distributed System Security Symposium, NDSS 2012 , San Diego, California, USA , February 5-8, 2012. https:\/\/www.ndss-symposium.org\/ndss2012\/private-set-intersection-are-garbled-circuits-better-custom-protocols Yan Huang, David Evans, and Jonathan Katz. 2012. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?. In 19th Annual Network and Distributed System Security Symposium, NDSS 2012, San Diego, California, USA, February 5-8, 2012. https:\/\/www.ndss-symposium.org\/ndss2012\/private-set-intersection-are-garbled-circuits-better-custom-protocols"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"e_1_3_2_1_23_1","unstructured":"Mihaela Ion Ben Kreuter Erhan Nergiz Sarvar Patel Shobhit Saxena Karn Seth David Shanahan and Moti Yung. 2017. Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions. Cryptology ePrint Archive Paper 2017\/738. https:\/\/eprint.iacr.org\/2017\/738 https:\/\/eprint.iacr.org\/2017\/739.  Mihaela Ion Ben Kreuter Erhan Nergiz Sarvar Patel Shobhit Saxena Karn Seth David Shanahan and Moti Yung. 2017. Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions. Cryptology ePrint Archive Paper 2017\/738. https:\/\/eprint.iacr.org\/2017\/738 https:\/\/eprint.iacr.org\/2017\/739."},{"key":"e_1_3_2_1_24_1","volume-title":"23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings (Lecture Notes in Computer Science","volume":"161","author":"Ishai Yuval","year":"2003","unstructured":"Yuval Ishai , Joe Kilian , Kobbi Nissim , and Erez Petrank . 2003 . Extending Oblivious Transfers Efficiently. In Advances in Cryptology - CRYPTO 2003 , 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings (Lecture Notes in Computer Science , Vol. 2729). Springer, Berlin, Heidelberg, 145-- 161 . https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9 10.1007\/978-3-540-45146-4_9 Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. 2003. Extending Oblivious Transfers Efficiently. In Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings (Lecture Notes in Computer Science, Vol. 2729). Springer, Berlin, Heidelberg, 145--161. https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_18"},{"key":"e_1_3_2_1_26_1","volume-title":"GAZELLE: A Low Latency Framework for Secure Neural Network Inference. In 27th USENIX Security Symposium (USENIX Security 18)","author":"Juvekar Chiraag","year":"2018","unstructured":"Chiraag Juvekar , Vinod Vaikuntanathan , and Anantha Chandrakasan . 2018 . GAZELLE: A Low Latency Framework for Secure Neural Network Inference. In 27th USENIX Security Symposium (USENIX Security 18) . USENIX Association, Baltimore, MD, 1651--1669. Chiraag Juvekar, Vinod Vaikuntanathan, and Anantha Chandrakasan. 2018. GAZELLE: A Low Latency Framework for Secure Neural Network Inference. In 27th USENIX Security Symposium (USENIX Security 18). USENIX Association, Baltimore, MD, 1651--1669."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0044"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA457144"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_1"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423358"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301312"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"e_1_3_2_1_36_1","volume-title":"Malicious Private Set Intersection. In Advances in Cryptology -- EUROCRYPT 2020 (Lecture Notes in Computer Science","author":"Pinkas Benny","unstructured":"Benny Pinkas , Mike Rosulek , Ni Trieu , and Avishay Yanai . 2020. PSI from PaXoS: Fast , Malicious Private Set Intersection. In Advances in Cryptology -- EUROCRYPT 2020 (Lecture Notes in Computer Science , Vol. 12106). Springer, Cham, 739-- 767 . Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. 2020. PSI from PaXoS: Fast, Malicious Private Set Intersection. In Advances in Cryptology -- EUROCRYPT 2020 (Lecture Notes in Computer Science, Vol. 12106). Springer, Cham, 739--767."},{"key":"e_1_3_2_1_37_1","volume-title":"Efficient Circuit-Based PSI with Linear Communication. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (Lecture Notes in Computer Science","volume":"153","author":"Pinkas Benny","year":"2019","unstructured":"Benny Pinkas , Thomas Schneider , Oleksandr Tkachenko , and Avishay Yanai . 2019 b. Efficient Circuit-Based PSI with Linear Communication. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (Lecture Notes in Computer Science , Vol. 11478). Springer, Cham, 122-- 153 . Benny Pinkas, Thomas Schneider, Oleksandr Tkachenko, and Avishay Yanai. 2019b. Efficient Circuit-Based PSI with Linear Communication. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (Lecture Notes in Computer Science, Vol. 11478). Springer, Cham, 122--153."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134044"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484778"},{"key":"e_1_3_2_1_43_1","volume-title":"International Colloquium on Automata, Languages, and Programming (Lecture Notes in Computer Science","author":"Shamir Adi","unstructured":"Adi Shamir . 1980. On the power of commutativity in cryptography . In International Colloquium on Automata, Languages, and Programming (Lecture Notes in Computer Science , Vol. 85). Springer, Berlin, Heidelberg, 582-- 595 . Adi Shamir. 1980. On the power of commutativity in cryptography. In International Colloquium on Automata, Languages, and Programming (Lecture Notes in Computer Science, Vol. 85). Springer, Berlin, Heidelberg, 582--595."}],"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.3559378","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3559378","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3559378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:50:57Z","timestamp":1750182657000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3559378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":42,"alternative-id":["10.1145\/3548606.3559378","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3559378","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"}}]}}