{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T14:28:37Z","timestamp":1781533717521,"version":"3.54.5"},"reference-count":63,"publisher":"International Association for Cryptologic Research","issue":"4","license":[{"start":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T00:00:00Z","timestamp":1728259200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/dana-nsf-medium","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2154705"],"award-info":[{"award-number":["CNS-2154705"]}],"id":[{"id":"10.13039\/dana-nsf-medium","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/dana-nsf-small","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1933033"],"award-info":[{"award-number":["CNS-1933033"]}],"id":[{"id":"10.13039\/dana-nsf-small","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/dana-nsf-amazon","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-2147276"],"award-info":[{"award-number":["IIS-2147276"]}],"id":[{"id":"10.13039\/dana-nsf-amazon","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2024,12,3]]},"abstract":"<jats:p>The min-hash sketch is a well-known technique for low-communication approximation of the Jaccard index between two input sets.  Moreover, there is a folklore belief that min-hash sketch-based protocols protect the privacy of the inputs.  In this paper, we consider variants of private min-hash sketch based-protocols and investigate this folklore to quantify the privacy of the min-hash sketch.<\/jats:p>\n                  <jats:p>We begin our investigation by presenting a highly-efficient two-party protocol for estimating the Jaccard index while ensuring differential privacy. This protocol adds Laplacian noise to the min-hash sketch counts to provide privacy protection.<\/jats:p>\n                  <jats:p>Then, we aim to understand what privacy, if any, is guaranteed if the results of the min-hash are released without any additional noise, such as in the case of historical data. We begin our investigation by considering the privacy of min-hash in a centralized setting where the hash functions are chosen by the min-hash functionality and are unknown to the participants. We show that in this case the min-hash output satisfies the standard definition of differential privacy (DP) without any additional noise.<\/jats:p>\n                  <jats:p>We next consider a more practical distributed setting, where the hash function must be shared among all parties and is typically public.<\/jats:p>\n                  <jats:p>Unfortunately, we show that in this public hash function setting, the min-hash output is no longer DP.  We therefore consider the notion of distributional differential privacy (DDP) introduced by Bassily et al. (FOCS 2013). We show that if the honest party's set has sufficiently high min-entropy, the min-hash output achieves DDP without requiring noise.<\/jats:p>\n                  <jats:p>Our findings provide guidance on how to use the min-hash sketch for private Jaccard index estimation and clarify the extent to which min-hash protocols protect input privacy, refining the common belief in their privacy guarantees.<\/jats:p>","DOI":"10.62056\/ak2i5w7sf","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T12:00:52Z","timestamp":1736769652000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":0,"title":["On the Privacy of Sublinear-Communication Jaccard Index Estimation via Min-hash"],"prefix":"10.62056","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-1088-3336","authenticated-orcid":false,"given":"Mingyu","family":"Liang","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/047s2c258","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Maryland","place":["USA"]},{"id":[{"id":"https:\/\/ror.org\/00y4zzh67","id-type":"ROR","asserted-by":"publisher"}],"name":"George Washington University","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9563-9648","authenticated-orcid":false,"given":"Seung","family":"Choi","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00znex860","id-type":"ROR","asserted-by":"publisher"}],"name":"United States Naval Academy","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6797-641X","authenticated-orcid":false,"given":"Dana","family":"Dachman-Soled","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/047s2c258","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Maryland","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8982-9688","authenticated-orcid":false,"given":"Linsheng","family":"Liu","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00y4zzh67","id-type":"ROR","asserted-by":"publisher"}],"name":"George Washington University","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9045-748X","authenticated-orcid":false,"given":"Arkady","family":"Yerukhimovich","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00y4zzh67","id-type":"ROR","asserted-by":"publisher"}],"name":"George Washington University","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"48349","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"key":"ref1:B97","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/sequen.1997.666900","article-title":"On the Resemblance and Containment of Documents","author":"A. Broder","year":"1997"},{"key":"ref2:LOZ12","doi-asserted-by":"publisher","first-page":"3122","DOI":"10.5555\/2999325.2999482","article-title":"One Permutation Hashing","author":"Ping Li","year":"2012"},{"key":"ref3:jaccard","doi-asserted-by":"publisher","first-page":"547","DOI":"10.5169\/seals-266450","article-title":"\u00c9tude comparative de la distribution florale dans une\n  portion des Alpes et des Jura","volume":"37","author":"Paul Jaccard","year":"1901","journal-title":"Bull Soc Vaudoise Sci Nat"},{"key":"ref4:cn:BGMZ97","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1016\/s0169-7552(97)00031-7","article-title":"Syntactic Clustering of the Web","volume":"29","author":"Andrei Z. Broder","year":"1997","journal-title":"Comput. Networks"},{"key":"ref5:kdd:TanBerKem07","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1145\/1281192.1281269","article-title":"A framework for community identification in dynamic social\n  networks","author":"Chayant Tantipathananandh","year":"2007"},{"key":"ref6:wpes:CFGT12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/2381966.2381980","article-title":"Genodroid: are privacy-preserving genomic tests ready for\n  prime time?","author":"Emiliano De Cristofaro","year":"2012"},{"key":"ref7:ijcai:WWTDLZ19","doi-asserted-by":"publisher","first-page":"4816","DOI":"10.24963\/ijcai.2019\/669","article-title":"Adversarial Examples for Graph Data: Deep Insights into\n  Attack and Defense","author":"Huijun Wu","year":"2019"},{"key":"ref8:icip:JKWC22","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/icip46576.2022.9897745","article-title":"Refining Self-Supervised Learning in Imaging: Beyond Linear\n  Metric","author":"Bo Jiang","year":"2022"},{"key":"ref9:BluCriGas14","doi-asserted-by":"publisher","first-page":"355","DOI":"10.3233\/jcs-130482","article-title":"EsPRESSO: Efficient privacy-preserving evaluation of sample\n  set similarity","volume":"22","author":"Carlo Blundo","year":"2014","journal-title":"J. Comput. Secur."},{"key":"ref10:eprint:RCSWK19","volume-title":"Sub-Linear Privacy-Preserving Near-Neighbor Search","author":"M. Sadegh Riazi","year":"2019"},{"key":"ref11:Faber:thesis","article-title":"Variants of Privacy Preserving Set Intersection and their\n  Practical Applications","author":"Sky Faber","year":"2016","journal-title":"PhD Thesis"},{"key":"ref12:arxiv:YLLHQ17","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1705.07258","article-title":"PrivMin: Differentially Private MinHash for Jaccard\n  Similarity Computation","volume":"abs\/1705.07258","author":"Ziqi Yan","year":"2017","journal-title":"CoRR"},{"key":"ref13:conc:YWRLLQ19","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4889","article-title":"Locally private Jaccard similarity estimation","volume":"31","author":"Ziqi Yan","year":"2019","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref14:sisap:AumBouSch20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-030-60936-8_2","article-title":"Differentially Private Sketches for Jaccard Similarity\n  Estimation","author":"Martin Aum\u00fcller","year":"2020"},{"key":"ref15:DGT12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-35404-5_17","article-title":"Fast and Private Computation of Cardinality of Set\n  Intersection and Union","volume":"7712","author":"Emiliano De Cristofaro","year":"2012"},{"key":"ref16:TL23","series-title":"ICMLC '24","isbn-type":"print","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/3651671.3651682","article-title":"Break Two PSI-CA Protocols in Polynomial Time","author":"Yang Tan","year":"2024","ISBN":"https:\/\/id.crossref.org\/isbn\/9798400709234"},{"key":"ref17:ICML:HehTinCor23","doi-asserted-by":"publisher","first-page":"12846","DOI":"10.5555\/3618408.3618930","article-title":"Sketch-Flip-Merge: Mergeable Sketches for Private Distinct\n  Counting","volume":"202","author":"Jonathan Hehir","year":"2023"},{"key":"ref18:FOCS:BBDS12","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1109\/FOCS.2012.67","article-title":"The Johnson-Lindenstrauss Transform Itself Preserves\n  Differential Privacy","author":"Jeremiah Blocki","year":"2012"},{"key":"ref19:choi2020differentially","doi-asserted-by":"publisher","first-page":"153","DOI":"10.2478\/popets-2020-0047","article-title":"Differentially-private multi-party sketching for large-scale\n  statistics","volume":"2020","author":"Seung Geol Choi","year":"2020","journal-title":"Proceedings on Privacy Enhancing Technologies"},{"key":"ref20:smith2020flajolet","doi-asserted-by":"publisher","first-page":"19561","DOI":"10.5555\/3495724.3497365","article-title":"The flajolet-martin sketch itself preserves differential\n  privacy: Private counting with minimal space","volume":"33","author":"Adam Smith","year":"2020","journal-title":"NeurIPS 2020"},{"key":"ref21:wang2022differentially","article-title":"Differentially Private Fractional Frequency Moments\n  Estimation with Polylogarithmic Space","author":"Lun Wang","year":"2022"},{"key":"ref22:FOCS:BGKS13","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1109\/FOCS.2013.54","article-title":"Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty\n  in Statistical Data Privacy","author":"Raef Bassily","year":"2013"},{"key":"ref23:DKZ18","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ipl.2018.02.007","article-title":"Quasi chain rule for min-entropy","volume":"134","author":"Stefan Dziembowski","year":"2018","journal-title":"Inf. Process. Lett."},{"key":"ref24:skorski2019strong","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1109\/isit.2019.8849240","article-title":"Strong chain rules for min-entropy under few bits spoiled","author":"Maciej Sk\u00f3rski","year":"2019"},{"key":"ref25:dwork2006differential","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","article-title":"Differential privacy","author":"Cynthia Dwork","year":"2006"},{"key":"ref26:dwork2006calibrating","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","article-title":"Calibrating noise to sensitivity in private data analysis","author":"Cynthia Dwork","year":"2006"},{"key":"ref27:dwork2014algorithmic","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/9781601988195","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Cynthia Dwork","year":"2014","journal-title":"Foundations and Trends\u00ae in Theoretical\n  Computer Science"},{"key":"ref28:BNO08","isbn-type":"print","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-85174-5_25","article-title":"Distributed Private Data Analysis: Simultaneously Solving\n  How and What","author":"Amos Beimel","year":"2008","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540851745"},{"key":"ref29:CCS:HMFS17","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1145\/3133956.3134030","article-title":"Composing Differential Privacy and Secure Computation: A\n  Case Study on Scaling Private Record Linkage","author":"Xi He","year":"2017"},{"key":"ref30:PETS:GroRinRos19","doi-asserted-by":"publisher","first-page":"6","DOI":"10.2478\/popets-2019-0034","article-title":"Cheaper Private Set Intersection via Differentially Private\n  Leakage","volume":"2019","author":"Adam Groce","year":"2019","journal-title":"Proc. Privacy Enhancing Technologies (PETS)"},{"key":"ref31:CCS:MazGor18","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/3243734.3243851","article-title":"Secure Computation with Differentially Private Access\n  Patterns","author":"Sahar Mazloom","year":"2018"},{"key":"ref32:Usenix:MLRG20","first-page":"2487","article-title":"Secure parallel computation on national scale volumes of\n  data","author":"Sahar Mazloom","year":"2020"},{"key":"ref33:SODA:CCMS19","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1137\/1.9781611975482.150","article-title":"Foundations of Differentially Oblivious Algorithms","author":"T.-H. Hubert Chan","year":"2019"},{"key":"ref34:ACNS:GKLX22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-031-09234-3_25","article-title":"Spreading the Privacy Blanket: - Differentially Oblivious\n  Shuffling for Differential Privacy","volume":"13269","author":"S. Dov Gordon","year":"2022"},{"key":"ref35:dickens2022order","doi-asserted-by":"publisher","first-page":"15204","DOI":"10.5555\/3600270.3601376","article-title":"Order-invariant cardinality estimators are differentially\n  private","volume":"35","author":"Charlie Dickens","year":"2022","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref36:li2019privacy","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1911.00972","article-title":"Privacy for free: Communication-efficient learning with\n  differential privacy using sketches","author":"Tian Li","year":"2019","journal-title":"arXiv preprint arXiv:1911.00972"},{"key":"ref37:pagh2022improved","doi-asserted-by":"publisher","first-page":"25631","DOI":"10.5555\/3600270.3602128","article-title":"Improved utility analysis of private countsketch","volume":"35","author":"Rasmus Pagh","year":"2022","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref38:mir2011pan","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1989284.1989290","article-title":"Pan-private algorithms via statistics on sketches","author":"Darakhshan Mir","year":"2011"},{"key":"ref39:melis2015efficient","series-title":"NDSS 2016","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2016.23175","article-title":"Efficient Private Statistics with Succinct Sketches","author":"Luca Melis","year":"2016"},{"key":"ref40:bassily2015local","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1145\/2746539.2746632","article-title":"Local, private, efficient protocols for succinct\n  histograms","author":"Raef Bassily","year":"2015"},{"key":"ref41:bassily2017practical","doi-asserted-by":"publisher","DOI":"10.5555\/3294771.3294989","article-title":"Practical locally private heavy hitters","volume":"30","author":"Raef Bassily","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref42:huang2021frequency","doi-asserted-by":"publisher","first-page":"2058","DOI":"10.14778\/3547305.3547312","article-title":"Frequency estimation under multiparty differential privacy:\n  one-shot and streaming","volume":"15","author":"Ziyue Huang","year":"2022","journal-title":"Proc. VLDB Endow.","ISSN":"https:\/\/id.crossref.org\/issn\/2150-8097","issn-type":"electronic"},{"key":"ref43:zhao2022differentially","doi-asserted-by":"publisher","first-page":"12691","DOI":"10.5555\/3600270.3601192","article-title":"Differentially private linear sketches: Efficient\n  implementations and applications","volume":"35","author":"Fuheng Zhao","year":"2022","journal-title":"NeurIPS 2022"},{"key":"ref44:stanojevic2017distributed","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/pac.2017.43","article-title":"Distributed cardinality estimation of set operations with\n  differential privacy","author":"Rade Stanojevic","year":"2017"},{"key":"ref45:sparka2018p2kmv","doi-asserted-by":"publisher","DOI":"10.14279\/DEPOSITONCE-8374","article-title":"P2KMV: A privacy-preserving counting sketch for efficient\n  and accurate set intersection cardinality estimations","author":"Hagen Sparka","year":"2018","journal-title":"Cryptology ePrint Archive"},{"key":"ref46:nunez2020rrtxfm","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-39634-3_9","article-title":"Rrtxfm: Probabilistic counting for differentially private\n  statistics","author":"Saskia Nu\u00f1ez von Voigt","year":"2020"},{"key":"ref47:kreuter2020privacy","volume-title":"Privacy-Preserving Secure Cardinality and Frequency\n  Estimation","author":"Benjamin Kreuter","year":"2020"},{"key":"ref48:pagh_et_al:LIPIcs.ICDT.2021.18","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2021.18","article-title":"Efficient Differentially Private $F_0$ Linear Sketching","volume":"186","author":"Rasmus Pagh","year":"2021","ISBN":"https:\/\/id.crossref.org\/isbn\/9783959771795","ISSN":"https:\/\/id.crossref.org\/issn\/1868-8969","issn-type":"electronic"},{"key":"ref49:ICALP:FIMNSW01","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/3-540-48224-5_75","article-title":"Secure Multiparty Computation of Approximations","volume":"2076","author":"Joan Feigenbaum","year":"2001"},{"key":"ref50:STOC:HKKN01","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/380752.380850","article-title":"Private approximation of NP-hard functions","author":"Shai Halevi","year":"2001"},{"key":"ref51:itcs:BoyLavVai19","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2019.16","article-title":"Adversarially Robust Property-Preserving Hash Functions","volume":"124","author":"Elette Boyle","year":"2019"},{"key":"ref52:EC:FleSim21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-030-77883-5_11","article-title":"Robust Property-Preserving Hash Functions for Hamming\n  Distance and More","volume":"12698","author":"Nils Fleischhacker","year":"2021"},{"key":"ref53:EC:FleLarSim22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/978-3-031-07085-3_26","article-title":"Property-Preserving Hash Functions for Hamming Distance from\n  Standard Assumptions","volume":"13276","author":"Nils Fleischhacker","year":"2022"},{"key":"ref54:C:HLTW22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-031-15982-4_16","article-title":"Nearly Optimal Property Preserving Hashing","volume":"13509","author":"Justin Holmgren","year":"2022"},{"key":"ref55:ITCS:ACSS23","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2023.8","article-title":"A Framework for Adversarial Streaming via Differential\n  Privacy and Difference Estimators","volume":"251","author":"Idan Attias","year":"2023"},{"key":"ref56:JACM:BJWY22","doi-asserted-by":"publisher","DOI":"10.1145\/3498334","article-title":"A Framework for Adversarially Robust Streaming Algorithms","volume":"69","author":"Omri Ben-Eliezer","year":"2022","journal-title":"J. ACM"},{"key":"ref57:D18","article-title":"Probabilistic Tools for the Analysis of Randomized\n  Optimization Heuristics","volume":"abs\/1801.06733","author":"Benjamin Doerr","year":"2018","journal-title":"CoRR"},{"key":"ref58:SCRS17","doi-asserted-by":"publisher","DOI":"10.1145\/3146549","article-title":"Distributed Private Data Analysis: Lower Bounds and\n  Practical Constructions","volume":"13","author":"Elaine Shi","year":"2017","journal-title":"ACM Trans. Algorithms"},{"key":"ref59:COK22","first-page":"3490","article-title":"The Poisson Binomial Mechanism for Unbiased Federated\n  Learning with Secure Aggregation","volume":"162","author":"Wei-Ning Chen","year":"2022"},{"key":"ref60:DORS08","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","article-title":"Fuzzy Extractors: How to Generate Strong Keys from\n  Biometrics and Other Noisy Data","volume":"38","author":"Yevgeniy Dodis","year":"2008","journal-title":"SIAM Journal on Computing"},{"key":"ref61:SasVer15","article-title":"Bounds among f-divergences","volume":"abs\/1508.00335","author":"Igal Sason","year":"2015","journal-title":"CoRR"},{"key":"ref62:Ost02","article-title":"Csiszar\u2019s f-divergence-basic properties","author":"Ferdinand \u00d6sterreicher","year":"2002","journal-title":"RGMIA Research Report Collection"},{"key":"ref63:ICALP:BarOlm13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-39212-2_8","article-title":"Beyond Differential Privacy: Composition Theorems and\n  Relational Logic for f-divergences between Probabilistic Programs","volume":"7966","author":"Gilles Barthe","year":"2013"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T12:11:54Z","timestamp":1736770314000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/1\/4\/22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,13]]},"references-count":63,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,1,13]]}},"URL":"https:\/\/doi.org\/10.62056\/ak2i5w7sf","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,13]]},"assertion":[{"value":"2024-10-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-03","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc1-4-43"}}