{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:59:17Z","timestamp":1781078357474,"version":"3.54.1"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032019066","type":"print"},{"value":"9783032019073","type":"electronic"}],"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_10","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:32Z","timestamp":1755383252000},"page":"292-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Pure Indistinguishability Obfuscation Approach to\u00a0Adaptively-Sound SNARGs for\u00a0$$\\textsf{NP}$$"],"prefix":"10.1007","author":[{"given":"Brent","family":"Waters","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David J.","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Cini, V., Lai, R.W.F., Malavolta, G., Thyagarajan, S.A.: Lattice-based SNARKs: Publicly verifiable, preprocessing, and recursively composable - (extended abstract). In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_4CRYPTO","DOI":"10.1007\/978-3-031-15979-4_4CRYPTO"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC (1996)","DOI":"10.1145\/237814.237838"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Asharov, G., Segev, G.: Limits on the power of indistinguishability obfuscation and functional encryption. In: FOCS (2015)","DOI":"10.1109\/FOCS.2015.21"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Brodsky, M.F., Kalai, Y.T., Lombardi, A., Paneth, O:. SNARGs for monotone policy batch NP. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14082. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_9","DOI":"10.1007\/978-3-031-38545-2_9"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bitansky, N., et al.: The hunting of the SNARK. J. Cryptol. 30(4) (2017)","DOI":"10.1007\/s00145-016-9241-9"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: ITCS (2012)","DOI":"10.1145\/2090236.2090263"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: STOC (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Balb\u00e1s, D., Catalano, D., Fiore, D., Lai, R.W.F.: Chainable functional commitments for unbounded-depth circuits. In: TCC (2023)","DOI":"10.1007\/978-3-031-48621-0_13"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Chiesa, A., Ishai, Y., Ostrovsky, R., Paneth, O.: Succinct non-interactive arguments via linear interactive proofs. In: TCC (2013)","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Paneth, O., Rosen, A.: On the existence of extractable one-way functions. In: STOC (2014)","DOI":"10.1145\/2591796.2591859"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. In: Kilian, J. (eds.) CRYPTO 2001. LNCS, vol. 2139. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1","DOI":"10.1007\/3-540-44647-8_1"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: PKC (2014)","DOI":"10.1007\/978-3-642-54631-0_29"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-56617-7_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"D Boneh","year":"2017","unstructured":"Boneh, D., Ishai, Y., Sahai, A., Wu, D.J.: Lattice-based SNARGs and their application to more efficient obfuscation. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 247\u2013277. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_9"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-78372-7_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Ishai, Y., Sahai, A., Wu, D.J.: Quasi-optimal SNARGs via linear multi-prover interactive proofs. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 222\u2013255. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_8"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Paneth, O., Wichs, D.: Perfect structure on the edge of chaos - trapdoor permutations from indistinguishability obfuscation. In: TCC (2016)","DOI":"10.1007\/978-3-662-49096-9_20"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_15"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Canetti, R., et al.: iat-shamir: from practice to theory. In: STOC (2019)","DOI":"10.1145\/3313276.3316380"},{"key":"10_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: andschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14084. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_20","DOI":"10.1007\/978-3-031-38551-3_20"},{"key":"10_CR19","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 2023. LNCS, vol. 14064. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37679-5_20","DOI":"10.1007\/978-3-031-37679-5_20"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-030-84259-8_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"AR Choudhuri","year":"2021","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: Non-interactive batch arguments for NP from standard assumptions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 394\u2013423. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_14"},{"key":"10_CR21","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: SNARGs for P from LWE In: FOCS (2021)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Cini, V., Lai, R.W.F., Malavolta, G.: Lattice-based succinct arguments from vanishing polynomials - (extended abstract). In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38545-2_3"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Faust, S., Hazay, C.: Secure two-party computation with low communication. In: TCC (2012)","DOI":"10.1007\/978-3-642-28914-9_4"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Devadas, L., Goyal, R., Kalai, Y., Vaikuntanathan, V.: Rate-1 non-interactive arguments for batch-NP and applications. In: FOCS (2022)","DOI":"10.1109\/FOCS54457.2022.00103"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-39568-7_22","volume-title":"Advances in Cryptology","author":"O Goldreich","year":"1985","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: On the cryptographic applications of random functions (extended abstract). In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 276\u2013288. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_22"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R Gennaro","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-22670-0_3","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O., Levin, L.A., Nisan, N.: On constructing 1-1 one-way functions. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. LNCS, vol. 6650, pp. 13\u201325. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22670-0_3"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-17373-8_19","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"J Groth","year":"2010","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 321\u2013340. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_19"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: STOC (2011)","DOI":"10.1145\/1993636.1993651"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":": Gonz\u00e1lez, A., Zacharakis., A.: Fully-succinct publicly verifiable delegation from constant-size assumptions. In: TCC (2021)","DOI":"10.1007\/978-3-030-90459-3_18"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Hulett, J., Jawale, R., Khurana, D., Srinivasan, A.: SNARGs for P from sub-exponential DDH and QR. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol 13276. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_18","DOI":"10.1007\/978-3-031-07085-3_18"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Jin, Z., Kalai, Y.T., Lombardi, A., Vaikuntanathan, V.: SNARGs under LWE via propositional proofs. In: STOC (2024)","DOI":"10.1145\/3618260.3649770"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: STOC (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over $$\\mathbb{F} _p$$, DLIN, and PRGs in $${\\sf NC}^0$$. In: EUROCRYPT (2022)","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Kilian, J.:A note on efficient zero-knowledge proofs and arguments (extended abstract). In: STOC (1992)","DOI":"10.1145\/129712.129782"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Kalai, Y., Lombardi, A., Vaikuntanathan, V., Wichs, D.: Boosting batch arguments and RAM delegation. In: STOC (2023)","DOI":"10.1145\/3564246.3585200"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Komargodski, I., Moran, T., Naor, M., Pass, R., Rosen, A., Yogev, E.: One-way functions and (im)perfect obfuscation. In: FOCS (2014)","DOI":"10.1109\/FOCS.2014.47"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: ACM CCS (2013)","DOI":"10.1145\/2508859.2516668"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Vaikuntanathan, V., Zhang, R.Y.: Somewhere statistical soundness, post-quantum security, and SNARGs. In: TCC (2021)","DOI":"10.1007\/978-3-030-90459-3_12"},{"key":"10_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-42033-7_3","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"H Lipmaa","year":"2013","unstructured":"Lipmaa, H.: Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8269, pp. 41\u201360. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_3"},{"key":"10_CR41","unstructured":"Micali, S.: CS proofs (extended abstracts). In: FOCS (1994)"},{"key":"10_CR42","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 2024. LNCS, vol. 14929. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_2","DOI":"10.1007\/978-3-031-68403-6_2"},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"Nassar, S., Waters, B., Wu, D.J.: Monotone policy BARGs from BARGs and additively homomorphic encryption. In: TCC (2024)","DOI":"10.1007\/978-3-031-78017-2_14"},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"Nassar, S., Waters, B., Wu, D.J.: Monotone-policy BARGs and more from BARGs and quadratic residuosity. In: PKC, pp. 283\u2013313 (2025)","DOI":"10.1007\/978-3-031-91829-2_9"},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"Paneth, O., Pass, R.: Incrementally verifiable computation via rate-1 batch arguments. In: FOCS (2022)","DOI":"10.1109\/FOCS54457.2022.00102"},{"key":"10_CR46","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"10_CR47","doi-asserted-by":"crossref","unstructured":"Ragavan, S., Vafa, N., Vaikuntanathan., V.: Indistinguishability obfuscation from bilinear maps and LPN variants. In: TCC (2024)","DOI":"10.1007\/978-3-031-78023-3_1"},{"key":"10_CR48","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: STOC (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"10_CR49","doi-asserted-by":"publisher","unstructured":"Wee, H.: Almost optimal KP and CP-ABE for circuits from succinct LWE. In: Fehr, S., Fouque, PA. (eds.) EUROCRYPT 2025. LNCS, vol. 15603. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91131-6_2","DOI":"10.1007\/978-3-031-91131-6_2"},{"key":"10_CR50","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 2022. LNCS, vol. 13508. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_15","DOI":"10.1007\/978-3-031-15979-4_15"},{"key":"10_CR51","doi-asserted-by":"publisher","unstructured":"Waters, B., Wichs, D.: Universal amplification of KDM security: From 1-key circular to multi-key KDM. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14082. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_22","DOI":"10.1007\/978-3-031-38545-2_22"},{"key":"10_CR52","doi-asserted-by":"publisher","unstructured":"Wee, H., Wu, D.J.: Lattice-based functional commitments: Fast verification and cryptanalysis. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14442 (2023). Springer, Singapore. https:\/\/doi.org\/10.1007\/978-981-99-8733-7_7","DOI":"10.1007\/978-981-99-8733-7_7"},{"key":"10_CR53","doi-asserted-by":"publisher","unstructured":"Wee, H., Wu, D.J.: Succinct vector, polynomial, and functional commitments from lattices. In: Hazay, C., Stam, M. (eds) EUROCRYPT 2023. LNCS, vol. 14006. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_13","DOI":"10.1007\/978-3-031-30620-4_13"},{"key":"10_CR54","doi-asserted-by":"crossref","unstructured":"Waters, B., Wu, D.J.: Adaptively-sound succinct arguments for NP from indistinguishability obfuscation. In: STOC (2024)","DOI":"10.1145\/3618260.3649671"},{"key":"10_CR55","unstructured":"Waters, B., Wu, D.J.: A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP. IACR Cryptol. ePrint Arch. (2024). https:\/\/eprint.iacr.org\/2024\/933.pdf"},{"key":"10_CR56","doi-asserted-by":"publisher","unstructured":"Wee, H., Wu, D.J.: Succinct functional commitments for circuits from $$k$$-Lin. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS. vol. 14652. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_10","DOI":"10.1007\/978-3-031-58723-8_10"},{"key":"10_CR57","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 2024. LNCS, vol. 14929. 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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:39Z","timestamp":1755383259000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01907-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019066","9783032019073"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01907-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}