{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:26:31Z","timestamp":1782969991726,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1145\/3634737.3657001","type":"proceedings-article","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T11:51:38Z","timestamp":1719575498000},"page":"1003-1016","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Unbalanced Quorum PSI from Homomorphic Encryption"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7869-1405","authenticated-orcid":false,"given":"Xinpeng","family":"Yang","sequence":"first","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7898-2372","authenticated-orcid":false,"given":"Liang","family":"Cai","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2925-8314","authenticated-orcid":false,"given":"Yinghao","family":"Wang","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9674-4132","authenticated-orcid":false,"given":"Keting","family":"Yin","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7254-1169","authenticated-orcid":false,"given":"Lu","family":"Sun","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4806-7189","authenticated-orcid":false,"given":"Jingwei","family":"Hu","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_2_1","first-page":"1","article-title":"Practical multi-party private set intersection protocols","volume":"17","author":"Bay Asl\u0131","year":"2021","unstructured":"Asl\u0131 Bay, Zekeriya Erkin, Jaap-Henk Hoepman, Simona Samardjiska, and Jelle Vos. 2021. Practical multi-party private set intersection protocols. IEEE Transactions on Information Forensics and Security 17 (2021), 1--15.","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"e_1_3_2_1_3_1","volume-title":"Solution of Vandermonde systems of equations. Mathematics of computation 24, 112","author":"Bjorck Ake","year":"1970","unstructured":"Ake Bjorck and Victor Pereyra. 1970. Solution of Vandermonde systems of equations. Mathematics of computation 24, 112 (1970), 893--903."},{"key":"e_1_3_2_1_4_1","volume-title":"Public-Key Cryptography-PKC 2013: 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26--March 1","author":"Brakerski Zvika","year":"2013","unstructured":"Zvika Brakerski, Craig Gentry, and Shai Halevi. 2013. Packed ciphertexts in LWE-based homomorphic encryption. In Public-Key Cryptography-PKC 2013: 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26--March 1, 2013. Proceedings 16. Springer, 1--13."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2633600","article-title":"(Leveled) fully homomorphic encryption without bootstrapping","volume":"6","author":"Brakerski Zvika","year":"2014","unstructured":"Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. 2014. (Leveled) fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory (TOCT) 6, 3 (2014), 1--36.","journal-title":"ACM Transactions on Computation Theory (TOCT)"},{"key":"e_1_3_2_1_6_1","volume-title":"32nd USENIX Security Symposium (USENIX Security 23)","author":"Chakraborti Anrin","year":"2023","unstructured":"Anrin Chakraborti, Giulia Fanti, and Michael K Reiter. 2023. {Distance-Aware} Private Set Intersection. In 32nd USENIX Security Symposium (USENIX Security 23). 319--336."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1093\/comjnl\/36.2.117","article-title":"Two new techniques for computing extremal h-bases","volume":"36","author":"Challis Michael F.","year":"1993","unstructured":"Michael F. Challis. 1993. Two new techniques for computing extremal h-bases Ak. Comput. J. 36, 2 (1993), 117--126.","journal-title":"Ak. Comput. J."},{"key":"e_1_3_2_1_8_1","first-page":"3","article-title":"Some extremal postage stamp bases","volume":"13","author":"Challis Michael F","year":"2010","unstructured":"Michael F Challis and John P Robinson. 2010. Some extremal postage stamp bases. Journal of Integer Sequences 13, 2 (2010), 3.","journal-title":"Journal of Integer Sequences"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. 1182--1204","author":"Chandran Nishanth","year":"2021","unstructured":"Nishanth Chandran, Nishka Dasgupta, Divya Gupta, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar, and Akash Shah. 2021. Efficient Linear Multiparty PSI and Extensions to Circuit\/Quorum PSI. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. 1182--1204."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. 1223--1237","author":"Chen Hao","year":"2018","unstructured":"Hao Chen, Zhicong Huang, Kim Laine, and Peter Rindal. 2018. Labeled PSI from fully homomorphic encryption with malicious security. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. 1223--1237."},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. 1243--1255","author":"Chen Hao","year":"2017","unstructured":"Hao Chen, Kim Laine, and Peter Rindal. 2017. Fast private set intersection from homomorphic encryption. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. 1243--1255."},{"key":"e_1_3_2_1_12_1","volume-title":"International Conference on Security and Cryptography for Networks. Springer, 464--482","author":"Ciampi Michele","year":"2018","unstructured":"Michele Ciampi and Claudio Orlandi. 2018. Combining private set-intersection with secure two-party computation. In International Conference on Security and Cryptography for Networks. Springer, 464--482."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. 1135--1150","author":"Cong Kelong","year":"2021","unstructured":"Kelong Cong, Radames Cruz Moreno, Mariana Botelho da Gama, Wei Dai, Ilia Iliashenko, Kim Laine, and Michael Rosenberg. 2021. Labeled PSI from homomorphic encryption with reduced computation and communication. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. 1135--1150."},{"key":"e_1_3_2_1_14_1","volume-title":"International Conference on Cryptology and Network Security. Springer, 218--231","author":"Cristofaro Emiliano De","year":"2012","unstructured":"Emiliano De Cristofaro, Paolo Gasti, and Gene Tsudik. 2012. Fast and private computation of cardinality of set intersection and union. In International Conference on Cryptology and Network Security. Springer, 218--231."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security. 789--800","author":"Dong Changyu","year":"2013","unstructured":"Changyu Dong, Liqun Chen, and Zikai Wen. 2013. When private set intersection meets big data: an efficient and scalable protocol. In Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security. 789--800."},{"key":"e_1_3_2_1_17_1","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive Paper 2012\/144. https:\/\/eprint.iacr.org\/2012\/144 https:\/\/eprint.iacr.org\/2012\/144."},{"key":"e_1_3_2_1_18_1","volume-title":"International conference on the theory and applications of cryptographic techniques. Springer, 1--19","author":"Freedman Michael J","year":"2004","unstructured":"Michael J Freedman, Kobbi Nissim, and Benny Pinkas. 2004. Efficient private matching and set intersection. In International conference on the theory and applications of cryptographic techniques. Springer, 1--19."},{"key":"e_1_3_2_1_19_1","volume-title":"Annual International Cryptology Conference. Springer, 323--352","author":"Garimella Gayathri","year":"2022","unstructured":"Gayathri Garimella, Mike Rosulek, and Jaspal Singh. 2022. Structure-aware private set intersection, with applications to fuzzy matching. In Annual International Cryptology Conference. Springer, 323--352."},{"key":"e_1_3_2_1_20_1","volume-title":"Annual Cryptology Conference. Springer, 850--867","author":"Gentry Craig","year":"2012","unstructured":"Craig Gentry, Shai Halevi, and Nigel P Smart. 2012. Homomorphic evaluation of the AES circuit. In Annual Cryptology Conference. Springer, 850--867."},{"key":"e_1_3_2_1_21_1","volume-title":"Cheetah: Lean and Fast Secure Two-Party Deep Neural Network Inference. In 31st USENIX Security Symposium (USENIX Security 22)","author":"Huang Zhicong","year":"2022","unstructured":"Zhicong Huang, Wen jie Lu, Cheng Hong, and Jiansheng Ding. 2022. Cheetah: Lean and Fast Secure Two-Party Deep Neural Network Inference. In 31st USENIX Security Symposium (USENIX Security 22). USENIX Association, Boston, MA, 809--826. https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/huang-zhicong"},{"key":"e_1_3_2_1_22_1","volume-title":"28th USENIX Security Symposium (USENIX Security 19)","author":"Kales Daniel","year":"2019","unstructured":"Daniel Kales, Christian Rechberger, Thomas Schneider, Matthias Senker, and Christian Weinert. 2019. Mobile private contact discovery at scale. In 28th USENIX Security Symposium (USENIX Security 19). 1447--1464."},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. 818--829","author":"Kolesnikov Vladimir","year":"2016","unstructured":"Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, and Ni Trieu. 2016. Efficient batched oblivious PRF with applications to private set intersection. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. 818--829."},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. 1257--1272","author":"Kolesnikov Vladimir","year":"2017","unstructured":"Vladimir Kolesnikov, Naor Matania, Benny Pinkas, Mike Rosulek, and Ni Trieu. 2017. Practical multi-party private set intersection from symmetric-key techniques. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. 1257--1272."},{"key":"e_1_3_2_1_25_1","volume-title":"How to simulate it-a tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich","author":"Lindell Yehuda","year":"2017","unstructured":"Yehuda Lindell. 2017. How to simulate it-a tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich (2017), 277--346."},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. 259--276","author":"Lindell Yehuda","year":"2017","unstructured":"Yehuda Lindell and Ariel Nof. 2017. A framework for constructing fast MPC over arithmetic circuits with malicious adversaries and an honest-majority. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. 259--276."},{"key":"e_1_3_2_1_27_1","volume-title":"1986 IEEE Symposium on Security and Privacy. IEEE, 134--134","author":"Meadows Catherine","year":"1986","unstructured":"Catherine Meadows. 1986. A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In 1986 IEEE Symposium on Security and Privacy. IEEE, 134--134."},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the Nineteenth ACM Symp. on Theory of Computing, STOC. ACM New York, NY, USA, 218--229","author":"Micali Silvio","year":"1987","unstructured":"Silvio Micali, Oded Goldreich, and Avi Wigderson. 1987. How to play any mental game. In Proceedings of the Nineteenth ACM Symp. on Theory of Computing, STOC. ACM New York, NY, USA, 218--229."},{"key":"e_1_3_2_1_29_1","volume-title":"13th Annual Symposium on Switching and Automata Theory (swat","author":"Moenck Robert","year":"1972","unstructured":"Robert Moenck and Allan Borodin. 1972. Fast modular transforms via division. In 13th Annual Symposium on Switching and Automata Theory (swat 1972). IEEE, 90--96."},{"key":"e_1_3_2_1_30_1","volume-title":"Algorithms --- ESA","author":"Pagh Rasmus","year":"2001","unstructured":"Rasmus Pagh and Flemming Friche Rodler. 2001. Cuckoo Hashing. In Algorithms --- ESA 2001, Friedhelm Meyer auf der Heide (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 121--133."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/0202007","article-title":"On the number of nonscalar multiplications necessary to evaluate polynomials","volume":"2","author":"Paterson Michael S","year":"1973","unstructured":"Michael S Paterson and Larry J Stockmeyer. 1973. On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput. 2, 1 (1973), 60--66.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_1_32_1","volume-title":"Advances in Cryptology-CRYPTO 2019: 39th Annual International Cryptology Conference","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 Advances in Cryptology-CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18--22, 2019, Proceedings, Part III 39. Springer, 401--431."},{"key":"e_1_3_2_1_33_1","volume-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 125--157","author":"Pinkas Benny","year":"2018","unstructured":"Benny Pinkas, Thomas Schneider, Christian Weinert, and Udi Wieder. 2018. Efficient circuit-based PSI via cuckoo hashing. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 125--157."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3154794","article-title":"Scalable private set intersection based on OT extension","volume":"21","author":"Pinkas Benny","year":"2018","unstructured":"Benny Pinkas, Thomas Schneider, and Michael Zohner. 2018. Scalable private set intersection based on OT extension. ACM Transactions on Privacy and Security (TOPS) 21, 2 (2018), 1--35.","journal-title":"ACM Transactions on Privacy and Security (TOPS)"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3154794","article-title":"Scalable Private Set Intersection Based on OT Extension","volume":"21","author":"Pinkas Benny","year":"2018","unstructured":"Benny Pinkas, T. Schneider, and Michael Zohner. 2018. Scalable Private Set Intersection Based on OT Extension. ACM Transactions on Privacy and Security (TOPS) 21 (2018), 1 -- 35. https:\/\/api.semanticscholar.org\/CorpusID:3848716","journal-title":"ACM Transactions on Privacy and Security (TOPS)"},{"key":"e_1_3_2_1_36_1","volume-title":"Randomization and Approximation Techniques in Computer Science, Michael Luby, Jos\u00e9 D","author":"Raab Martin","unstructured":"Martin Raab and Angelika Steger. 1998. \"Balls into Bins\" --- A Simple and Tight Analysis. In Randomization and Approximation Techniques in Computer Science, Michael Luby, Jos\u00e9 D. P. Rolim, and Maria Serna (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 159--170."},{"key":"e_1_3_2_1_38_1","volume-title":"Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security","author":"Rathee Deevashwer","year":"2020","unstructured":"Deevashwer Rathee, Mayank Rathee, Nishant Kumar, Nishanth Chandran, Divya Gupta, Aseem Rastogi, and Rahul Sharma. 2020. CrypTFlow2: Practical 2-Party Secure Inference. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (Virtual Event, USA) (CCS '20). Association for Computing Machinery, New York, NY, USA, 325--342. 10.1145\/3372297.3417274"},{"key":"e_1_3_2_1_39_1","volume-title":"https:\/\/github.com\/Microsoft\/SEAL. Microsoft Research","author":"SEAL","unstructured":"SEAL 2023. Microsoft SEAL (release 4.1). https:\/\/github.com\/Microsoft\/SEAL. Microsoft Research, Redmond, WA.."},{"key":"e_1_3_2_1_40_1","volume-title":"Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security. 342--356","author":"Son Yongha","year":"2023","unstructured":"Yongha Son and Jinhyuck Jeong. 2023. PSI with computation or Circuit-PSI for Unbalanced Sets from Homomorphic Encryption. In Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security. 342--356."},{"key":"e_1_3_2_1_41_1","unstructured":"Erkam Uzun Simon P. Chung Vladimir Kolesnikov Alexandra Boldyreva and Wenke Lee. 2021. Fuzzy Labeled Private Set Intersection with Applications to Private Real-Time Biometric Search. 911--928."},{"key":"e_1_3_2_1_42_1","volume-title":"32nd USENIX Security Symposium (USENIX Security 23)","author":"Wu Mingli","year":"2023","unstructured":"Mingli Wu and Tsz Hon Yuen. 2023. Efficient unbalanced private set intersection cardinality and user-friendly privacy-preserving contact tracing. In 32nd USENIX Security Symposium (USENIX Security 23). 283--300."}],"event":{"name":"ASIA CCS '24: 19th ACM Asia Conference on Computer and Communications Security","location":"Singapore Singapore","acronym":"ASIA CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 19th ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3657001","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:44:07Z","timestamp":1750290247000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3657001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":41,"alternative-id":["10.1145\/3634737.3657001","10.1145\/3634737"],"URL":"https:\/\/doi.org\/10.1145\/3634737.3657001","relation":{},"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"2024-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}