{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T17:04:54Z","timestamp":1753895094099,"version":"3.41.2"},"reference-count":64,"publisher":"International Association for Cryptologic Research","issue":"4","license":[{"start":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T00:00:00Z","timestamp":1728086400000},"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":[[2024,12,3]]},"abstract":"<jats:p>  Non-interactive zero-knowledge (NIZK) proof systems are a cornerstone of   modern cryptography, but their security has received little attention in the   quantum settings.   Motivated by improving our understanding of this fundamental primitive against   quantum adversaries, we propose a new definition of security against quantum   adversary.   Specifically, we define the notion of quantum simulation soundness (SS-NIZK),   that allows the adversary to access the simulator in superposition.<\/jats:p>\n          <jats:p>  We show a separation between post-quantum and quantum security of SS-NIZK, and   prove that Sahai\u2019s construction for SS-NIZK (in the CRS model) can be made   quantumly-simulation-sound.   As an immediate application of our new notion, we prove the security of the   Naor-Yung paradigm in the quantum settings, with respect to a strong quantum   IND-CCA security notion.   This provides the quantum analogue of the classical dual key approach to prove   the security of encryption schemes.   Along the way, we introduce a new notion of quantum-query advantage functions,   which may be used as a general framework to show classical\/quantum separation   for other cryptographic primitives, and it may be of independent interest. <\/jats:p>","DOI":"10.62056\/a66ce0iuc","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T17:00:52Z","timestamp":1736787652000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":0,"title":["On Quantum Simulation-Soundness"],"prefix":"10.62056","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8335-2787","authenticated-orcid":false,"given":"Behzad","family":"Abdolmaleki","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/05krs5044","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Sheffield","place":["Sheffield, UK"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4231-4958","authenticated-orcid":false,"given":"C\u00e9line","family":"Chevalier","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/04qb2qm38","id-type":"ROR","asserted-by":"publisher"}],"name":"CRED, Universit\u00e9 Panth\u00e9on-Assas, Paris II","place":["Paris, France"]},{"id":[{"id":"https:\/\/ror.org\/05a0dhs15","id-type":"ROR","asserted-by":"publisher"}],"name":"DIENS, \u00c9cole normale sup\u00e9rieure, PSL University, CNRS, INRIA","place":["Paris, France"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6917-7734","authenticated-orcid":false,"given":"Ehsan","family":"Ebrahimi","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/036x5ad56","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Luxembourg","place":["Luxembourg"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9737-0094","authenticated-orcid":false,"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/05crjpb27","id-type":"ROR","asserted-by":"publisher"}],"name":"Bocconi University","place":["Milan, Italy"]},{"id":[{"id":"https:\/\/ror.org\/00bj0r217","id-type":"ROR","asserted-by":"publisher"}],"name":"Max-Planck Institute in Security and Privacy","place":["Bochum, Germany"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4916-6798","authenticated-orcid":false,"given":"Quoc-Huy","family":"Vu","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/02setav13","id-type":"ROR","asserted-by":"publisher"}],"name":"L\u00e9onard de Vinci P\u00f4le Universitaire, Research Center","place":["Paris La D\u00e9fense, France"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"48349","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"key":"ref1:FOCS:Shor94","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","article-title":"Algorithms for Quantum Computation: Discrete Logarithms and\n  Factoring","author":"Peter W. Shor","year":"1994"},{"key":"ref2:STOC:Watrous06","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/1132516.1132560","article-title":"Zero-knowledge against quantum attacks","author":"John Watrous","year":"2006"},{"key":"ref3:EC:Unruh12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-29011-4_10","article-title":"Quantum Proofs of Knowledge","volume":"7237","author":"Dominique Unruh","year":"2012"},{"key":"ref4:ICITS:DFNS13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-319-04268-8_9","article-title":"Superposition Attacks on Cryptographic Protocols","volume":"8317","author":"Ivan Damg\u00e5rd","year":"2014"},{"key":"ref5:C:KLLN16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-662-53008-5_8","article-title":"Breaking Symmetric Cryptosystems Using Quantum Period\n  Finding","volume":"9815","author":"Marc Kaplan","year":"2016"},{"key":"ref6:KuwakadoM10","doi-asserted-by":"publisher","first-page":"2682","DOI":"10.1109\/ISIT.2010.5513654","article-title":"Quantum distinguisher between the 3-round Feistel cipher and\n  the random permutation","author":"Hidenori Kuwakado","year":"2010"},{"key":"ref7:KuwakadoM12","first-page":"312","article-title":"Security on the quantum-type Even-Mansour cipher","author":"Hidenori Kuwakado","year":"2012"},{"key":"ref8:FOCS:Zhandry12","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/FOCS.2012.37","article-title":"How to Construct Quantum Random Functions","author":"Mark Zhandry","year":"2012"},{"key":"ref9:EC:BonZha13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-642-38348-9_35","article-title":"Quantum-Secure Message Authentication Codes","volume":"7881","author":"Dan Boneh","year":"2013"},{"key":"ref10:C:BonZha13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-40084-1_21","article-title":"Secure Signatures and Chosen Ciphertext Security in a\n  Quantum Computing World","volume":"8043","author":"Dan Boneh","year":"2013"},{"key":"ref11:PQCRYPTO:ATTU16","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-29360-8_4","article-title":"Post-Quantum Security of the CBC, CFB, OFB, CTR, and\n  XTS Modes of Operation","author":"Mayuresh Vivekanand Anand","year":"2016"},{"key":"ref12:EC:AMRS20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1007\/978-3-030-45727-3_27","article-title":"Quantum-Access-Secure Message Authentication via\n  Blind-Unforgeability","volume":"12107","author":"Gorjan Alagic","year":"2020"},{"key":"ref13:AC:BBCLNSS21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/978-3-030-92062-3_23","article-title":"QCB: Efficient Quantum-Secure Authenticated Encryption","volume":"13090","author":"Ritam Bhaumik","year":"2021"},{"key":"ref14:TCC:CETU21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-030-90459-3_9","article-title":"Relationships Between Quantum IND-CPA Notions","volume":"13042","author":"Tore Vincent Carstens","year":"2021"},{"key":"ref15:EC:ABKM22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-031-07082-2_17","article-title":"Post-Quantum Security of the Even-Mansour Cipher","volume":"13277","author":"Gorjan Alagic","year":"2022"},{"key":"ref16:PQCRYPTO:EbrWie22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-031-17234-2_13","article-title":"Post-quantum Plaintext-Awareness","volume":"13512","author":"Ehsan Ebrahimi","year":"2022"},{"key":"ref17:CheEbrVu22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-031-22912-1_26","article-title":"On Security Notions for Encryption in a Quantum World","volume":"13774","author":"C\u00e9line Chevalier","year":"2022"},{"key":"ref18:STOC:GolMicRac85","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/22145.22178","article-title":"The Knowledge Complexity of Interactive Proof-Systems\n  (Extended Abstract)","author":"Shafi Goldwasser","year":"1985"},{"key":"ref19:STOC:BluFelMic88","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/62212.62222","article-title":"Non-Interactive Zero-Knowledge and Its Applications\n  (Extended Abstract)","author":"Manuel Blum","year":"1988"},{"key":"ref20:C:BelGol89","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/0-387-34805-0_19","article-title":"New Paradigms for Digital Signatures and Message\n  Authentication Based on Non-Interactive Zero Knowledge Proofs","volume":"435","author":"Mihir Bellare","year":"1990"},{"key":"ref21:EC:CamLys01","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","article-title":"An Efficient System for Non-transferable Anonymous\n  Credentials with Optional Anonymity Revocation","volume":"2045","author":"Jan Camenisch","year":"2001"},{"key":"ref22:C:BCCKLS09","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-03356-8_7","article-title":"Randomizable Proofs and Delegatable Anonymous Credentials","volume":"5677","author":"Mira Belenkiy","year":"2009"},{"key":"ref23:SAC:CKLMNP15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-31301-6_1","article-title":"Formal Treatment of Privacy-Enhancing Credential Systems","volume":"9566","author":"Jan Camenisch","year":"2016"},{"key":"ref24:JC:FucHanSla19","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/s00145-018-9281-4","article-title":"Structure-Preserving Signatures on Equivalence Classes and\n  Constant-Size Anonymous Credentials","volume":"32","author":"Georg Fuchsbauer","year":"2019","journal-title":"Journal of Cryptology"},{"key":"ref25:EC:ChaVan91","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","article-title":"Group Signatures","volume":"547","author":"David Chaum","year":"1991"},{"key":"ref26:C:BonBoySha04","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","article-title":"Short Group Signatures","volume":"3152","author":"Dan Boneh","year":"2004"},{"key":"ref27:ACNS:BCCGG16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-39555-5_7","article-title":"Foundations of Fully Dynamic Group Signatures","volume":"9696","author":"Jonathan Bootle","year":"2016"},{"key":"ref28:C:GenGenPar10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","article-title":"Non-interactive Verifiable Computing: Outsourcing\n  Computation to Untrusted Workers","volume":"6223","author":"Rosario Gennaro","year":"2010"},{"key":"ref29:EC:GGPR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","article-title":"Quadratic Span Programs and Succinct NIZKs without\n  PCPs","volume":"7881","author":"Rosario Gennaro","year":"2013"},{"key":"ref30:AC:BCGJM18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-030-03326-2_20","article-title":"Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct\n  Program Execution","volume":"11272","author":"Jonathan Bootle","year":"2018"},{"key":"ref31:FOCS:Sahai99","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/SFFCS.1999.814628","article-title":"Non-Malleable Non-Interactive Zero Knowledge and Adaptive\n  Chosen-Ciphertext Security","author":"Amit Sahai","year":"1999"},{"key":"ref32:FOCS:Canetti01","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1109\/SFCS.2001.959888","article-title":"Universally Composable Security: A New Paradigm for\n  Cryptographic Protocols","author":"Ran Canetti","year":"2001"},{"key":"ref33:STOC:NaoYun90","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/100216.100273","article-title":"Public-key Cryptosystems Provably Secure against Chosen\n  Ciphertext Attacks","author":"Moni Naor","year":"1990"},{"key":"ref34:AC:LNPT20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-030-64837-4_5","article-title":"Simulation-Sound Arguments for LWE and Applications to\n  KDM-CCA2 Security","volume":"12491","author":"Beno\u00eet Libert","year":"2020"},{"key":"ref35:AC:Groth06","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11935230_29","article-title":"Simulation-Sound NIZK Proofs for a Practical Language and\n  Constant Size Group Signatures","volume":"4284","author":"Jens Groth","year":"2006"},{"key":"ref36:EC:Unruh15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/978-3-662-46803-6_25","article-title":"Non-Interactive Zero-Knowledge Proofs in the Quantum Random\n  Oracle Model","volume":"9057","author":"Dominique Unruh","year":"2015"},{"key":"ref37:EC:KilLyuSch18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-319-78372-7_18","article-title":"A Concrete Treatment of Fiat-Shamir Signatures in the\n  Quantum Random-Oracle Model","volume":"10822","author":"Eike Kiltz","year":"2018"},{"key":"ref38:EC:DaoGru23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-031-30617-4_18","article-title":"Spartan and Bulletproofs are Simulation-Extractable (for\n  Free!)","volume":"14005","author":"Quang Dao","year":"2023"},{"key":"ref39:EC:CamChaSho09","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-642-01001-9_20","article-title":"A Public Key Encryption Scheme Secure against Key Dependent\n  Chosen Plaintext and Adaptive Chosen Ciphertext Attacks","volume":"5479","author":"Jan Camenisch","year":"2009"},{"key":"ref40:C:NaoSeg09","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-03356-8_2","article-title":"Public-Key Cryptosystems Resilient to Key Leakage","volume":"5677","author":"Moni Naor","year":"2009"},{"key":"ref41:vazirani2019fully","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/3310974","article-title":"Fully device independent quantum key distribution","volume":"62","author":"Umesh Vazirani","year":"2019","journal-title":"Communications of the ACM"},{"key":"ref42:wootters1982single","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","article-title":"A single quantum cannot be cloned","volume":"299","author":"William K Wootters","year":"1982","journal-title":"Nature"},{"volume-title":"Simulation-Sound Non-Interactive Zero Knowledge","year":"2001","author":"Amit Sahai","key":"ref43:sahai2001simulation"},{"key":"ref44:C:DDOPS01","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","article-title":"Robust Non-interactive Zero Knowledge","volume":"2139","author":"Alfredo De Santis","year":"2001"},{"key":"ref45:C:FiaSha86","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","article-title":"How to Prove Yourself: Practical Solutions to\n  Identification and Signature Problems","volume":"263","author":"Amos Fiat","year":"1987"},{"key":"ref46:C:Zhandry19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-26951-7_9","article-title":"How to Record Quantum Queries, and Applications to Quantum\n  Indifferentiability","volume":"11693","author":"Mark Zhandry","year":"2019"},{"key":"ref47:Sahai99","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/SFFCS.1999.814628","article-title":"Non-Malleable Non-Interactive Zero Knowledge and Adaptive\n  Chosen-Ciphertext Security","author":"Amit Sahai","year":"1999"},{"key":"ref48:TCC:LMQW22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-22318-1_1","article-title":"Post-quantum Insecurity from LWE","volume":"13747","author":"Alex Lombardi","year":"2022"},{"key":"ref49:STOC:Regev05","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/1060590.1060603","article-title":"On lattices, learning with errors, random linear codes, and\n  cryptography","author":"Oded Regev","year":"2005"},{"key":"ref50:FOCS:BCMVV18","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1109\/FOCS.2018.00038","article-title":"A Cryptographic Test of Quantumness and Certifiable\n  Randomness from a Single Quantum Device","author":"Zvika Brakerski","year":"2018"},{"volume-title":"C$\\emptyset$C$\\emptyset$: A Framework for Building\n  Composable Zero-Knowledge Proofs","year":"2015","author":"Ahmed Kosba","key":"ref51:EPRINT:KZMQCPPSS15"},{"key":"ref52:C:Naor89","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","article-title":"Bit Commitment Using Pseudo-Randomness","volume":"435","author":"Moni Naor","year":"1990"},{"key":"ref53:NC10","isbn-type":"print","volume-title":"Quantum Computation and Quantum Information: 10th\n  Anniversary Edition","author":"Michael A. Nielsen","year":"2011","ISBN":"https:\/\/id.crossref.org\/isbn\/1107002176"},{"key":"ref54:C:Zhandry12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/978-3-642-32009-5_44","article-title":"Secure Identity-Based Encryption in the Quantum Random\n  Oracle Model","volume":"7417","author":"Mark Zhandry","year":"2012"},{"key":"ref55:AMRS20v4","article-title":"Quantum-secure message authentication via\n  blind-unforgeability","author":"Gorjan Alagic","year":"2023","journal-title":"arXiv preprint arXiv:1803.03761v4"},{"key":"ref56:RadSat20","series-title":"AFT '19","isbn-type":"print","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/3318041.3355462","article-title":"Semi-Quantum Money","author":"Roy Radian","year":"2019","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450367325"},{"key":"ref57:TCC:BonKimWu17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-319-70500-2_9","article-title":"Constrained Keys for Invertible Pseudorandom Functions","volume":"10677","author":"Dan Boneh","year":"2017"},{"key":"ref58:TCC:BitPan15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-662-46497-7_16","article-title":"ZAPs and Non-Interactive Witness Indistinguishability from\n  Indistinguishability Obfuscation","volume":"9015","author":"Nir Bitansky","year":"2015"},{"key":"ref59:C:GolOst92","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-48071-4_16","article-title":"Invariant Signatures and Non-Interactive Zero-Knowledge\n  Proofs are Equivalent (Extended Abstract)","volume":"740","author":"Shafi Goldwasser","year":"1993"},{"key":"ref60:FOCS:FeiLapSha90","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1109\/FSCS.1990.89549","article-title":"Multiple Non-Interactive Zero Knowledge Proofs Based on a\n  Single Random String (Extended Abstract)","author":"Uriel Feige","year":"1990"},{"key":"ref61:AC:HofUrs19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-030-34578-5_12","article-title":"Dual-Mode NIZKs from Obfuscation","volume":"11921","author":"Dennis Hofheinz","year":"2019"},{"key":"ref62:FOCS:DeSPer92","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1109\/SFCS.1992.267809","article-title":"Zero-Knowledge Proofs of Knowledge Without Interaction\n  (Extended Abstract)","author":"Alfredo De Santis","year":"1992"},{"key":"ref63:CSF:AGRS23","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1109\/CSF61375.2024.00006","article-title":"Circuit-Succinct Universally-Composable NIZKs with Updatable\n  CRS","author":"Behzad Abdolmaleki","year":"2024"},{"key":"ref64:CCS:AbdRamSla20","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1145\/3372297.3417228","article-title":"Lift-and-Shift: Obtaining Simulation Extractable Subversion\n  and Updatable SNARKs Generically","author":"Behzad Abdolmaleki","year":"2020"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T17:11:36Z","timestamp":1736788296000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/1\/4\/18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,13]]},"references-count":64,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,1,13]]}},"URL":"https:\/\/doi.org\/10.62056\/a66ce0iuc","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"type":"electronic","value":"3006-5496"}],"subject":[],"published":{"date-parts":[[2025,1,13]]},"assertion":[{"value":"2024-10-05","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-30"}}