{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:03:17Z","timestamp":1780588997713,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":87,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100006465","name":"Korea Creative Content Agency","doi-asserted-by":"publisher","award":["RS-2024-00332210"],"award-info":[{"award-number":["RS-2024-00332210"]}],"id":[{"id":"10.13039\/501100006465","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institute of Information and Communications Technology Planning and Evaluation (IITP)","award":["RS-2024-00399491"],"award-info":[{"award-number":["RS-2024-00399491"]}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-2337321"],"award-info":[{"award-number":["CNS-2337321"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["OAC-2312973"],"award-info":[{"award-number":["OAC-2312973"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1145\/3779208.3785272","type":"proceedings-article","created":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:21:58Z","timestamp":1780586518000},"page":"18-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Scalable Private Set Intersection over Distributed Encrypted Data"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1105-1607","authenticated-orcid":false,"given":"Seunghun","family":"Paik","sequence":"first","affiliation":[{"name":"Department of Mathematics & Research Institute for Natural Sciences, Hanyang University, Seoul, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4624-9269","authenticated-orcid":false,"given":"Nirajan","family":"Koirala","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3018-3792","authenticated-orcid":false,"given":"Jack","family":"Nero","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9134-979X","authenticated-orcid":false,"given":"Hyunjung","family":"Son","sequence":"additional","affiliation":[{"name":"Department of Mathematics & Research Institute for Natural Sciences, Hanyang University, Seoul, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0495-1628","authenticated-orcid":false,"given":"Yunki","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Mathematics & Research Institute for Natural Sciences, Hanyang University, Seoul, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0547-5702","authenticated-orcid":false,"given":"Jae Hong","family":"Seo","sequence":"additional","affiliation":[{"name":"Department of Mathematics & Research Institute for Natural Sciences, Hanyang University, Seoul, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5873-0629","authenticated-orcid":false,"given":"Taeho","family":"Jung","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Int. Conf. Financ. Cryptogr. Data Secur. Springer, 100\u2013119","author":"Abadi Aydin","year":"2022","unstructured":"Aydin Abadi, Changyu Dong, Steven J Murdoch, and Sotirios Terzis. 2022. Multiparty updatable delegated private set intersection. In Int. Conf. Financ. Cryptogr. Data Secur. Springer, 100\u2013119."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18467-8_1"},{"key":"e_1_3_2_1_3_1","first-page":"608","article-title":"Efficient delegated private set intersection on outsourced private datasets","volume":"16","author":"Abadi Aydin","year":"2017","unstructured":"Aydin Abadi, Sotirios Terzis, Roberto Metere, and Changyu Dong. 2017. Efficient delegated private set intersection on outsourced private datasets. IEEE TDSC 16, 4 (2017), 608\u2013624.","journal-title":"IEEE TDSC"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3560827.3563379"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Martin Albrecht Melissa Chase Hao Chen Jintai Ding Shafi Goldwasser Sergey Gorbunov Shai Halevi Jeffrey Hoffstein Kim Laine Kristin Lauter et al. 2021. Homomorphic encryption standard. Protecting privacy through homomorphic encryption (2021) 31\u201362.","DOI":"10.1007\/978-3-030-77287-1_2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"e_1_3_2_1_7_1","unstructured":"American Hospital Association. 2025. Fast Facts on U.S. Hospitals 2025: 6 093 U.S. hospitals. https:\/\/www.aha.org\/statistics\/fast-facts-us-hospitals#:~:text=There are 6 C093 hospitals in to provide visualizations for this Accessed: 2025-03-07."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_13"},{"key":"e_1_3_2_1_9_1","first-page":"1","article-title":"Practical multi-party private set intersection protocols","volume":"17","author":"Bay Asli","year":"2021","unstructured":"Asli Bay, Zekeriya Erkin, Jaap-Henk Hoepman, Simona Samardjiska, and Jelle Vos. 2021. Practical multi-party private set intersection protocols. IEEE TIFS 17 (2021), 1\u201315.","journal-title":"IEEE TIFS"},{"key":"e_1_3_2_1_10_1","volume-title":"Joon Young Seo, and Kevin Yeo","author":"Bienstock Alexander","year":"2023","unstructured":"Alexander Bienstock, Sarvar Patel, Joon Young Seo, and Kevin Yeo. 2023. Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps. In USENIX Security. 301\u2013318."},{"key":"e_1_3_2_1_11_1","volume-title":"Peter MR Rasmussen, and Amit Sahai","author":"Boneh Dan","year":"2018","unstructured":"Dan Boneh, Rosario Gennaro, Steven Goldfeder, Aayush Jain, Sam Kim, Peter MR Rasmussen, and Amit Sahai. 2018. Threshold cryptosystems from threshold fully homomorphic encryption. In CRYPTO. Springer, 565\u2013596."},{"key":"e_1_3_2_1_12_1","volume-title":"California consumer privacy act (CCPA). Retrieved from State of California Department of Justice: https:\/\/oag. ca. gov\/privacy\/ccpa","author":"Bonta Rob","year":"2022","unstructured":"Rob Bonta. 2022. California consumer privacy act (CCPA). Retrieved from State of California Department of Justice: https:\/\/oag. ca. gov\/privacy\/ccpa (2022)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_3_2_1_14_1","volume-title":"Sruthi Sekar, and Akash Shah.","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 ACM CCS. 1182\u20131204."},{"key":"e_1_3_2_1_15_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.","DOI":"10.1145\/3243734.3243836"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Hao Chen Kim Laine and Peter Rindal. 2017. Fast private set intersection from homomorphic encryption. In ACMCCS. 1243\u20131255.","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"e_1_3_2_1_18_1","first-page":"2553","article-title":"Efficient homomorphic evaluation on large intervals","volume":"17","author":"Cheon Jung Hee","year":"2022","unstructured":"Jung Hee Cheon, Wootae Kim, and Jai Hyun Park. 2022. Efficient homomorphic evaluation on large intervals. IEEE TIFS 17 (2022), 2553\u20132568.","journal-title":"IEEE TIFS"},{"key":"e_1_3_2_1_19_1","volume-title":"Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 1282\u20131287","author":"Chielle Eduardo","year":"2021","unstructured":"Eduardo Chielle, Homer Gamil, and Michail Maniatakos. 2021. Real-time private membership test using homomorphic encryption. In 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 1282\u20131287."},{"key":"e_1_3_2_1_20_1","volume-title":"Private information retrieval","author":"Chor B","unstructured":"B Chor, O Goldreich, E Kushilevitz, and M Sudan. 1995. Private information retrieval. In IEEE FOCS. IEEE Computer Society, 41\u201341."},{"key":"e_1_3_2_1_21_1","volume-title":"Mariana Botelho da Gama, Wei Dai, Ilia Iliashenko, Kim Laine, and Michael Rosenberg.","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 ACM CCS. 1135\u20131150."},{"key":"e_1_3_2_1_22_1","unstructured":"Consumer Financial Protection Bureau. 2024. Personal Financial Data Rights (12 CFR Part 1033). https:\/\/www.consumerfinance.gov\/rules-policy\/final-rules\/personal-financial-data-rights\/. Final Rule."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44987-6_18"},{"key":"e_1_3_2_1_24_1","unstructured":"Deloitte. 2024. Cloud Outsourcing Statistics: Trends and Insights. https:\/\/explodingtopics.com\/blog\/outsourcing-statistics Cited by Exploding Topics includes global IT outsourcing statistics."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_4"},{"key":"e_1_3_2_1_26_1","volume-title":"Duong Hieu Phan, and Ni Trieu","author":"Duong Thai","year":"2020","unstructured":"Thai Duong, Duong Hieu Phan, and Ni Trieu. 2020. Catalic: Delegated PSI cardinality with applications to contact tracing. In ASIACRYPT. Springer, 870\u2013899."},{"key":"e_1_3_2_1_27_1","unstructured":"European Central Bank. 2024. Cloud Outsourcing in the Banking Sector: ECB Banking Supervision 2024 Analysis. https:\/\/www.bankingsupervision.europa. eu\/press\/publications\/html\/ssm.cloudoutsourcing2024.en.html Analysis of cloud outsourcing trends and expenditures in European banks."},{"key":"e_1_3_2_1_28_1","volume-title":"Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive","author":"Fan Junfeng","year":"2012","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive (2012)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"e_1_3_2_1_30_1","volume-title":"Efficient private matching and set intersection","author":"Freedman Michael J","unstructured":"Michael J Freedman, Kobbi Nissim, and Benny Pinkas. 2004. Efficient private matching and set intersection. In EUROCRYPT. Springer, 1\u201319."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Ying Gao Yuanchao Luo Longxin Wang Xiang Liu Lin Qi Wei Wang and Mengmeng Zhou. 2024. Efficient Scalable Multi-Party Private Set Intersection (-Variants) from Bicentric Zero-Sharing. In ACM CCS. 4137\u20134151.","DOI":"10.1145\/3658644.3690245"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-31371-4_6"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry. 2009. Fully homomorphic encryption using ideal lattices. In ACM STOC. 169\u2013178.","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_35_1","unstructured":"Meng Hao Weiran Liu Liqiang Peng Hongwei Li Cong Zhang Hanxiao Chen and Tianwei Zhang. 2024. Unbalanced Circuit-PSI from Oblivious Key-Value Retrieval. In USENIX Security. 6435\u20136451."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"e_1_3_2_1_37_1","unstructured":"HIPAA Journal. 2024. Healthcare Cloud Usage Grows But Protecting PHI Can Be a Challenge. https:\/\/www.hipaajournal.com\/healthcare-cloud-usage-grows-but-protecting-phi-can-be-a-challenge\/ Accessed: 2025-05-30."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2021-0046"},{"key":"e_1_3_2_1_39_1","unstructured":"Apple Inc. [n. d.]. Apple Password Monitoring. https:\/\/support.apple.com\/guide\/security\/password-monitoring-sec78e79fc3b\/web Accessed: 2025-08-22."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In ACM STOC. 604\u2013613.","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_41_1","volume-title":"Peter MR Rasmussen, and Amit Sahai","author":"Jain Aayush","year":"2017","unstructured":"Aayush Jain, Peter MR Rasmussen, and Amit Sahai. 2017. Threshold fully homomorphic encryption. Cryptology ePrint Archive (2017)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2024.103822"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Florian Kerschbaum. 2012. Outsourced private set intersection using homomorphic encryption. In ACM ASIACCS. 85\u201386.","DOI":"10.1145\/2414456.2414506"},{"key":"e_1_3_2_1_44_1","first-page":"357","article-title":"On the efficiency of FHE-based private queries","volume":"15","author":"Kim Myungsun","year":"2016","unstructured":"Myungsun Kim, Hyung Tae Lee, San Ling, and Huaxiong Wang. 2016. On the efficiency of FHE-based private queries. IEEE TDSC 15, 2 (2016), 357\u2013363.","journal-title":"IEEE TDSC"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2024-0114"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov Naor Matania Benny Pinkas Mike Rosulek and Ni Trieu. 2017. Practical multi-party private set intersection from symmetric-key techniques. In ACM CCS. 1257\u20131272.","DOI":"10.1145\/3133956.3134065"},{"key":"e_1_3_2_1_47_1","unstructured":"Anunay Kulshrestha and Jonathan Mayer. 2021. Identifying harmful media in End-to-End encrypted communication: Efficient private membership computation. In USENIX Security. 893\u2013910."},{"key":"e_1_3_2_1_48_1","unstructured":"Serge Lang. 2012. Algebra. Vol. 211. Springer Science & Business Media."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEED61283.2024.00024"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_1_51_1","unstructured":"Rasoul Akhavan Mahdavi and Florian Kerschbaum. 2022. Constant-weight PIR: Single-round keyword PIR via constant-weight equality operators. In USENIX Security. 1723\u20131740."},{"key":"e_1_3_2_1_52_1","volume-title":"PEPSI: Practically Efficient Private Set Intersection in the Unbalanced Setting. In USENIX Security. 6453\u20136470.","author":"Mahdavi Rasoul Akhavan","year":"2024","unstructured":"Rasoul Akhavan Mahdavi, Nils Lukas, Faezeh Ebrahimianghazani, Thomas Humphries, Bailey Kacsmar, John Premkumar, Xinda Li, Simon Oya, Ehsan Amjadian, and Florian Kerschbaum. 2024. PEPSI: Practically Efficient Private Set Intersection in the Unbalanced Setting. In USENIX Security. 6453\u20136470."},{"key":"e_1_3_2_1_53_1","volume-title":"California Moves To Protect Medical Information Collected Through Reproductive And Sexual Health Applications. Mondaq Business Briefing","author":"Metnick Carolyn","year":"2023","unstructured":"Carolyn Metnick. 2023. California Moves To Protect Medical Information Collected Through Reproductive And Sexual Health Applications. Mondaq Business Briefing (2023), NA-NA."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2021-0071"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179329"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Ofri Nevo Ni Trieu and Avishay Yanai. 2021. Simple fast malicious multiparty private set intersection. In ACM CCS. 1151\u20131165.","DOI":"10.1145\/3460120.3484772"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.med.57.121304.131257"},{"key":"e_1_3_2_1_58_1","unstructured":"Office of the National Coordinator for Health Information Technology. 2024. Trusted Exchange Framework and Common Agreement (TEFCA). https:\/\/www.healthit.gov\/topic\/interoperability\/policy\/trusted-exchange-framework-and-common-agreement-tefca. Accessed: 2025-03-20."},{"key":"e_1_3_2_1_59_1","volume-title":"2018 Usenix Annual Technical Conference (USENIX ATC 18)","author":"Oleksenko Oleksii","year":"2018","unstructured":"Oleksii Oleksenko, Bohdan Trach, Robert Krahn, Mark Silberstein, and Christof Fetzer. 2018. Varys: Protecting SGX enclaves from practical Side-Channel attacks. In 2018 Usenix Annual Technical Conference (USENIX ATC 18). 227\u2013240."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44676-1_10"},{"key":"e_1_3_2_1_61_1","volume-title":"Jae Hong Seo, and Taeho Jung","author":"Paik Seunghun","year":"2025","unstructured":"Seunghun Paik, Nirajan Koirala, Jack Nero, Hyunjung Son, Yunki Kim, Jae Hong Seo, and Taeho Jung. 2025. Scalable Private Set Intersection over Distributed Encrypted Data. Cryptology ePrint Archive (2025)."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202007"},{"key":"e_1_3_2_1_63_1","volume-title":"Phasing: Private set intersection using permutation-based hashing. In USENIX Security. 515\u2013530.","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. 515\u2013530."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"e_1_3_2_1_65_1","volume-title":"How to exchange secrets with oblivious transfer. Cryptology ePrint Archive","author":"Rabin Michael O","year":"2005","unstructured":"Michael O Rabin. 2005. How to exchange secrets with oblivious transfer. Cryptology ePrint Archive (2005)."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"crossref","unstructured":"Srinivasan Raghuraman and Peter Rindal. 2022. Blazing fast PSI from improved OKVS and subfield VOLE. In ACM CCS. 2505\u20132517.","DOI":"10.1145\/3548606.3560658"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dcan.2019.05.002"},{"key":"e_1_3_2_1_68_1","volume-title":"State of Cloud in Healthcare","author":"Research Forrester","year":"2023","unstructured":"Forrester Research. 2023. State of Cloud in Healthcare, 2023. https:\/\/go.forrester.com\/research\/state-of-cloud-in-healthcare-202 Key findings on cloud adoption in healthcare."},{"key":"e_1_3_2_1_69_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, 901\u2013930."},{"key":"e_1_3_2_1_70_1","volume-title":"SWIFT: Trusted infrastructure for infrastructures","author":"Robinson Gary","year":"2025","unstructured":"Gary Robinson, Sabine D\u00f6rry, and Ben Derudder. 2025. SWIFT: Trusted infrastructure for infrastructures. In The Cambridge Global Handbook of Financial Infrastructure. Cambridge University Press, 237\u2013249."},{"key":"e_1_3_2_1_71_1","volume-title":"http:\/\/sealcrypto.org. Microsoft Research","author":"SEAL","unstructured":"SEAL 2018. Microsoft SEAL (release 3.0). http:\/\/sealcrypto.org. Microsoft Research, Redmond, WA."},{"key":"e_1_3_2_1_72_1","unstructured":"What Is Intel SGX. [n. d.]. SgxPectre: Stealing Intel Secrets From SGX Enclaves via Speculative Execution. ([n. d.])."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9720-4"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"crossref","unstructured":"Yongha Son and Jinhyuck Jeong. 2023. PSI with computation or Circuit-PSI for Unbalanced Sets from Homomorphic Encryption. In ACM ASIACCS. 342\u2013356.","DOI":"10.1145\/3579856.3582817"},{"key":"e_1_3_2_1_75_1","unstructured":"Statista. 2023. Number of FDIC-insured banks in the U.S. in 2023: 4 470. https:\/\/www.statista.com\/statistics\/184536\/number-of-fdic-insured-us-commercial-bank-institutions\/ Accessed: 2025-03-07."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"crossref","unstructured":"Yunqing Sun Jonathan Katz Mariana Raykova Phillipp Schoppmann and Xiao Wang. 2024. Actively Secure Private Set Intersection in the Client-Server Setting. In ACM CCS. 1478\u20131492.","DOI":"10.1145\/3658644.3690349"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"crossref","unstructured":"Sandeep Tamrakar Jian Liu Andrew Paverd Jan-Erik Ekberg Benny Pinkas and N Asokan. 2017. The circle game: Scalable private membership test using trusted hardware. In ACM ASIACCS. 31\u201344.","DOI":"10.1145\/3052973.3053006"},{"key":"e_1_3_2_1_78_1","first-page":"106","article-title":"Gramm-Leach-Bliley Act (GLBA)","author":"Congress U.S.","year":"1999","unstructured":"U.S. Congress. 1999. Gramm-Leach-Bliley Act (GLBA), Public Law 106-102. https:\/\/www.govinfo.gov\/content\/pkg\/PLAW-106publ102\/pdf\/PLAW-106publ102.pdf. Enacted November 12, 1999.","journal-title":"Public Law"},{"key":"e_1_3_2_1_79_1","volume-title":"Duoram: A Bandwidth-Efficient distributed ORAM for 2-and 3-party computation. In USENIX Security. 3907\u20133924.","author":"Vadapalli Adithya","year":"2023","unstructured":"Adithya Vadapalli, Ryan Henry, and Ian Goldberg. 2023. Duoram: A Bandwidth-Efficient distributed ORAM for 2-and 3-party computation. In USENIX Security. 3907\u20133924."},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57959-7"},{"key":"e_1_3_2_1_81_1","volume-title":"Martine De Cock, and Anderson Nascimento","author":"Vos Jelle","year":"2024","unstructured":"Jelle Vos, Sikha Pentyala, Steven Golob, Ricardo Maia, Dean Kelley, Zekeriya Erkin, Martine De Cock, and Anderson Nascimento. 2024. Privacy-Preserving Membership Queries for Federated Anomaly Detection. PoPETs (2024)."},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"crossref","unstructured":"Wenhao Wang Guoxing Chen Xiaorui Pan Yinqian Zhang XiaoFeng Wang Vincent Bindschaedler Haixu Tang and Carl A Gunter. 2017. Leaky cauldron on the dark land: Understanding memory side-channel hazards in SGX. In ACM CCS. 2421\u20132434.","DOI":"10.1145\/3133956.3134038"},{"key":"e_1_3_2_1_83_1","unstructured":"Mingli Wu and Tsz Hon Yuen. 2023. Efficient unbalanced private set intersection cardinality and user-friendly privacy-preserving contact tracing. In USENIX Security. 283\u2013300."},{"key":"e_1_3_2_1_84_1","volume-title":"Tsz Hon Yuen, and Kwan Yin Chan","author":"Wu Mingli","year":"2024","unstructured":"Mingli Wu, Tsz Hon Yuen, and Kwan Yin Chan. 2024. O-Ring and K-Star: Efficient Multi-party Private Set Intersection. In USENIX Security. 6489\u20136506."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"crossref","unstructured":"Xinpeng Yang Liang Cai Yinghao Wang Keting Yin Lu Sun and Jingwei Hu. 2024. Efficient Unbalanced Quorum PSI from Homomorphic Encryption. In ACM ASIACCS. 1003\u20131016.","DOI":"10.1145\/3634737.3657001"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4329"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2024.3356667"}],"event":{"name":"ASIA CCS '26: ACM Asia Conference on Computer and Communications Security","location":"Bangalore India","acronym":"ASIA CCS '26","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\/pdf\/10.1145\/3779208.3785272","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3779208.3785272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:37:01Z","timestamp":1780587421000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3779208.3785272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":87,"alternative-id":["10.1145\/3779208.3785272","10.1145\/3779208"],"URL":"https:\/\/doi.org\/10.1145\/3779208.3785272","relation":{},"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"2026-06-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}