{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:12:15Z","timestamp":1775913135999,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"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.3560658","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"2505-2517","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":83,"title":["Blazing Fast PSI from Improved OKVS and Subfield VOLE"],"prefix":"10.1145","author":[{"given":"Srinivasan","family":"Raghuraman","sequence":"first","affiliation":[{"name":"Visa Research, Palo Alto, CA, USA"}]},{"given":"Peter","family":"Rindal","sequence":"additional","affiliation":[{"name":"Visa Research, Palo Alto, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/1999405"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354255"},{"key":"e_1_3_2_1_3_1","first-page":"599","article-title":"Private Matching for Compute","volume":"2020","author":"Buddhavarapu Prasad","year":"2020","unstructured":"Prasad Buddhavarapu , Andrew Knox , Payman Mohassel , Shubho Sengupta , Erik Taubeneck , and Vlad Vlaskin . 2020 . Private Matching for Compute . IACR Cryptol. ePrint Arch. 2020 (2020), 599 . Prasad Buddhavarapu, Andrew Knox, Payman Mohassel, Shubho Sengupta, Erik Taubeneck, and Vlad Vlaskin. 2020. Private Matching for Compute. IACR Cryptol. ePrint Arch. 2020 (2020), 599.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0018"},{"key":"e_1_3_2_1_5_1","volume-title":"CRYPTO 2021, Virtual Event, August 16--20, 2021, Proceedings, Part III (Lecture Notes in Computer Science","volume":"534","author":"Couteau Geoffroy","year":"2021","unstructured":"Geoffroy Couteau , Peter Rindal , and Srinivasan Raghuraman . 2021 . Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes. In Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference , CRYPTO 2021, Virtual Event, August 16--20, 2021, Proceedings, Part III (Lecture Notes in Computer Science , Vol. 12827), Tal Malkin and Chris Peikert (Eds.). Springer, 502-- 534 . Geoffroy Couteau, Peter Rindal, and Srinivasan Raghuraman. 2021. Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes. In Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16--20, 2021, Proceedings, Part III (Lecture Notes in Computer Science, Vol. 12827), Tal Malkin and Chris Peikert (Eds.). Springer, 502--534."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/07-AAP514"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"e_1_3_2_1_9_1","volume-title":"Aspects of connectivity with matroid constraints in graphs Modeling and Simulation. Universit\u00e9 Grenoble Alpes NNT : 2017GREAM059","author":"Fortier Quentin","year":"2017","unstructured":"Quentin Fortier . 2017. Aspects of connectivity with matroid constraints in graphs Modeling and Simulation. Universit\u00e9 Grenoble Alpes NNT : 2017GREAM059 ( 2017 ). Quentin Fortier. 2017. Aspects of connectivity with matroid constraints in graphs Modeling and Simulation. Universit\u00e9 Grenoble Alpes NNT : 2017GREAM059 (2017)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00463-8"},{"key":"e_1_3_2_1_11_1","unstructured":"Alan Frieze and Michal Karo'ski. 2021. Introduction to Random Graphs.  Alan Frieze and Michal Karo'ski. 2021. Introduction to Random Graphs."},{"key":"e_1_3_2_1_12_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 . 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."},{"key":"e_1_3_2_1_13_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. The Internet Society. 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. The Internet Society. https:\/\/www.ndss-symposium.org\/ndss2012\/ private-set-intersection-are-garbled-circuits-better-custom-protocols"},{"key":"e_1_3_2_1_14_1","volume-title":"Sarvar Patel, Shobhit Saxena, Karn Seth, Mariana Raykova, David Shanahan, and Moti Yung.","author":"Ion Mihaela","year":"2020","unstructured":"Mihaela Ion , Ben Kreuter , Ahmet Erhan Nergiz , Sarvar Patel, Shobhit Saxena, Karn Seth, Mariana Raykova, David Shanahan, and Moti Yung. 2020 . On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality. In EuroS&P. IEEE , 370--389. Mihaela Ion, Ben Kreuter, Ahmet Erhan Nergiz, Sarvar Patel, Shobhit Saxena, Karn Seth, Mariana Raykova, David Shanahan, and Moti Yung. 2020. On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality. In EuroS&P. IEEE, 370--389."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"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. IACR Cryptol. ePrint Arch. (2016) 799. http:\/\/eprint.iacr.org\/2016\/799  Vladimir Kolesnikov Ranjit Kumaresan Mike Rosulek and Ni Trieu. 2016. Efficient Batched Oblivious PRF with Applications to Private Set Intersection. IACR Cryptol. ePrint Arch. (2016) 799. http:\/\/eprint.iacr.org\/2016\/799","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010305"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Ofri Nevo Ni Trieu and Avishay Yanai. 2021. Simple Fast Malicious Multiparty Private Set Intersection. https:\/\/ia.cr\/2021\/1221.  Ofri Nevo Ni Trieu and Avishay Yanai. 2021. Simple Fast Malicious Multiparty Private Set Intersection. https:\/\/ia.cr\/2021\/1221.","DOI":"10.1145\/3460120.3484772"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"e_1_3_2_1_21_1","volume-title":"Matroid Theory","author":"Oxley J.G.","unstructured":"J.G. Oxley . 2006. Matroid Theory . Oxford University Press . https:\/\/books.google. com\/books?id=puKta1Hdz-8C J.G. Oxley. 2006. Matroid Theory. Oxford University Press. https:\/\/books.google. com\/books?id=puKta1Hdz-8C"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90042-6"},{"key":"e_1_3_2_1_23_1","volume-title":"CRYPTO (3) (Lecture Notes in Computer Science","author":"Pinkas Benny","unstructured":"Benny Pinkas , Mike Rosulek , Ni Trieu , and Avishay Yanai . 2019. SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension . In CRYPTO (3) (Lecture Notes in Computer Science , Vol. 11694). Springer, 401-- 431 . Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. 2019. SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension. In CRYPTO (3) (Lecture Notes in Computer Science, Vol. 11694). Springer, 401--431."},{"key":"e_1_3_2_1_24_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 Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques Zagreb Croatia May 10--14 2020 Proceedings Part II (Lecture Notes in Computer Science Vol. 12106) Anne Canteaut and Yuval Ishai (Eds.). Springer 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 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques Zagreb Croatia May 10--14 2020 Proceedings Part II (Lecture Notes in Computer Science Vol. 12106) Anne Canteaut and Yuval Ishai (Eds.). Springer 739--767.","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"e_1_3_2_1_25_1","volume-title":"Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX Security Symposium. USENIX Association, 515--530","author":"Pinkas Benny","year":"2015","unstructured":"Benny Pinkas , Thomas Schneider , Gil Segev , and Michael Zohner . 2015 . Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX Security Symposium. USENIX Association, 515--530 . Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. 2015. Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX Security Symposium. USENIX Association, 515--530."},{"key":"e_1_3_2_1_26_1","volume-title":"Faster Private Set Intersection Based on OT Extension. In USENIX Security Symposium. USENIX Association, 797--812","author":"Pinkas Benny","year":"2014","unstructured":"Benny Pinkas , Thomas Schneider , and Michael Zohner . 2014 . Faster Private Set Intersection Based on OT Extension. In USENIX Security Symposium. USENIX Association, 797--812 . Benny Pinkas, Thomas Schneider, and Michael Zohner. 2014. Faster Private Set Intersection Based on OT Extension. In USENIX Security Symposium. USENIX Association, 797--812."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134044"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.131"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11941439_89"}],"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.3560658","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560658","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.3560658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":30,"alternative-id":["10.1145\/3548606.3560658","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560658","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"}}]}}