{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:14:28Z","timestamp":1781018068168,"version":"3.54.1"},"reference-count":75,"publisher":"International Association for Cryptologic Research","issue":"4","license":[{"start":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T00:00:00Z","timestamp":1759795200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2025,12,2]]},"abstract":"<jats:p>Many efficient custom protocols have been developed for two-party private set intersection (PSI), that allow the parties to learn the intersection of their private sets. However, these approaches do not yield efficient solutions in the dynamic setting when the parties' sets evolve and the intersection has to be computed repeatedly. In this work we propose a new framework for this problem of updatable PSI \u2014 with elements being inserted and deleted \u2014 in the semi-honest model based on structured encryption. The framework reduces the problem of updatable PSI to a new variant of structured encryption (StE) for an updatable set datatype, which may be of independent interest. Our final construction is a constant round protocol with worst-case communication and computation complexity that grows linearly in the size of the updates and only poly-logarithmically with the size of the accumulated sets. Our protocol is the first to support arbitrary inserts and deletes for updatable PSI.<\/jats:p>","DOI":"10.62056\/av4fsgbmo","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:39:47Z","timestamp":1767915587000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":3,"title":["Updatable Private Set Intersection from Structured Encryption"],"prefix":"10.62056","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-7306-9707","authenticated-orcid":false,"given":"Archita","family":"Agarwal","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/005tgre63","id-type":"ROR","asserted-by":"publisher"}],"name":"MongoDB","place":["New York City, New York, United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4230-658X","authenticated-orcid":false,"given":"David","family":"Cash","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/024mw5h28","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Chicago","place":["Illinois, Chicago, United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-8698-975X","authenticated-orcid":false,"given":"Marilyn","family":"George","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/005tgre63","id-type":"ROR","asserted-by":"publisher"}],"name":"MongoDB","place":["New York City, New York, United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1804-769X","authenticated-orcid":false,"given":"Seny","family":"Kamara","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/005tgre63","id-type":"ROR","asserted-by":"publisher"}],"name":"MongoDB","place":["New York City, New York, United States"]},{"id":[{"id":"https:\/\/ror.org\/05gq02987","id-type":"ROR","asserted-by":"publisher"}],"name":"Brown University","place":["Providence, Rhode Island, United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1175-4776","authenticated-orcid":false,"given":"Tarik","family":"Moataz","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/005tgre63","id-type":"ROR","asserted-by":"publisher"}],"name":"MongoDB","place":["New York City, New York, United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7984-4609","authenticated-orcid":false,"given":"Jaspal","family":"Singh","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/02dqehb95","id-type":"ROR","asserted-by":"publisher"}],"name":"Purdue University","place":["West Lafayette, Indiana, United States"]},{"id":[{"id":"https:\/\/ror.org\/01zkghx44","id-type":"ROR","asserted-by":"publisher"}],"name":"Georgia Institute of Technology","place":["Atlanta, Georgia, United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"48349","published-online":{"date-parts":[[2026,1,8]]},"reference":[{"key":"ref1:BMS+","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-981-96-0938-3_7","article-title":"Updatable private set intersection revisited: Extended\n  functionalities, deletion, and worst-case complexity","author":"Saikrishna Badrinarayanan","year":"2025"},{"key":"ref2:FC:DeCTsu10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-14577-3_13","article-title":"Practical Private Set Intersection Protocols with Linear\n  Complexity","volume":"6052","author":"Emiliano De Cristofaro","year":"2010"},{"key":"ref3:SCN:JarLiu10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-642-15317-4_26","article-title":"Fast Secure Computation of Set Intersection","volume":"6280","author":"Stanislaw Jarecki","year":"2010"},{"key":"ref4:CCS:RosTri21","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1145\/3460120.3484778","article-title":"Compact and Malicious Private Set Intersection for Small\n  Sets","author":"Mike Rosulek","year":"2021"},{"key":"ref5:USENIX:PSSZ15","first-page":"515","article-title":"Phasing: Private Set Intersection Using Permutation-based\n  Hashing","author":"Benny Pinkas","year":"2015"},{"key":"ref6:CCS:KKRT16","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1145\/2976749.2978381","article-title":"Efficient Batched Oblivious PRF with Applications to\n  Private Set Intersection","author":"Vladimir Kolesnikov","year":"2016"},{"key":"ref7:CCS:RinRos17","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1145\/3133956.3134044","article-title":"Malicious-Secure Private Set Intersection via Dual\n  Execution","author":"Peter Rindal","year":"2017"},{"key":"ref8:C:PRTY19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-030-26954-8_13","article-title":"SpOT-Light: Lightweight Private Set Intersection from\n  Sparse OT Extension","volume":"11694","author":"Benny Pinkas","year":"2019"},{"key":"ref9:EC:PRTY20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-030-45724-2_25","article-title":"PSI from PaXoS: Fast, Malicious Private Set\n  Intersection","volume":"12106","author":"Benny Pinkas","year":"2020"},{"key":"ref10:C:ChaMia20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-56877-1_2","article-title":"Private Set Intersection in the Internet Setting from\n  Lightweight Oblivious PRF","volume":"12172","author":"Melissa Chase","year":"2020"},{"key":"ref11:C:GPRTY21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-84245-1_14","article-title":"Oblivious Key-Value Stores and Amplification for Private Set\n  Intersection","volume":"12826","author":"Gayathri Garimella","year":"2021"},{"key":"ref12:EC:RinSch21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/978-3-030-77886-6_31","article-title":"VOLE-PSI: Fast OPRF and Circuit-PSI from\n  Vector-OLE","volume":"12697","author":"Peter Rindal","year":"2021"},{"key":"ref13:CCS:CILO22","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1145\/3548606.3559378","article-title":"PSI from Ring-OLE","author":"Wutichai Chongchitmate","year":"2022"},{"key":"ref14:ion2020deploying","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/EuroSP48549.2020.00031","article-title":"On deploying secure computing: Private\n  intersection-sum-with-cardinality","author":"Mihaela Ion","year":"2020"},{"key":"ref15:PoPETS:DRRT18","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1515\/popets-2018-0037","article-title":"PIR-PSI: Scaling Private Contact Discovery","volume":"2018","author":"Daniel Demmler","year":"2018","journal-title":"PoPETs"},{"key":"ref16:USENIX:KRSSW19","first-page":"1447","article-title":"Mobile Private Contact Discovery at Scale","author":"Daniel Kales","year":"2019"},{"key":"ref17:hetz2023scaling","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-031-50594-2_23","article-title":"Scaling mobile private contact discovery to billions of\n  users","author":"Laura Hetz","year":"2023"},{"key":"ref18:roy2022practical","isbn-type":"print","first-page":"3345","article-title":"Practical Privacy-Preserving Authentication for SSH","author":"Lawrence Roy","year":"2022","ISBN":"https:\/\/id.crossref.org\/isbn\/9781939133311"},{"key":"ref19:MIC","volume-title":"Password Monitor: Safeguarding passwords in Microsoft Edge"},{"key":"ref20:PoPETS:BadMiaXie22","doi-asserted-by":"publisher","first-page":"378","DOI":"10.2478\/popets-2022-0051","article-title":"Updatable Private Set Intersection","volume":"2022","author":"Saikrishna Badrinarayanan","year":"2022","journal-title":"PoPETs"},{"key":"ref21:CCS:CGKO06","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/1180405.1180417","article-title":"Searchable symmetric encryption: improved definitions and\n  efficient constructions","author":"Reza Curtmola","year":"2006"},{"key":"ref22:AC:ChaKam10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-17373-8_33","article-title":"Structured Encryption and Controlled Disclosure","volume":"6477","author":"Melissa Chase","year":"2010"},{"key":"ref23:lindell2017simulate","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-57048-8_6","article-title":"How to simulate it\u2013a tutorial on the simulation proof\n  technique","author":"Yehuda Lindell","year":"2017","journal-title":"Tutorials on the Foundations of Cryptography: Dedicated to\n  Oded Goldreich"},{"key":"ref24:C:APRR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-031-68397-8_9","article-title":"Improved Alternating-Moduli PRFs and Post-quantum\n  Signatures","volume":"14927","author":"Navid Alamati","year":"2024"},{"key":"ref25:C:RosRoy21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-84242-0_5","article-title":"Three Halves Make a Whole? Beating the Half-Gates Lower\n  Bound for Garbled Circuits","volume":"12825","author":"Mike Rosulek","year":"2021"},{"key":"ref26:zhang2023linear","doi-asserted-by":"publisher","first-page":"337","DOI":"10.5555\/3620237.3620257","article-title":"Linear Private Set Union from $\\{$Multi-Query$\\}$ Reverse\n  Private Membership Test","author":"Cong Zhang","year":"2023"},{"key":"ref27:bienstock2023near","doi-asserted-by":"publisher","first-page":"301","DOI":"10.5555\/3620237.3620255","article-title":"$\\{$Near-Optimal$\\}$ Oblivious $\\{$Key-Value$\\}$ Stores for\n  Efficient $\\{$PSI$\\}$,$\\{$PSU$\\}$ and\n  $\\{$Volume-Hiding$\\}$$\\{$Multi-Maps$\\}$","author":"Alexander Bienstock","year":"2023"},{"key":"ref28:HuangEK12","article-title":"Private Set Intersection: Are Garbled Circuits Better than\n  Custom Protocols?","author":"Yan Huang","year":"2012"},{"key":"ref29:EC:PSWW18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-78372-7_5","article-title":"Efficient Circuit-Based PSI via Cuckoo Hashing","volume":"10822","author":"Benny Pinkas","year":"2018"},{"key":"ref30:PKC:AteDeCTsu11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-19379-8_10","article-title":"(If) Size Matters: Size-Hiding Private Set Intersection","volume":"6571","author":"Giuseppe Ateniese","year":"2011"},{"key":"ref31:CCS:ALOS22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/3548606.3560642","article-title":"Laconic Private Set-Intersection From Pairings","author":"Diego F. Aranha","year":"2022"},{"key":"ref32:CCS:CheLaiRin17","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1145\/3133956.3134061","article-title":"Fast Private Set Intersection from Homomorphic Encryption","author":"Hao Chen","year":"2017"},{"key":"ref33:CCS:CHLR18","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1145\/3243734.3243836","article-title":"Labeled PSI from Fully Homomorphic Encryption with\n  Malicious Security","author":"Hao Chen","year":"2018"},{"key":"ref34:TCC:ABDGHP21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-90456-2_4","article-title":"Laconic Private Set Intersection and Applications","volume":"13044","author":"Navid Alamati","year":"2021"},{"key":"ref35:FC:ResAra18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-58387-6_11","article-title":"Faster Unbalanced Private Set Intersection","volume":"10957","author":"Amanda C. Davi Resende","year":"2018"},{"key":"ref36:PoPETS:KLSAP17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1515\/popets-2017-0044","article-title":"Private Set Intersection for Unequal Set Sizes with Mobile\n  Applications","volume":"2017","author":"\u00c1gnes Kiss","year":"2017","journal-title":"PoPETs"},{"key":"ref37:C:GarRosSin22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-031-15802-5_12","article-title":"Structure-Aware Private Set Intersection, with Applications\n  to Fuzzy Matching","volume":"13507","author":"Gayathri Garimella","year":"2022"},{"key":"ref38:C:GarRosSin23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-031-38557-5_19","article-title":"Malicious Secure, Structure-Aware Private Set Intersection","volume":"14081","author":"Gayathri Garimella","year":"2023"},{"key":"ref39:C:GarGofMia24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-031-68397-8_10","article-title":"Computation Efficient Structure-Aware PSI from Incremental\n  Function Secret Sharing","volume":"14927","author":"Gayathri Garimella","year":"2024"},{"key":"ref40:dittmer2022streaming","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-031-14791-3_25","article-title":"Streaming and Unbalanced PSI from Function Secret Sharing","author":"Samuel Dittmer","year":"2022"},{"key":"ref41:CCS:KamPapRoe12","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/2382196.2382298","article-title":"Dynamic searchable symmetric encryption","author":"Seny Kamara","year":"2012"},{"key":"ref42:NDSS:CJJJKR14","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23264","article-title":"Dynamic Searchable Encryption in Very-Large Databases: Data\n  Structures and Implementation","author":"David Cash","year":"2014"},{"key":"ref43:fjk","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-24177-7_7","article-title":"Rich queries on encrypted data: Beyond exact matches","author":"Sky Faber","year":"2015"},{"key":"ref44:EC:KamMoa17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-56617-7_4","article-title":"Boolean Searchable Symmetric Encryption with Worst-Case\n  Sub-linear Complexity","volume":"10212","author":"Seny Kamara","year":"2017"},{"key":"ref45:FC:KamPap13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-39884-1_22","article-title":"Parallel and Dynamic Searchable Symmetric Encryption","volume":"7859","author":"Seny Kamara","year":"2013"},{"key":"ref46:CCS:HahKer14","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1145\/2660267.2660297","article-title":"Searchable Encryption with Secure and Efficient Updates","author":"Florian Hahn","year":"2014"},{"key":"ref47:EC:CasTes14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-642-55220-5_20","article-title":"The Locality of Searchable Symmetric Encryption","volume":"8441","author":"David Cash","year":"2014"},{"key":"ref48:STOC:ANSS16","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1145\/2897518.2897562","article-title":"Searchable symmetric encryption: optimal locality in linear\n  space via two-dimensional balanced allocations","author":"Gilad Asharov","year":"2016"},{"key":"ref49:JC:AshSegSha21","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s00145-020-09370-z","article-title":"Tight Tradeoffs in Searchable Symmetric Encryption","volume":"34","author":"Gilad Asharov","year":"2021","journal-title":"Journal of Cryptology"},{"key":"ref50:C:DemPapPap18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-319-96884-1_13","article-title":"Searchable Encryption with Optimal Locality: Achieving\n  Sublogarithmic Read Efficiency","volume":"10991","author":"Ioannis Demertzis","year":"2018"},{"key":"ref51:CCS:Bost16","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1145\/2976749.2978303","article-title":"$\\Sigma o \\phi o \\varsigma$: Forward Secure Searchable\n  Encryption","author":"Raphael Bost","year":"2016"},{"key":"ref52:C:GarMohPap16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-662-53015-3_20","article-title":"TWORAM: Efficient Oblivious RAM in Two Rounds with\n  Applications to Searchable Encryption","volume":"9816","author":"Sanjam Garg","year":"2016"},{"key":"ref53:CCS:KKLPK17","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1145\/3133956.3133970","article-title":"Forward Secure Dynamic Searchable Symmetric Encryption with\n  Efficient Updates","author":"Kee Sung Kim","year":"2017"},{"key":"ref54:CCS:BosMinOhr17","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1145\/3133956.3133980","article-title":"Forward and Backward Private Searchable Encryption from\n  Constrained Cryptographic Primitives","author":"Rapha\u00ebl Bost","year":"2017"},{"key":"ref55:PoPETS:EKPE18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1515\/popets-2018-0002","article-title":"Efficient Dynamic Searchable Encryption with Forward\n  Privacy","volume":"2018","author":"Mohammad Etemad","year":"2018","journal-title":"PoPETs"},{"key":"ref56:AC:AmjKamMoa23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-981-99-8736-8_8","article-title":"Injection-Secure Structured and Searchable Symmetric\n  Encryption","volume":"14443","author":"Ghous Amjad","year":"2023"},{"key":"ref57:goldreich1996software","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","article-title":"Software protection and simulation on oblivious RAMs","volume":"43","author":"Oded Goldreich","year":"1996","journal-title":"Journal of the ACM (JACM)"},{"key":"ref58:C:PinRei10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-14623-7_27","article-title":"Oblivious RAM Revisited","volume":"6223","author":"Benny Pinkas","year":"2010"},{"key":"ref59:stefanov2018path","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3177872","article-title":"Path ORAM: an extremely simple oblivious RAM protocol","volume":"65","author":"Emil Stefanov","year":"2018","journal-title":"Journal of the ACM (JACM)"},{"key":"ref60:wang2015circuit","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1145\/2810103.2813634","article-title":"Circuit oram: On tightness of the goldreich-ostrovsky lower\n  bound","author":"Xiao Wang","year":"2015"},{"key":"ref61:CCS:DoeShe17","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1145\/3133956.3133967","article-title":"Scaling ORAM for Secure Computation","author":"Jack Doerner","year":"2017"},{"key":"ref62:devadas2016onion","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-662-49099-0_6","article-title":"Onion ORAM: A constant bandwidth blowup oblivious RAM","author":"Srinivas Devadas","year":"2016"},{"key":"ref63:garg2016tworam","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-662-53015-3_20","article-title":"TWORAM: Efficient oblivious RAM in two rounds with\n  applications to searchable encryption","author":"Sanjam Garg","year":"2016"},{"key":"ref64:FC:MMBC15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-662-47854-7_9","article-title":"Resizable Tree-Based Oblivious RAM","volume":"8975","author":"Tarik Moataz","year":"2015"},{"key":"ref65:katz2020introduction","doi-asserted-by":"publisher","DOI":"10.5555\/1206501","volume-title":"Introduction to modern cryptography","author":"Jonathan Katz","year":"2020"},{"key":"ref66:AC:LinNisOrl13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-42045-0_22","article-title":"Hiding the Input-Size in Secure Two-Party Computation","volume":"8270","author":"Yehuda Lindell","year":"2013"},{"key":"ref67:AC:KRTW19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-030-34621-8_23","article-title":"Scalable Private Set Union from Symmetric-Key Techniques","volume":"11922","author":"Vladimir Kolesnikov","year":"2019"},{"key":"ref68:PKC:GMRSS21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-030-75248-4_21","article-title":"Private Set Operations from Oblivious Switching","volume":"12711","author":"Gayathri Garimella","year":"2021"},{"key":"ref69:jia2022shuffle","isbn-type":"print","first-page":"2947","article-title":"Shuffle-based Private Set Union: Faster and More Secure","author":"Yanxue Jia","year":"2022","ISBN":"https:\/\/id.crossref.org\/isbn\/9781939133311"},{"key":"ref70:PETS:GGHJRW13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-39077-7_1","article-title":"Optimizing ORAM and Using It Efficiently for Secure\n  Computation","volume":"7981","author":"Craig Gentry","year":"2013"},{"key":"ref71:TCC:FIPR05","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","article-title":"Keyword Search and Oblivious Pseudorandom Functions","volume":"3378","author":"Michael J. Freedman","year":"2005"},{"key":"ref72:TCC:JarLiu09","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-00457-5_34","article-title":"Efficient Oblivious Pseudorandom Function with Applications\n  to Adaptive OT and Secure Computation of Set Intersection","volume":"5444","author":"Stanislaw Jarecki","year":"2009"},{"key":"ref73:FOCS:Yao86","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/SFCS.1986.25","article-title":"How to Generate and Exchange Secrets (Extended Abstract)","author":"Andrew Chi-Chih Yao","year":"1986"},{"key":"ref74:JC:LinPin09","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","article-title":"A Proof of Security of Yao's Protocol for Two-Party\n  Computation","volume":"22","author":"Yehuda Lindell","year":"2009","journal-title":"Journal of Cryptology"},{"key":"ref75:CCS:HazLin08","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1145\/1455770.1455832","article-title":"Constructions of truly practical secure protocols using\n  standardsmartcards","author":"Carmit Hazay","year":"2008"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:40:02Z","timestamp":1767915602000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/2\/4\/25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,8]]},"references-count":75,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,1,8]]}},"URL":"https:\/\/doi.org\/10.62056\/av4fsgbmo","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,8]]},"assertion":[{"value":"2025-10-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc2-4-48"}}