{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T16:54:58Z","timestamp":1771692898228,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFA1000600"],"award-info":[{"award-number":["2021YFA1000600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272269; 61932019"],"award-info":[{"award-number":["62272269; 61932019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Department of Science & Technology of Shandong Province","award":["SYS202201"],"award-info":[{"award-number":["SYS202201"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623064","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"2959-2973","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Fast Unbalanced Private Set Union from Fully Homomorphic Encryption"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2167-0762","authenticated-orcid":false,"given":"Binbin","family":"Tu","sequence":"first","affiliation":[{"name":"Shandong University, Qingdao, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2553-1281","authenticated-orcid":false,"given":"Yu","family":"Chen","sequence":"additional","affiliation":[{"name":"Shandong University, Qingdao, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4562-5082","authenticated-orcid":false,"given":"Qi","family":"Liu","sequence":"additional","affiliation":[{"name":"Shandong University, Qingdao, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5403-2866","authenticated-orcid":false,"given":"Cong","family":"Zhang","sequence":"additional","affiliation":[{"name":"IIE, CAS, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414456.2414479"},{"key":"e_1_3_2_1_3_1","volume-title":"USA","author":"Bourse Florian","year":"2016","unstructured":"Florian Bourse, Rafa\u00eb l Del Pino, Michele Minelli, and Hoeteck Wee. 2016. FHE Circuit Privacy Almost for Free. In Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part II, Matthew Robshaw and Jonathan Katz (Eds.). Springer, 62--89."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36362-7_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_6_1","volume-title":"SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics. In 19th USENIX Security Symposium","author":"Burkhart Martin","year":"2010","unstructured":"Martin Burkhart, Mario Strasser, Dilip Many, and Xenofontas A. Dimitropoulos. 2010. SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics. In 19th USENIX Security Symposium, Washington, DC, USA, August 11-13, 2010, Proceedings. USENIX Association, 223--240."},{"key":"e_1_3_2_1_7_1","volume-title":"ACNS 2018, Leuven, Belgium, July 2-4, 2018, Proceedings, Bart Preneel and Frederik Vercauteren (Eds.). Springer, 280--300","author":"Cerulli Andrea","year":"2018","unstructured":"Andrea Cerulli, Emiliano De Cristofaro, and Claudio Soriente. 2018. Nothing Refreshes Like a RePSI: Reactive Private Set Intersection. In Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, Leuven, Belgium, July 2-4, 2018, Proceedings, Bart Preneel and Frederik Vercauteren (Eds.). Springer, 280--300."},{"key":"e_1_3_2_1_8_1","volume-title":"Daejeon, South Korea","author":"Chase Melissa","year":"2020","unstructured":"Melissa Chase, Esha Ghosh, and Oxana Poburinnaya. 2020. Secret-Shared Shuffle. In Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part III. Springer, 342--372."},{"key":"e_1_3_2_1_9_1","volume-title":"CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part III, Daniele Micciancio and Thomas Ristenpart (Eds.). Springer, 34--63","author":"Chase Melissa","year":"2020","unstructured":"Melissa Chase and Peihan Miao. 2020. Private Set Intersection in the Internet Setting from Lightweight Oblivious PRF. In Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part III, Daniele Micciancio and Thomas Ristenpart (Eds.). Springer, 34--63."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243836"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70278-0_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_2_1_13_1","unstructured":"Yu Chen Min Zhang Cong Zhang and Minglang Dong. 2022. Private Set Operations from Multi-Query Reverse Private Membership Test. Cryptology ePrint Archive Paper 2022\/652."},{"key":"e_1_3_2_1_14_1","volume-title":"SCN 2018, Amalfi, Italy, September 5-7, 2018, Proceedings, Dario Catalano and Roberto De Prisco (Eds.). 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 Security and Cryptography for Networks - 11th International Conference, SCN 2018, Amalfi, Italy, September 5-7, 2018, Proceedings, Dario Catalano and Roberto De Prisco (Eds.). Springer, 464--482."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484760"},{"key":"e_1_3_2_1_16_1","volume-title":"ACISP 2017, Auckland, New Zealand, July 3-5, 2017, Proceedings, Part II, Josef Pieprzyk and Suriadi Suriadi (Eds.). Springer, 261--278","author":"Davidson Alex","year":"2017","unstructured":"Alex Davidson and Carlos Cid. 2017. An Efficient Toolkit for Computing Private Set Operations. In Information Security and Privacy - 22nd Australasian Conference, ACISP 2017, Auckland, New Zealand, July 3-5, 2017, Proceedings, Part II, Josef Pieprzyk and Suriadi Suriadi (Eds.). Springer, 261--278."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00500-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society, WPES@CCS 2019","author":"Falk Brett Hemenway","year":"2019","unstructured":"Brett Hemenway Falk, Daniel Noble, and Rafail Ostrovsky. 2019. Private Set Intersection with Linear Communication from General Assumptions. In Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society, WPES@CCS 2019, London, UK, November 11, 2019, Lorenzo Cavallaro, Johannes Kinder, and Josep Domingo-Ferrer (Eds.). ACM, 14--25."},{"key":"e_1_3_2_1_20_1","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. (2012) 144."},{"key":"e_1_3_2_1_21_1","volume-title":"Spirakis","author":"Fotakis Dimitris","year":"2003","unstructured":"Dimitris Fotakis, Rasmus Pagh, Peter Sanders, and Paul G. Spirakis. 2003. Space Efficient Hash Tables with Worst Case Constant Access Time. In STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, Helmut Alt and Michel Habib (Eds.). Springer, 271--282."},{"key":"e_1_3_2_1_22_1","volume-title":"5th International Conference, ACNS 2007, Zhuhai, China, June 5-8, 2007, Proceedings, Jonathan Katz and Moti Yung (Eds.). Springer, 237--252","author":"Frikken Keith B.","year":"2007","unstructured":"Keith B. Frikken. 2007. Privacy-Preserving Set Union. In Applied Cryptography and Network Security, 5th International Conference, ACNS 2007, Zhuhai, China, June 5-8, 2007, Proceedings, Jonathan Katz and Moti Yung (Eds.). Springer, 237--252."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"e_1_3_2_1_24_1","volume-title":"USA","author":"Gentry Craig","year":"2012","unstructured":"Craig Gentry, Shai Halevi, and Nigel P. Smart. 2012. Homomorphic Evaluation of the AES Circuit. In Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings, Reihaneh Safavi-Naini and Ran Canetti (Eds.). Springer, 850--867."},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the 33nd International Conference on Machine Learning, ICML 2016","author":"Gilad-Bachrach Ran","year":"2016","unstructured":"Ran Gilad-Bachrach, Nathan Dowlin, Kim Laine, Kristin E. Lauter, Michael Naehrig, and John Wernsing. 2016. CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy. In Proceedings of the 33nd International Conference on Machine Learning, ICML 2016, New York City, NY, USA, June 19-24, 2016. JMLR.org, 201--210."},{"key":"e_1_3_2_1_26_1","volume-title":"The Foundations of Cryptography - Volume 2: Basic Applications","author":"Goldreich Oded","unstructured":"Oded Goldreich. 2004. The Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54365-8_8"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SecDev.2016.028"},{"key":"e_1_3_2_1_29_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."},{"key":"e_1_3_2_1_30_1","volume-title":"23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings, Dan Boneh (Ed.). Springer, 145--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, Dan Boneh (Ed.). Springer, 145--161."},{"key":"e_1_3_2_1_31_1","volume-title":"Shuffle-based Private Set Union: Faster and More Secure. In 31st USENIX Security Symposium, USENIX Security 2022","author":"Jia Yanxue","year":"2022","unstructured":"Yanxue Jia, Shifeng Sun, Hong-Sheng Zhou, Jiajun Du, and Dawu Gu. 2022. Shuffle-based Private Set Union: Faster and More Secure. In 31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022, Kevin R. B. Butler and Kurt Thomas (Eds.). USENIX Association, 2947--2964."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0044"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_15"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134065"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34621-8_23"},{"key":"e_1_3_2_1_36_1","volume-title":"Lenstra and Tim Voss","author":"Arjen","year":"2004","unstructured":"Arjen K. Lenstra and Tim Voss. 2004. Information Security Risk Assessment, Aggregation, and Mitigation. In Information Security and Privacy: 9th Australasian Conference, ACISP 2004, Sydney, Australia, July 13-15, 2004. Proceedings, Huaxiong Wang, Josef Pieprzyk, and Vijay Varadharajan (Eds.). Springer, 391--401."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"e_1_3_2_1_38_1","volume-title":"Randomized Algorithms","author":"Motwani Rajeev","unstructured":"Rajeev Motwani and Prabhakar Raghavan. 1995. Randomized Algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_39_1","volume-title":"9th Annual European Symposium","author":"Pagh Rasmus","year":"2001","unstructured":"Rasmus Pagh and Flemming Friche Rodler. 2001. Cuckoo Hashing. In Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, Friedhelm Meyer auf der Heide (Ed.). Springer, 121--133."},{"key":"e_1_3_2_1_40_1","volume-title":"USA","author":"Pinkas Benny","year":"2019","unstructured":"Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. 2019a. 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, Alexandra Boldyreva and Daniele Micciancio (Eds.). Springer, 401--431."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"e_1_3_2_1_42_1","volume-title":"Proceedings of the 23rd USENIX Security Symposium","author":"Pinkas Benny","year":"2014","unstructured":"Benny Pinkas, Thomas Schneider, and Michael Zohner. 2014. Faster Private Set Intersection Based on OT Extension. In Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014, Kevin Fu and Jaeyeon Jung (Eds.). USENIX Association, 797--812."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"e_1_3_2_1_44_1","unstructured":"Michael O. Rabin. 2005. How To Exchange Secrets with Oblivious Transfer. IACR Cryptol. ePrint Arch. (2005) 187."},{"key":"e_1_3_2_1_45_1","volume-title":"BLAG: Improving the Accuracy of Blacklists. In 27th Annual Network and Distributed System Security Symposium, NDSS 2020","author":"Ramanathan Sivaramakrishnan","year":"2020","unstructured":"Sivaramakrishnan Ramanathan, Jelena Mirkovic, and Minlan Yu. 2020. BLAG: Improving the Accuracy of Blacklists. In 27th Annual Network and Distributed System Security Symposium, NDSS 2020, San Diego, California, USA, February 23-26, 2020. The Internet Society."},{"key":"e_1_3_2_1_46_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. (2018), 203--221."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9720-4"},{"key":"e_1_3_2_1_49_1","volume-title":"32nd USENIX Security Symposium, USENIX Security 2023","author":"Zhang Cong","year":"2023","unstructured":"Cong Zhang, Yu Chen, Weiran Liu, Min Zhang, and Dongdai Lin. 2023. Linear Private Set Union from Multi-Query Reverse Private Membership Test. In 32nd USENIX Security Symposium, USENIX Security 2023, Anaheim, CA, USA, August 9-11, 2023, Joseph A. Calandrino and Carmela Troncoso (Eds.). USENIX Association."}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623064","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:47:22Z","timestamp":1755740842000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":49,"alternative-id":["10.1145\/3576915.3623064","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623064","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}