{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:46:59Z","timestamp":1757627219801,"version":"3.44.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032019066"},{"type":"electronic","value":"9783032019073"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-032-01907-3_20","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:40Z","timestamp":1755383260000},"page":"611-642","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Incrementally Verifiable Computation for\u00a0NP from\u00a0Standard Assumptions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3938-7594","authenticated-orcid":false,"given":"Pratish","family":"Datta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3572-7643","authenticated-orcid":false,"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2233-3768","authenticated-orcid":false,"given":"Zhengzhong","family":"Jin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6888-5296","authenticated-orcid":false,"given":"Alexis","family":"Korb","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4904-3637","authenticated-orcid":false,"given":"Surya","family":"Mathialagan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2216-9600","authenticated-orcid":false,"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Asharov, G., Segev, G.: Limits on the power of indistinguishability obfuscation and functional encryption. In: Guruswami, V. (ed.) 56th FOCS, pp. 191\u2013209. IEEE Computer Society Press (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.21","DOI":"10.1109\/FOCS.2015.21"},{"key":"20_CR2","unstructured":"Barbara, A., Chiesa, A., Guan, Z.: Relativized succinct arguments in the ROM do not exist. Cryptology ePrint Archive, Report 2024\/728 (2024). https:\/\/eprint.iacr.org\/2024\/728"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO\u00a02014, Part\u00a0II. LNCS, vol.\u00a08617, pp. 276\u2013294. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_16","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 111\u2013120. ACM Press (2013). https:\/\/doi.org\/10.1145\/2488608.2488623","DOI":"10.1145\/2488608.2488623"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Kamath, C., Paneth, O., Rothblum, R.D., Vasudevan, P.N.: Batch proofs are statistically hiding. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.) 56th ACM STOC, pp. 435\u2013443. ACM Press (2024). https:\/\/doi.org\/10.1145\/3618260.3649775","DOI":"10.1145\/3618260.3649775"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Halo infinite: proof-carrying data from additive polynomial commitments. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0I. LNCS, vol. 12825, pp. 649\u2013680. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_23","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"20_CR7","unstructured":"Bonneau, J., Meckler, I., Rao, V., Shapiro, E.: Coda: decentralized cryptocurrency at scale. Cryptology ePrint Archive, Report 2020\/352 (2020). https:\/\/eprint.iacr.org\/2020\/352"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Branco, P., D\u00f6ttling, N., Srinivasan, A., Zanotto, R.: Rate-1 fully local somewhere extractable hashing from DDH. In: Tang, Q., Teague, V. (eds.) PKC\u00a02024, Part\u00a0II. LNCS, vol. 14603, pp. 356\u2013386. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57725-3_12","DOI":"10.1007\/978-3-031-57725-3_12"},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Chiesa, A., Lin, W., Mishra, P., Spooner, N.: Proof-carrying data without succinct arguments. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0I. LNCS, vol. 12825, pp. 681\u2013710. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_24","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Recursive proof composition from accumulation schemes. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020, Part\u00a0II. LNCS, vol. 12551, pp. 1\u201318. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_1","DOI":"10.1007\/978-3-030-64378-2_1"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Ganesh, C., Khoshakhlagh, H., Siim, J.: Impossibilities in succinct arguments: black-box extraction and more. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) AFRICACRYPT 23. LNCS, vol. 14064, pp. 465\u2013489. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37679-5_20","DOI":"10.1007\/978-3-031-37679-5_20"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1981)","journal-title":"Commun. ACM"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Chen, M., Chiesa, A., Gur, T., O\u2019Connor, J., Spooner, N.: Proof-carrying data from arithmetized random oracles. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0II. LNCS, vol. 14005, pp. 379\u2013404. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_13","DOI":"10.1007\/978-3-031-30617-4_13"},{"key":"20_CR14","unstructured":"Chen, W., Chiesa, A., Dauterman, E., Ward, N.P.: Reducing participation costs via incremental verification for ledger systems. Cryptology ePrint Archive, Report 2020\/1522 (2020). https:\/\/eprint.iacr.org\/2020\/1522"},{"key":"20_CR15","unstructured":"Chiesa, A., Guan, Z., Samocha, S., Yogev, E.: Security bounds for proof-carrying data from straightline extractors. Cryptology ePrint Archive, Report 2023\/1646 (2023). https:\/\/eprint.iacr.org\/2023\/1646"},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Fractal: post-quantum and transparent recursive proofs from holography. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0I. LNCS, vol. 12105, pp. 769\u2013793. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_27","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"20_CR17","unstructured":"Chong, S., Tromer, E., Vaughan, J.A.: Enforcing language semantics using proof-carrying data. Cryptology ePrint Archive, Report 2013\/513 (2013). https:\/\/eprint.iacr.org\/2013\/513"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Garg, S., Jain, A., Jin, Z., Zhang, J.: Correlation intractability and SNARGs from sub-exponential DDH. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 635\u2013668. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_20","DOI":"10.1007\/978-3-031-38551-3_20"},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: SNARGs for $$\\cal{P}$$ from LWE. In: 62nd FOCS, pp. 68\u201379. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00016","DOI":"10.1109\/FOCS52979.2021.00016"},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Devadas, L., Goyal, R., Kalai, Y., Vaikuntanathan, V.: Rate-1 non-interactive arguments for batch-NP and applications. In: 63rd FOCS, pp. 1057\u20131068. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00103","DOI":"10.1109\/FOCS54457.2022.00103"},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Devadas, L., Waters, B., Wu, D.J.: Batching adaptively-sound SNARGs for NP. In: Boyle, E., Mahmoody, M. (eds.) TCC\u00a02024, Part\u00a0II. LNCS, vol. 15365, pp. 339\u2013370. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78017-2_12","DOI":"10.1007\/978-3-031-78017-2_12"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Garg, R., Sheridan, K., Waters, B., Wu, D.J.: Fully succinct batch arguments for NP from indistinguishability obfuscation. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0I. LNCS, vol. 13747, pp. 526\u2013555. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_19","DOI":"10.1007\/978-3-031-22318-1_19"},{"key":"20_CR23","doi-asserted-by":"publisher","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd ACM STOC, pp. 99\u2013108. ACM Press (2011). https:\/\/doi.org\/10.1145\/1993636.1993651","DOI":"10.1145\/1993636.1993651"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: 17th ACM STOC, pp. 291\u2013304. ACM Press (1985). https:\/\/doi.org\/10.1145\/22145.22178","DOI":"10.1145\/22145.22178"},{"key":"20_CR25","doi-asserted-by":"publisher","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for NP. In: Vaudenay, S. (ed.) EUROCRYPT\u00a02006. LNCS, vol.\u00a04004, pp. 339\u2013358. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_21","DOI":"10.1007\/11761679_21"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Hall-Andersen, M., Nielsen, J.B.: On valiant\u2019s conjecture: impossibility of incrementally verifiable computation from random oracles. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0II. LNCS, vol. 14005, pp. 438\u2013469. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_15","DOI":"10.1007\/978-3-031-30617-4_15"},{"key":"20_CR27","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Khuller, S., Williams, V.V. (eds.) 53rd ACM STOC, pp. 60\u201373. ACM Press (2021). https:\/\/doi.org\/10.1145\/3406325.3451093","DOI":"10.1145\/3406325.3451093"},{"key":"20_CR28","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over $$\\mathbb{F} _p$$, DLIN, and PRGs in $${NC}^0$$. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0I. LNCS, vol. 13275, pp. 670\u2013699. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_23","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Jin, Z., Kalai, Y.T., Lombardi, A., Mathialagan, S.: Universal SNARGs for NP from proofs of correctness. In: STOC 2025 (2025, to appear). https:\/\/eprint.iacr.org\/2024\/2015","DOI":"10.1145\/3717823.3718104"},{"key":"20_CR30","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Paneth, O., Yang, L.: How to delegate computations publicly. In: Charikar, M., Cohen, E. (eds.) 51st ACM STOC, pp. 1115\u20131124. ACM Press (2019). https:\/\/doi.org\/10.1145\/3313276.3316411","DOI":"10.1145\/3313276.3316411"},{"key":"20_CR31","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Vaikuntanathan, V., Zhang, R.Y.: Somewhere statistical soundness, post-quantum security, and SNARGs. In: Nissim, K., Waters, B. (eds.) TCC\u00a02021, Part\u00a0I. LNCS, vol. 13042, pp. 330\u2013368. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_12","DOI":"10.1007\/978-3-030-90459-3_12"},{"key":"20_CR32","unstructured":"Kothapalli, A., Setty, S.: SuperNova: proving universal machine executions without universal circuits. Cryptology ePrint Archive, Report 2022\/1758 (2022). https:\/\/eprint.iacr.org\/2022\/1758"},{"key":"20_CR33","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S., Tzialla, I.: Nova: recursive zero-knowledge arguments from folding schemes. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 359\u2013388. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"20_CR34","doi-asserted-by":"publisher","unstructured":"Mathialagan, S., Peters, S., Vaikuntanathan, V.: Adaptively sound zero-knowledge SNARKs for UP. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0X. LNCS, vol. 14929, pp. 38\u201371. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_2","DOI":"10.1007\/978-3-031-68403-6_2"},{"key":"20_CR35","doi-asserted-by":"publisher","unstructured":"Micali, S.: Fair public-key cryptosystems. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 113\u2013138. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_9","DOI":"10.1007\/3-540-48071-4_9"},{"key":"20_CR36","doi-asserted-by":"publisher","unstructured":"Naor, M., Paneth, O., Rothblum, G.N.: Incrementally verifiable computation via incremental PCPs. In: Hofheinz, D., Rosen, A. (eds.) TCC\u00a02019, Part\u00a0II. LNCS, vol. 11892, pp. 552\u2013576. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_21","DOI":"10.1007\/978-3-030-36033-7_21"},{"key":"20_CR37","doi-asserted-by":"publisher","unstructured":"Naveh, A., Tromer, E.: PhotoProof: cryptographic image authentication for any set of permissible transformations. In: 2016 IEEE Symposium on Security and Privacy, pp. 255\u2013271. IEEE Computer Society Press (2016). https:\/\/doi.org\/10.1109\/SP.2016.23","DOI":"10.1109\/SP.2016.23"},{"key":"20_CR38","doi-asserted-by":"publisher","unstructured":"Nguyen, L., Safavi-Naini, R., Kurosawa, K.: Verifiable shuffles: a formal model and a Paillier-based efficient construction with provable security. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 61\u201375. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24852-1_5","DOI":"10.1007\/978-3-540-24852-1_5"},{"key":"20_CR39","doi-asserted-by":"publisher","unstructured":"Paneth, O., Pass, R.: Incrementally verifiable computation via rate-1 batch arguments. In: 63rd FOCS, pp. 1045\u20131056. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00102","DOI":"10.1109\/FOCS54457.2022.00102"},{"key":"20_CR40","doi-asserted-by":"publisher","unstructured":"Peikert, C., Shiehian, S.: Noninteractive zero knowledge for NP from (plain) learning with errors. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO\u00a02019, Part\u00a0I. LNCS, vol. 11692, pp. 89\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_4","DOI":"10.1007\/978-3-030-26948-7_4"},{"key":"20_CR41","doi-asserted-by":"publisher","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 475\u2013484. ACM Press (2014). https:\/\/doi.org\/10.1145\/2591796.2591825","DOI":"10.1145\/2591796.2591825"},{"key":"20_CR42","doi-asserted-by":"publisher","unstructured":"Sako, K., Kilian, J.: Receipt-free mix-type voting scheme - a practical solution to the implementation of a voting booth. In: Guillou, L.C., Quisquater, J.J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 393\u2013403. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-49264-X_32","DOI":"10.1007\/3-540-49264-X_32"},{"key":"20_CR43","doi-asserted-by":"publisher","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) TCC\u00a02008. LNCS, vol.\u00a04948, pp. 1\u201318. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1","DOI":"10.1007\/978-3-540-78524-8_1"},{"key":"20_CR44","doi-asserted-by":"publisher","unstructured":"Waters, B., Wu, D.J.: Batch arguments for NP and more from standard bilinear group assumptions. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 433\u2013463. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_15","DOI":"10.1007\/978-3-031-15979-4_15"},{"key":"20_CR45","doi-asserted-by":"publisher","unstructured":"Waters, B., Wu, D.J.: Adaptively-sound succinct arguments for NP from indistinguishability obfuscation. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.) 56th ACM STOC, pp. 387\u2013398. ACM Press (2024). https:\/\/doi.org\/10.1145\/3618260.3649671","DOI":"10.1145\/3618260.3649671"},{"key":"20_CR46","unstructured":"Waters, B., Wu, D.J.: A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP. To appear at Crypto 2025. Cryptology ePrint Archive, Paper 2024\/933 (2024). https:\/\/eprint.iacr.org\/2024\/933"},{"key":"20_CR47","doi-asserted-by":"publisher","unstructured":"Waters, B., Zhandry, M.: Adaptive security in SNARGs via iO and lossy functions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0X. LNCS, vol. 14929, pp. 72\u2013104. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_3","DOI":"10.1007\/978-3-031-68403-6_3"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01907-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T01:29:13Z","timestamp":1757467753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01907-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019066","9783032019073"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01907-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}