{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:30:15Z","timestamp":1773329415001,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"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":[[2023,7,10]]},"DOI":"10.1145\/3579856.3582817","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:52:13Z","timestamp":1688568733000},"page":"342-356","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["PSI with computation or Circuit-PSI for Unbalanced Sets from Homomorphic Encryption"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1394-234X","authenticated-orcid":false,"given":"Yongha","family":"Son","sequence":"first","affiliation":[{"name":"Samsung SDS, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6785-9835","authenticated-orcid":false,"given":"Jinhyuck","family":"Jeong","sequence":"additional","affiliation":[{"name":"Samsung SDS, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"APSI 2021. APSI: C++ library for Asymmetric PSI. https:\/\/github.com\/microsoft\/APSI.  APSI 2021. APSI: C++ library for Asymmetric PSI. https:\/\/github.com\/microsoft\/APSI."},{"key":"e_1_3_2_1_2_1","volume-title":"Multiparty Computation with Low Communication, Computation and Interaction via threshold FHE","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 . In EUROCRYPT. Springer , 483\u2013501. 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. In EUROCRYPT. Springer, 483\u2013501."},{"key":"e_1_3_2_1_3_1","volume-title":"A full RNS variant of FV like somewhat homomorphic encryption schemes","author":"Bajard Jean-Claude","unstructured":"Jean-Claude Bajard , Julien Eynard , M\u00a0Anwar Hasan , and Vincent Zucca . 2016. A full RNS variant of FV like somewhat homomorphic encryption schemes . In SAC. Springer , 423\u2013442. Jean-Claude Bajard, Julien Eynard, M\u00a0Anwar Hasan, and Vincent Zucca. 2016. A full RNS variant of FV like somewhat homomorphic encryption schemes. In SAC. Springer, 423\u2013442."},{"key":"e_1_3_2_1_4_1","volume-title":"Private Matching for Compute.IACR Cryptol. ePrint Arch. 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."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0018"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Hao Chen Zhicong Huang Kim Laine and Peter Rindal. 2018. Labeled PSI from fully homomorphic encryption with malicious security. In ACM CCS. 1223\u20131237.  Hao Chen Zhicong Huang Kim Laine and Peter Rindal. 2018. Labeled PSI from fully homomorphic encryption with malicious security. In ACM CCS. 1223\u20131237.","DOI":"10.1145\/3243734.3243836"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Hao Chen Kim Laine and Peter Rindal. 2017. Fast Private Set Intersection from Homomorphic Encryption. In ACM CCS. 1243\u20131255.  Hao Chen Kim Laine and Peter Rindal. 2017. Fast Private Set Intersection from Homomorphic Encryption. In ACM CCS. 1243\u20131255.","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_2_1_8_1","volume-title":"Labeled PSI from Homomorphic Encryption with Reduced Computation and Communication. ACM CCS","author":"Cong Kelong","year":"2021","unstructured":"Kelong Cong , Radames\u00a0Cruz Moreno , Mariana\u00a0Botelho da Gama , Wei Dai , Ilia Iliashenko , Kim Laine , and Michael Rosenberg . 2021. Labeled PSI from Homomorphic Encryption with Reduced Computation and Communication. ACM CCS ( 2021 ). Kelong Cong, Radames\u00a0Cruz Moreno, Mariana\u00a0Botelho da Gama, Wei Dai, Ilia Iliashenko, Kim Laine, and Michael Rosenberg. 2021. Labeled PSI from Homomorphic Encryption with Reduced Computation and Communication. ACM CCS (2021)."},{"key":"e_1_3_2_1_9_1","volume-title":"Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes","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 CRYPTO. Springer , 502\u2013534. Geoffroy Couteau, Peter Rindal, and Srinivasan Raghuraman. 2021. Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes. In CRYPTO. Springer, 502\u2013534."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Gayathri Garimella Payman Mohassel Mike Rosulek Saeed Sadeghian and Jaspal Singh. 2021. Private Set Operations from Oblivious Switching.  Gayathri Garimella Payman Mohassel Mike Rosulek Saeed Sadeghian and Jaspal Singh. 2021. Private Set Operations from Oblivious Switching.","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"e_1_3_2_1_11_1","volume-title":"Oblivious key-value stores and amplification for private set intersection","author":"Garimella Gayathri","unstructured":"Gayathri Garimella , Benny Pinkas , Mike Rosulek , Ni Trieu , and Avishay Yanai . 2021. Oblivious key-value stores and amplification for private set intersection . In CRYPTO. Springer , 395\u2013425. Gayathri Garimella, Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. 2021. Oblivious key-value stores and amplification for private set intersection. In CRYPTO. Springer, 395\u2013425."},{"key":"#cr-split#-e_1_3_2_1_12_1.1","doi-asserted-by":"crossref","unstructured":"O. Goldreich S. Micali and A. Wigderson. 1987. How to Play ANY Mental Game. In STOC (New York New York USA). Association for Computing Machinery New York NY USA 218-229. https:\/\/doi.org\/10.1145\/28395.28420 10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"#cr-split#-e_1_3_2_1_12_1.2","doi-asserted-by":"crossref","unstructured":"O. Goldreich S. Micali and A. Wigderson. 1987. How to Play ANY Mental Game. In STOC (New York New York USA). Association for Computing Machinery New York NY USA 218-229. https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_13_1","volume-title":"All the Numbers are US: Large-scale Abuse of Contact Discovery in Mobile Messengers.NDSS","author":"Hagen Christoph","year":"2021","unstructured":"Christoph Hagen , Christian Weinert , Christoph Sendner , Alexandra Dmitrienko , and Thomas Schneider . 2021. All the Numbers are US: Large-scale Abuse of Contact Discovery in Mobile Messengers.NDSS ( 2021 ). Christoph Hagen, Christian Weinert, Christoph Sendner, Alexandra Dmitrienko, and Thomas Schneider. 2021. All the Numbers are US: Large-scale Abuse of Contact Discovery in Mobile Messengers.NDSS (2021)."},{"key":"e_1_3_2_1_14_1","unstructured":"HElib 2021. HElib: An implementation of homomorphic encryption. https:\/\/github.com\/homenc\/HElib.  HElib 2021. HElib: An implementation of homomorphic encryption. https:\/\/github.com\/homenc\/HElib."},{"key":"e_1_3_2_1_15_1","unstructured":"Yan Huang David Evans and Jonathan Katz. 2012. Private Set Intersection: Are garbled circuits better than custom protocols?. In NDSS.  Yan Huang David Evans and Jonathan Katz. 2012. Private Set Intersection: Are garbled circuits better than custom protocols?. In NDSS."},{"key":"e_1_3_2_1_16_1","volume-title":"On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality","author":"Ion Mihaela","unstructured":"Mihaela Ion , Ben Kreuter , Ahmet\u00a0Erhan 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 Euro\u00a0SP. IEEE , 370\u2013389. Mihaela Ion, Ben Kreuter, Ahmet\u00a0Erhan 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 Euro\u00a0SP. IEEE, 370\u2013389."},{"key":"e_1_3_2_1_17_1","volume-title":"Extending Oblivious Transfers Efficiently","author":"Ishai Yuval","unstructured":"Yuval Ishai , Joe Kilian , Kobbi Nissim , and Erez Petrank . 2003. Extending Oblivious Transfers Efficiently . In CRYPTO. Springer , 145\u2013161. Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. 2003. Extending Oblivious Transfers Efficiently. In CRYPTO. Springer, 145\u2013161."},{"key":"e_1_3_2_1_18_1","volume-title":"Fast Secure Computation of Set Intersection","author":"Jarecki Stanis\u0142aw","unstructured":"Stanis\u0142aw Jarecki and Xiaomin Liu . 2010. Fast Secure Computation of Set Intersection . In SCN. Springer Berlin Heidelberg , 418\u2013435. Stanis\u0142aw Jarecki and Xiaomin Liu. 2010. Fast Secure Computation of Set Intersection. In SCN. Springer Berlin Heidelberg, 418\u2013435."},{"key":"e_1_3_2_1_19_1","volume-title":"Password Monitor: Safeguarding passwords in Microsoft Edge. https:\/\/www.microsoft.com\/en-us\/research\/blog\/password-monitor-safeguarding-passwords-in-microsoft-edge\/.","author":"Kannepalli Sreekanth","year":"2021","unstructured":"Sreekanth Kannepalli , Kim Laine , and Radames\u00a0Cruz Moreno . 2021 . Password Monitor: Safeguarding passwords in Microsoft Edge. https:\/\/www.microsoft.com\/en-us\/research\/blog\/password-monitor-safeguarding-passwords-in-microsoft-edge\/. Sreekanth Kannepalli, Kim Laine, and Radames\u00a0Cruz Moreno. 2021. Password Monitor: Safeguarding passwords in Microsoft Edge. https:\/\/www.microsoft.com\/en-us\/research\/blog\/password-monitor-safeguarding-passwords-in-microsoft-edge\/."},{"key":"e_1_3_2_1_20_1","volume-title":"Linear complexity private set intersection for secure two-party protocols","author":"Karako\u00e7 Ferhat","unstructured":"Ferhat Karako\u00e7 and Alptekin K\u00fcp\u00e7\u00fc . 2020. Linear complexity private set intersection for secure two-party protocols . In CANS. Springer , 409\u2013429. Ferhat Karako\u00e7 and Alptekin K\u00fcp\u00e7\u00fc. 2020. Linear complexity private set intersection for secure two-party protocols. In CANS. Springer, 409\u2013429."},{"key":"e_1_3_2_1_21_1","volume-title":"Revisiting Homomorphic Encryption Schemes for Finite Fields","author":"Kim Andrey","unstructured":"Andrey Kim , Yuriy Polyakov , and Vincent Zucca . 2021. Revisiting Homomorphic Encryption Schemes for Finite Fields .. In ASIACRYPT. Springer . Andrey Kim, Yuriy Polyakov, and Vincent Zucca. 2021. Revisiting Homomorphic Encryption Schemes for Finite Fields.. In ASIACRYPT. Springer."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0044"},{"key":"e_1_3_2_1_23_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 ACM CCS. 818\u2013829.  Vladimir Kolesnikov Ranjit Kumaresan Mike Rosulek and Ni Trieu. 2016. Efficient Batched Oblivious PRF with Applications to Private Set Intersection. In ACM CCS. 818\u2013829.","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_2_1_24_1","volume-title":"Private join and compute from PIR with default","author":"Lepoint Tancrede","unstructured":"Tancrede Lepoint , Sarvar Patel , Mariana Raykova , Karn Seth , and Ni Trieu . 2021. Private join and compute from PIR with default . In ASIACRYPT. Springer , 605\u2013634. Tancrede Lepoint, Sarvar Patel, Mariana Raykova, Karn Seth, and Ni Trieu. 2021. Private join and compute from PIR with default. In ASIACRYPT. Springer, 605\u2013634."},{"key":"e_1_3_2_1_25_1","volume-title":"How to simulate it\u2013a tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography","author":"Lindell Yehuda","year":"2017","unstructured":"Yehuda Lindell . 2017. How to simulate it\u2013a tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography ( 2017 ), 277\u2013346. Yehuda Lindell. 2017. How to simulate it\u2013a tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography (2017), 277\u2013346."},{"key":"e_1_3_2_1_26_1","volume-title":"On ideal lattices and learning with errors over rings","author":"Lyubashevsky Vadim","unstructured":"Vadim Lyubashevsky , Chris Peikert , and Oded Regev . 2010. On ideal lattices and learning with errors over rings . In EUROCRYPT. Springer , 1\u201323. Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2010. On ideal lattices and learning with errors over rings. In EUROCRYPT. Springer, 1\u201323."},{"key":"e_1_3_2_1_27_1","volume-title":"A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party","author":"Meadows Catherine","unstructured":"Catherine Meadows . 1986. A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party . In SP. IEEE , 134\u2013134. Catherine Meadows. 1986. A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In SP. IEEE, 134\u2013134."},{"key":"e_1_3_2_1_28_1","volume-title":"Spot-light: Lightweight Private Set Intersection from Sparse OT Extension","author":"Pinkas Benny","year":"2019","unstructured":"Benny Pinkas , Mike Rosulek , Ni Trieu , and Avishay Yanai . 2019 . Spot-light: Lightweight Private Set Intersection from Sparse OT Extension . In CRYPTO. Springer , 401\u2013431. Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. 2019. Spot-light: Lightweight Private Set Intersection from Sparse OT Extension. In CRYPTO. Springer, 401\u2013431."},{"key":"e_1_3_2_1_29_1","volume-title":"PSI from PaXoS: fast, malicious Private Set Intersection","author":"Pinkas Benny","unstructured":"Benny Pinkas , Mike Rosulek , Ni Trieu , and Avishay Yanai . 2020. PSI from PaXoS: fast, malicious Private Set Intersection . In EUROCRYPT. Springer , 739\u2013767. Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. 2020. PSI from PaXoS: fast, malicious Private Set Intersection. In EUROCRYPT. Springer, 739\u2013767."},{"key":"e_1_3_2_1_30_1","volume-title":"Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX Security","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 . USENIX Association , Washington, D.C. , 515\u2013530. https:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/pinkas Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. 2015. Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX Security. USENIX Association, Washington, D.C., 515\u2013530. https:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/pinkas"},{"key":"e_1_3_2_1_31_1","volume-title":"Efficient Circuit-based PSI with Linear Communication","author":"Pinkas Benny","unstructured":"Benny Pinkas , Thomas Schneider , Oleksandr Tkachenko , and Avishay Yanai . 2019. Efficient Circuit-based PSI with Linear Communication . In EUROCRYPT. Springer , 122\u2013153. Benny Pinkas, Thomas Schneider, Oleksandr Tkachenko, and Avishay Yanai. 2019. Efficient Circuit-based PSI with Linear Communication. In EUROCRYPT. Springer, 122\u2013153."},{"key":"e_1_3_2_1_32_1","volume-title":"USENIX (San Diego, CA)","author":"Pinkas Benny","unstructured":"Benny Pinkas , Thomas Schneider , and Michael Zohner . 2014. Faster Private Set Intersection Based on OT Extension . In USENIX (San Diego, CA) . USENIX Association , USA , 797\u2013812. Benny Pinkas, Thomas Schneider, and Michael Zohner. 2014. Faster Private Set Intersection Based on OT Extension. In USENIX (San Diego, CA). USENIX Association, USA, 797\u2013812."},{"key":"e_1_3_2_1_33_1","volume-title":"International Conference on Financial Cryptography and Data Security. Springer, 203\u2013221","author":"C\u00a0Davi Resende Amanda","year":"2018","unstructured":"Amanda C\u00a0Davi Resende and Diego\u00a0 F Aranha . 2018 . Faster unbalanced private set intersection . In International Conference on Financial Cryptography and Data Security. Springer, 203\u2013221 . Amanda C\u00a0Davi Resende and Diego\u00a0F Aranha. 2018. Faster unbalanced private set intersection. In International Conference on Financial Cryptography and Data Security. Springer, 203\u2013221."},{"key":"e_1_3_2_1_34_1","volume-title":"VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLE","author":"Rindal Peter","unstructured":"Peter Rindal and Phillipp Schoppmann . 2021. VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLE . In EUROCRYPT. Springer . Peter Rindal and Phillipp Schoppmann. 2021. VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLE. In EUROCRYPT. Springer."},{"key":"e_1_3_2_1_35_1","volume-title":"https:\/\/github.com\/microsoft\/SEAL. Microsoft Research","author":"SEAL","unstructured":"SEAL 2021. Microsoft SEAL (release 3.7). https:\/\/github.com\/microsoft\/SEAL. Microsoft Research , Redmond, WA .. SEAL 2021. Microsoft SEAL (release 3.7). https:\/\/github.com\/microsoft\/SEAL. Microsoft Research, Redmond, WA.."},{"key":"e_1_3_2_1_36_1","volume-title":"Ferret: Fast extension for correlated OT with small communication. In ACM CCS. 1607\u20131626.","author":"Yang Kang","year":"2020","unstructured":"Kang Yang , Chenkai Weng , Xiao Lan , Jiang Zhang , and Xiao Wang . 2020 . Ferret: Fast extension for correlated OT with small communication. In ACM CCS. 1607\u20131626. Kang Yang, Chenkai Weng, Xiao Lan, Jiang Zhang, and Xiao Wang. 2020. Ferret: Fast extension for correlated OT with small communication. In ACM CCS. 1607\u20131626."},{"key":"e_1_3_2_1_37_1","volume-title":"Two halves make a whole","author":"Zahur Samee","unstructured":"Samee Zahur , Mike Rosulek , and David Evans . 2015. Two halves make a whole . In EUROCRYPT. Springer , 220\u2013250. Samee Zahur, Mike Rosulek, and David Evans. 2015. Two halves make a whole. In EUROCRYPT. Springer, 220\u2013250."}],"event":{"name":"ASIA CCS '23: ACM ASIA Conference on Computer and Communications Security","location":"Melbourne VIC Australia","acronym":"ASIA CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3582817","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:27Z","timestamp":1750182687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3582817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":38,"alternative-id":["10.1145\/3579856.3582817","10.1145\/3579856"],"URL":"https:\/\/doi.org\/10.1145\/3579856.3582817","relation":{},"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"2023-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}