{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:28:57Z","timestamp":1778128137969,"version":"3.51.4"},"reference-count":83,"publisher":"International Association for Cryptologic Research","issue":"1","license":[{"start":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T00:00:00Z","timestamp":1736726400000},"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,3,11]]},"abstract":"<jats:p>Private set intersection (PSI) enables two parties to jointly compute the intersection of their private sets without revealing any extra information to each other. In this work, we focus on the unbalanced setting where one party (a powerful server) holds a significantly larger set than the other party (a resource-limited client). We present a new protocol for this setting that achieves a better balance between low client-side storage and efficient online processing.<\/jats:p>\n          <jats:p>We first formalize a general framework to transform Private Information Retrieval (PIR) into PSI with techniques used in prior works. Building upon recent advancements in Private Information Retrieval (PIR), specifically the SimplePIR construction (Henzinger et al., USENIX Security'23), combined with our tailored techniques, our construction shows a great improvement in online efficiency. Concretely, when the client holds a single element, our protocol achieves more than <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n              <mml:mrow>\n                <mml:mn>100<\/mml:mn>\n                <mml:mi>\u00d7<\/mml:mi>\n              <\/mml:mrow>\n            <\/mml:math> faster computation and over <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n              <mml:mrow>\n                <mml:mn>4<\/mml:mn>\n                <mml:mi>\u00d7<\/mml:mi>\n              <\/mml:mrow>\n            <\/mml:math> lower communication compared to the state-of-the-art unbalanced PSI based on leveled fully homomorphic encryption (Chen et al., CCS'21). The client-side storage is only in the order of tens of megabytes, even for a gigabyte-sized set on the server. Moreover, since the framework is generic, any future improvement in PIR can further improve our construction.<\/jats:p>","DOI":"10.62056\/angy4fvtw","type":"journal-article","created":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T21:23:17Z","timestamp":1744147397000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":1,"title":["Finding Balance in Unbalanced PSI: A New Construction from Single-Server PIR"],"prefix":"10.62056","volume":"2","author":[{"given":"Chengyu","family":"Lin","sequence":"first","affiliation":[{"name":"Espresso Systems","place":["United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeyu","family":"Liu","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/03v76x132","id-type":"ROR","asserted-by":"publisher"}],"name":"Yale University","place":["United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peihan","family":"Miao","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/05gq02987","id-type":"ROR","asserted-by":"publisher"}],"name":"Brown University","place":["United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"Tromanhauser","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/05bnh6r87","id-type":"ROR","asserted-by":"publisher"}],"name":"Cornell University","place":["United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"48349","published-online":{"date-parts":[[2025,4,8]]},"reference":[{"key":"ref1:CCS:TroKatCel07","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/1315245.1315309","article-title":"Privacy preserving error resilient dna searching through\n  oblivious automata","author":"Juan Ram\u00f3n Troncoso-Pastoriza","year":"2007"},{"key":"ref2:CCS:BPSW07","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1145\/1315245.1315307","article-title":"Privacy-preserving remote diagnostics","author":"Justin Brickell","year":"2007"},{"key":"ref3:IKNPRSSSY19","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":"ref4:C:MPRSY20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-56877-1_1","article-title":"Two-Sided Malicious Security for Private Intersection-Sum\n  with Cardinality","volume":"12172","author":"Peihan Miao","year":"2020"},{"key":"ref5:10.5555\/3361338.3361446","series-title":"SEC'19","isbn-type":"print","first-page":"1555","article-title":"Protecting accounts from credential stuffing with password\n  breach alerting","author":"Kurt Thomas","year":"2019","ISBN":"https:\/\/id.crossref.org\/isbn\/9781939133069"},{"key":"ref6:passwordchecking1","volume-title":"Validating Leaked Passwords with k-Anonymity","author":"Junade Ali","year":"2018"},{"key":"ref7:passwordchecking2","volume-title":"Password monitor: Safeguarding passwords in microsoft edge","author":"Kristin Lauter","year":"2021"},{"key":"ref8:APPLE","volume-title":"Password Monitoring \u2013 Apple Platform Security","year":"2021"},{"key":"ref9: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":"ref10:USENIX:KRSSW19","first-page":"1447","article-title":"Mobile Private Contact Discovery at Scale","author":"Daniel Kales","year":"2019"},{"key":"ref11:contactdiscovery1","volume-title":"The Difficulty Of Private Contact Discovery","author":"Moxie Marlinspike","year":"2014"},{"key":"ref12:contactdiscovery2","article-title":"All the Numbers are US: Large-scale Abuse of Contact\n  Discovery in Mobile Messengers","author":"Christoph Hagen","year":"2021"},{"key":"ref13:Epione","article-title":"Epione: Lightweight Contact Tracing with Strong Privacy","author":"Ni Trieu","year":"2020","journal-title":"IEEE Data Eng. Bull."},{"key":"ref14:PACT","article-title":"PACT: Privacy-Sensitive Protocols And Mechanisms for\n  Mobile Contact Tracing","author":"Justin Chan","year":"2020","journal-title":"IEEE Data Eng. Bull."},{"key":"ref15: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":"ref16: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":"ref17: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":"ref18: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":"ref19: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":"ref20:EC:PSTY19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-17659-4_5","article-title":"Efficient Circuit-Based PSI with Linear Communication","volume":"11478","author":"Benny Pinkas","year":"2019"},{"key":"ref21: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":"ref22: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":"ref23: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":"ref24:CCS:CMGDILR21","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1145\/3460120.3484760","article-title":"Labeled PSI from Homomorphic Encryption with Reduced\n  Computation and Communication","author":"Kelong Cong","year":"2021"},{"key":"ref25: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":"ref26: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":"ref27:AC:PSSW09","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-10366-7_15","article-title":"Secure Two-Party Computation Is Practical","volume":"5912","author":"Benny Pinkas","year":"2009"},{"key":"ref28: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":"ref29: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":"ref30: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":"ref31:FOCS:CGKS95","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/SFCS.1995.492461","article-title":"Private Information Retrieval","author":"Benny Chor","year":"1995"},{"key":"ref32:EC:CorKog20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-030-45721-1_3","article-title":"Private Information Retrieval with Sublinear Online Time","volume":"12105","author":"Henry Corrigan-Gibbs","year":"2020"},{"key":"ref33:C:SACM21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-030-84259-8_22","article-title":"Puncturable Pseudorandom Sets and Private Information\n  Retrieval with Near-Optimal Online Bandwidth and Time","volume":"12828","author":"Elaine Shi","year":"2021"},{"key":"ref34:EC:CorHenKog22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-07085-3_1","article-title":"Single-Server Private Information Retrieval with Sublinear\n  Amortized Time","volume":"13276","author":"Henry Corrigan-Gibbs","year":"2022"},{"key":"ref35:depir","series-title":"STOC 2023","isbn-type":"print","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1145\/3564246.3585175","article-title":"Doubly Efficient Private Information Retrieval and Fully\n  Homomorphic RAM Computation from Ring LWE","author":"Wei-Kai Lin","year":"2023","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450399135"},{"key":"ref36:treepir","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-031-38545-2_10","article-title":"TreePIR: Sublinear-Time and\u00a0Polylog-Bandwidth Private\n  Information Retrieval from\u00a0DDH","author":"Arthur Lazzaretti","year":"2023"},{"key":"ref37:EPRINT:ChoGilNao98","volume-title":"Private Information Retrieval by Keywords","author":"Benny Chor","year":"1998"},{"key":"ref38:PSY23","isbn-type":"print","first-page":"3853","article-title":"Don\u2019t be Dense: Efficient Keyword PIR\n  for Sparse Databases","author":"Sarvar Patel","year":"2023","ISBN":"https:\/\/id.crossref.org\/isbn\/9781939133373"},{"key":"ref39:simplepir","isbn-type":"print","first-page":"3889","article-title":"One Server for the Price of Two: Simple and Fast\n  Single-Server Private Information Retrieval","author":"Alexandra Henzinger","year":"2023","ISBN":"https:\/\/id.crossref.org\/isbn\/9781939133373"},{"key":"ref40:HFH99","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/336992.337012","article-title":"Enhancing privacy and trust in electronic communities","author":"Bernardo A. Huberman","year":"1999"},{"key":"ref41: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":"ref42:cryptoeprint:2024\/092","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670271","volume-title":"Call Me By My Name: Simple, Practical Private Information\n  Retrieval for Keyword Queries","author":"Sof\u00eda Celi","year":"2024"},{"key":"ref43:frodopir","doi-asserted-by":"publisher","first-page":"365","DOI":"10.56553\/popets-2023-0022","article-title":"FrodoPIR: Simple, Scalable, Single-Server Private\n  Information Retrieval","volume":"2023","author":"Alex Davidson","year":"2023","journal-title":"PoPETs"},{"key":"ref44:FOCS:NaoRei97","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1109\/SFCS.1997.646134","article-title":"Number-theoretic Constructions of Efficient Pseudo-random\n  Functions","author":"Moni Naor","year":"1997"},{"key":"ref45: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":"ref46:cuckoofilter","series-title":"CoNEXT '14","isbn-type":"print","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/2674005.2674994","article-title":"Cuckoo Filter: Practically Better Than Bloom","author":"Bin Fan","year":"2014","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450332798"},{"key":"ref47:Bra12","first-page":"868","article-title":"Fully homomorphic encryption without modulus switching from\n  classical GapSVP","author":"Zvika Brakerski","year":"2012"},{"key":"ref48:FV12","volume-title":"Somewhat Practical Fully Homomorphic Encryption","author":"Junfeng Fan","year":"2012"},{"key":"ref49:BGV14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2633600","article-title":"(Leveled) fully homomorphic encryption without\n  bootstrapping","volume":"6","author":"Zvika Brakerski","year":"2014","journal-title":"ACM Transactions on Computation Theory (TOCT)"},{"key":"ref50:cryptoeprint:2023\/758","isbn-type":"print","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-031-50594-2_23","article-title":"Scaling Mobile Private Contact Discovery toBillions of\n  Users","author":"Laura Hetz","year":"2023","ISBN":"https:\/\/id.crossref.org\/isbn\/9783031505935"},{"key":"ref51:ESORICS:DonChe14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-319-11203-9_22","article-title":"A Fast Single Server Private Information Retrieval Protocol\n  with Low Communication Cost","volume":"8712","author":"Changyu Dong","year":"2014"},{"key":"ref52:PoPETS:KLLPT15","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1515\/popets-2015-0016","article-title":"Optimal Rate Private Information Retrieval from Homomorphic\n  Encryption","volume":"2015","author":"Aggelos Kiayias","year":"2015","journal-title":"PoPETs"},{"key":"ref53:CCS:GreLadMie16","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1145\/2976749.2978407","article-title":"A Protocol for Privately Reporting Ad Impressions at Scale","author":"Matthew Green","year":"2016"},{"key":"ref54:PoPETS:ABFK16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1515\/popets-2016-0010","article-title":"XPIR: Private Information Retrieval for Everyone","volume":"2016","author":"Carlos Aguilar-Melchor","year":"2016","journal-title":"PoPETs"},{"key":"ref55:SP:ACLS18","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/SP.2018.00062","article-title":"PIR with Compressed Queries and Amortized Query\n  Processing","author":"Sebastian Angel","year":"2018"},{"key":"ref56:TCC:GenHal19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-030-36033-7_17","article-title":"Compressible FHE with Applications to PIR","volume":"11892","author":"Craig Gentry","year":"2019"},{"key":"ref57:ESORICS:ParTib20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-59013-0_5","article-title":"SHECS-PIR: Somewhat Homomorphic Encryption-Based Compact\n  and Scalable Private Information Retrieval","volume":"12309","author":"Jeongeun Park","year":"2020"},{"key":"ref58:USENIX:ALPRSSY21","first-page":"1811","article-title":"Communication-Computation Trade-offs in PIR","author":"Asra Ali","year":"2021"},{"key":"ref59:CCS:MugCheRen21","doi-asserted-by":"publisher","first-page":"2292","DOI":"10.1145\/3460120.3485381","article-title":"OnionPIR: Response Efficient Single-Server PIR","author":"Muhammad Haris Mughees","year":"2021"},{"key":"ref60:SP:MenWu22","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1109\/SP46214.2022.9833700","article-title":"SPIRAL: Fast, High-Rate Single-Server PIR via FHE\n  Composition","author":"Samir Jordan Menon","year":"2022"},{"key":"ref61:ESORICS:LinLiuMal22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-031-17140-6_11","article-title":"XSPIR: Efficient Symmetrically Private Information\n  Retrieval from Ring-LWE","volume":"13554","author":"Chengyu Lin","year":"2022"},{"key":"ref62:USENIX:KogCor21","first-page":"875","article-title":"Private Blocklist Lookups with Checklist","author":"Dmitry Kogan","year":"2021"},{"key":"ref63:cryptoeprint:2022\/830","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-48618-0_14","volume-title":"Near-Optimal Private Information Retrieval with\n  Preprocessing","author":"Arthur Lazzaretti","year":"2022"},{"key":"ref64:EC:ZLTS23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-031-30545-0_14","article-title":"Optimal Single-Server Private Information Retrieval","volume":"14004","author":"Mingxun Zhou","year":"2023"},{"key":"ref65:piano","volume-title":"Piano: Extremely Simple, Single-Server PIR with Sublinear\n  Server Computation","author":"Mingxun Zhou","year":"2023"},{"key":"ref66:thorpir","series-title":"CCS '24","isbn-type":"print","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1145\/3658644.3690326","article-title":"ThorPIR: Single Server PIR via Homomorphic Thorp Shuffles","author":"Ben Fisch","year":"2024","ISBN":"https:\/\/id.crossref.org\/isbn\/9798400706363"},{"key":"ref67:C:BeiIshMal00","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44598-6_4","article-title":"Reducing the Servers Computation in Private Information\n  Retrieval: PIR with Preprocessing","volume":"1880","author":"Amos Beimel","year":"2000"},{"key":"ref68:TCC:CanHolRic17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-319-70503-3_23","article-title":"Towards Doubly Efficient Private Information Retrieval","volume":"10678","author":"Ran Canetti","year":"2017"},{"key":"ref69:TCC:BIPW17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-319-70503-3_22","article-title":"Can We Access a Database Both Locally and Privately?","volume":"10678","author":"Elette Boyle","year":"2017"},{"key":"ref70:cryptoeprint:2023\/1510","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-78679-2_14","volume-title":"Towards Practical Doubly-Efficient Private Information\n  Retrieval","author":"Hiroki Okada","year":"2023"},{"key":"ref71:Lindell2016HowTS","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57048-8_6","article-title":"How To Simulate It - A Tutorial on the Simulation Proof\n  Technique","volume":"TR17","author":"Yehuda Lindell","year":"2016","journal-title":"Electron. Colloquium Comput. Complex."},{"key":"ref72:MulPIR","isbn-type":"print","first-page":"1811","article-title":"Communication\u2013Computation Trade-offs in\n  PIR","author":"Asra Ali","year":"2021","ISBN":"https:\/\/id.crossref.org\/isbn\/9781939133243"},{"key":"ref73:privatejoin","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92075-3_21","volume-title":"Private Join and Compute from PIR with Default","author":"Tancr\u00e8de Lepoint","year":"2020"},{"key":"ref74:cryptoeprint:2023\/297","volume-title":"Authenticated private information retrieval","author":"Simone Colombo","year":"2023"},{"key":"ref75:cryptoeprint:2024\/341","volume-title":"VeriSimplePIR: Verifiability in SimplePIR at No Online\n  Cost for Honest Servers","author":"Leo de Castro","year":"2024"},{"key":"ref76:cuckoo","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002","article-title":"Cuckoo hashing","author":"Rasmus Pagh","year":"2004","journal-title":"J. Algorithms"},{"key":"ref77:FOCS:KusOst97","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1109\/SFCS.1997.646125","article-title":"Replication is NOT Needed: SINGLE Database,\n  Computationally-Private Information Retrieval","author":"Eyal Kushilevitz","year":"1997"},{"key":"ref78:C:PeiVaiWat08","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","article-title":"A Framework for Efficient and Composable Oblivious\n  Transfer","volume":"5157","author":"Chris Peikert","year":"2008"},{"key":"ref79:FOCS:BraVai11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/FOCS.2011.12","article-title":"Efficient Fully Homomorphic Encryption from (Standard)\n  LWE","author":"Zvika Brakerski","year":"2011"},{"key":"ref80:EC:DucMic15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","article-title":"FHEW: Bootstrapping Homomorphic Encryption in Less Than a\n  Second","volume":"9056","author":"L\u00e9o Ducas","year":"2015"},{"key":"ref81:AC:LiuMicPol22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-031-22966-4_5","article-title":"Large-Precision Homomorphic Sign Evaluation Using\n  FHEW\/TFHE Bootstrapping","volume":"13792","author":"Zeyu Liu","year":"2022"},{"key":"ref82:TCC:HazLin08","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-78524-8_10","article-title":"Efficient Protocols for Set Intersection and Pattern\n  Matching with Security Against Malicious and Covert Adversaries","volume":"4948","author":"Carmit Hazay","year":"2008"},{"key":"ref83:lweEstimator","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1515\/jmc-2015-0016","article-title":"On the concrete hardness of Learning with Errors","volume":"9","author":"Martin R. Albrecht","year":"2015","journal-title":"Journal of Mathematical Cryptology"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T21:25:02Z","timestamp":1744147502000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/2\/1\/27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,8]]},"references-count":83,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,4,8]]}},"URL":"https:\/\/doi.org\/10.62056\/angy4fvtw","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,8]]},"assertion":[{"value":"2025-01-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-11","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc2-1-41"}}