{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T09:42:16Z","timestamp":1768902136214,"version":"3.49.0"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018540","type":"print"},{"value":"9783032018557","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-01855-7_19","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:41:36Z","timestamp":1755373296000},"page":"585-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Uniform Black-Box Separations via\u00a0Non-malleable Extractors"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4236-3710","authenticated-orcid":false,"given":"Marshall","family":"Ball","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6797-641X","authenticated-orcid":false,"given":"Dana","family":"Dachman-Soled","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L.M.: Two theorems on random polynomial time. In: FOCS, pp. 75\u201383. IEEE Computer Society (1978)","DOI":"10.1109\/SFCS.1978.37"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., D\u00f6ttling, N., Nielsen, J.B., Obremski, M., Purwanto, E.: Continuous non-malleable codes in the 8-split-state model. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. Part I, volume 11476 of LNCS, pp. 531\u2013561. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_18","DOI":"10.1007\/978-3-030-17653-2_18"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00037-016-0128-9","volume":"25","author":"B Applebaum","year":"2016","unstructured":"Applebaum, B., Artemenko, S., Shaltiel, R., Yang, G.: Incompressible functions, relative-error extractors, and the power of nondeterministic reductions. Comput. Complex. 25(2), 349\u2013418 (2016)","journal-title":"Comput. Complex."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L., Moran, S.: Arthur-merlin games: a randomized proof system, and a hierarchy of complexity classes. J. Comput. Syst. Sci. 36(2), 254\u2013276 (1988)","DOI":"10.1016\/0022-0000(88)90028-1"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Ball, M., Dachman-Soled, D., Loss, J.: (Nondeterministic) hardness vs. non-malleability. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. Part I, volume 13507 of LNCS, pp. 148\u2013177. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_6","DOI":"10.1007\/978-3-031-15802-5_6"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Ball, M., Goldin, E., Dachman-Soled, D., Mutreja, S.: Extracting randomness from samplable distributions, revisited. In: 64th FOCS, pp. 1505\u20131514. IEEE Computer Society Press (2023)","DOI":"10.1109\/FOCS57990.2023.00092"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Barak, B., Ong, S.J., Vadhan, S.P.: Derandomization in cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 299\u2013315. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_18","DOI":"10.1007\/978-3-540-45146-4_18"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1006\/inco.2000.2885","volume":"163","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Goldreich, O., Petrank, E.: Uniform generation of np-witnesses using an np-oracle. Inf. Comput. 163(2), 510\u2013526 (2000)","journal-title":"Inf. Comput."},{"key":"19_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-031-37679-5_20","volume-title":"AFRICACRYPT 23","author":"M Campanelli","year":"2023","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"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Goyal, V., Li, X.: Non-malleable extractors and codes, with their many tampered extensions. In: Wichs, D., Mansour, Y., editors 48th ACM STOC, pp. 285\u2013298. ACM Press (2016)","DOI":"10.1145\/2897518.2897547"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Li, X.: Non-malleable codes and extractors for small-depth circuits, and affine functions. In: Hatami, H., McKenzie, P., King, V., (eds) 49th ACM STOC, pp. 1171\u20131184. ACM Press (2017)","DOI":"10.1145\/3055399.3055483"},{"key":"19_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/s00145-015-9219-z","volume-title":"TCC 2014","author":"M Cheraghchi","year":"2014","unstructured":"Cheraghchi, M., Guruswami, V.: Non-malleable coding against bit-wise and split-state tampering. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 440\u2013464. Springer, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/s00145-015-9219-z"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity (extended abstract). In: 26th FOCS, pp. 429\u2013442. IEEE Computer Society Press (1985)","DOI":"10.1109\/SFCS.1985.62"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Lin, H., Mahmoody, M., Pass, R.: On the power of nonuniformity in proofs of security. In: Kleinberg, R.D. ed. ITCS 2013, pp. 389\u2013400. ACM (2013)","DOI":"10.1145\/2422436.2422480"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Wichs, D.: Non-malleable extractors and symmetric key cryptography from weak secrets. In: Mitzenmacher, M., editor 41st ACM STOC, pp. 601\u2013610. ACM Press (2009)","DOI":"10.1145\/1536414.1536496"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Drucker, A.: Nondeterministic direct product reductions and the success probability of SAT solvers. In: 54th FOCS, pp. 736\u2013745. IEEE Computer Society Press (2013)","DOI":"10.1109\/FOCS.2013.84"},{"key":"19_CR17","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. In: Yao, editor, ICS 2010, pp. 434\u2013452. Tsinghua University Press (2010)"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Faust, S., Mukherjee, P., Nielsen, J.B., Venturi, D.: Continuous non-malleable codes. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 465\u2013488. Springer, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_20","DOI":"10.1007\/978-3-642-54242-8_20"},{"issue":"2","key":"19_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01262928","volume":"6","author":"U Feige","year":"1997","unstructured":"Feige, U., Lund, C.: On the hardness of computing the permanent of random matrices. Comput. Complex. 6(2), 101\u2013132 (1997)","journal-title":"Comput. Complex."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Fortno, L., Vadhan, editors, 43rd ACM STOC, pp. 99\u2013108. ACM Press (2011)","DOI":"10.1145\/1993636.1993651"},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Leshkowitz, M.: On emulating interactive proofs with public coins. In: Goldreich, O., editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation, volume 12050 of Lecture Notes in Computer Science, pp. 178\u2013198. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43662-9_12","DOI":"10.1007\/978-3-030-43662-9_12"},{"key":"19_CR22","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Wigderson, A.: Derandomization that is rarely wrong from short advice that is typically good. In: RANDOM, volume 2483 of Lecture Notes in Computer Science, pp. 209\u2013223. Springer, Berlin, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45726-7_17","DOI":"10.1007\/3-540-45726-7_17"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: 18th ACM STOC, pp. 59\u201368. ACM Press (1986)","DOI":"10.1145\/12130.12137"},{"issue":"3\u20134","key":"19_CR24","first-page":"85","volume":"12","author":"D Gutfreund","year":"2003","unstructured":"Gutfreund, D., Shaltiel, R., Ta-Shma, A.: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Comput. Complex. 12(3\u20134), 85\u2013130 (2003)","journal-title":"Comput. Complex."},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In: 29th ACM STOC, pp. 220\u2013229. ACM Press (1997)","DOI":"10.1145\/258533.258590"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M Jerrum","year":"1986","unstructured":"Jerrum, M., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci. 43, 169\u2013188 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-54242-8_24","volume-title":"TCC 2014","author":"D Jetchev","year":"2014","unstructured":"Jetchev, D., Pietrzak, K.: How to fake auxiliary input. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 566\u2013590. Springer, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_24"},{"issue":"1","key":"19_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00037-011-0019-z","volume":"21","author":"J Kinne","year":"2012","unstructured":"Kinne, J., van Melkebeek, D., Shaltiel, R.: Pseudorandom generators, typically-correct derandomization, and circuit lower bounds. Comput. Complex. 21(1), 3\u201361 (2012)","journal-title":"Comput. Complex."},{"issue":"5","key":"19_CR29","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/S0097539700389652","volume":"31","author":"AR Klivans","year":"2002","unstructured":"Klivans, A.R., van Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput. 31(5), 1501\u20131526 (2002)","journal-title":"SIAM J. Comput."},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Li, S.: Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations. In: Umans, C., ed., 58th FOCS, pp. 283\u2013294. IEEE Computer Society Press (2017)","DOI":"10.1109\/FOCS.2017.34"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Li, X.: Non-malleable extractors, two-source extractors and privacy amplification. In: 53rd FOCS, pp. 688\u2013697. IEEE Computer Society Press (2012)","DOI":"10.1109\/FOCS.2012.26"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Li, X.: New independent source extractors with exponential improvement. In: Boneh, D., Roughgarden, T., Feigenbaum, J., eds, 45th ACM STOC, pp. 783\u2013792. ACM Press, June 2013","DOI":"10.1145\/2488608.2488708"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Li, X.: Three-source extractors for polylogarithmic min-entropy. In: Guruswami, V., ed., 56th FOCS, pp. 863\u2013882. IEEE Computer Society Press (2015)","DOI":"10.1109\/FOCS.2015.58"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Li, X.: Improved non-malleable extractors, non-malleable codes and independent source extractors. In: Hatami, H., McKenzie, P., King, V., eds. 49th ACM STOC, pp. 1144\u20131156. ACM Press (2017)","DOI":"10.1145\/3055399.3055486"},{"key":"19_CR35","unstructured":"Li, X.: Non-malleable extractors and non-malleable codes: Partially optimal constructions. In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA, pp. 28:1\u201328:49 (2019)"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Li, X.: Two source extractors for asymptotically optimal entropy, and (many) more. In: 64th FOCS, pp. 1271\u20131281. IEEE Computer Society Press (2023)","DOI":"10.1109\/FOCS57990.2023.00075"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Mathialagan, S., Peters, S., Vaikuntanathan, V.: Adaptively sound zero-knowledge SNARKs for UP. Cryptology ePrint Archive, Paper 2024\/227 (2024). https:\/\/eprint.iacr.org\/2024\/227","DOI":"10.1007\/978-3-031-68403-6_2"},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"Miltersen, P.B., Vinodchandran, N.V.: Derandomizing Arthur-Merlin games using hitting sets. Comput. Complex. 14(3), 256\u2013279 (2005)","DOI":"10.1007\/s00037-005-0197-7"},{"key":"19_CR39","doi-asserted-by":"publisher","unstructured":"Naor, M.: On cryptographic assumptions and challenges. In: Annual International Cryptology Conference, pp. 96\u2013109. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_6","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"Nisan, N., Wigderson, A.:. Hardness vs. randomness (extended abstract). In: 29th FOCS, pp. 2\u201311. IEEE Computer Society Press (1988)","DOI":"10.1109\/SFCS.1988.21916"},{"key":"19_CR41","series-title":"Part III, volume 10993 of LNCS","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/s00145-020-09362-z","volume-title":"CRYPTO 2018","author":"R Ostrovsky","year":"2018","unstructured":"Ostrovsky, R., Persiano, G., Venturi, D., Visconti, I.: Continuously non-malleable codes in the split-state model from minimal assumptions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. Part III, volume 10993 of LNCS, pp. 608\u2013639. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/s00145-020-09362-z"},{"key":"19_CR42","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-36594-2_19","volume-title":"TCC 2013","author":"R Pass","year":"2013","unstructured":"Pass, R.: Unprovable security of perfect NIZK and non-interactive non-malleable commitments. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 334\u2013354. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_19"},{"key":"19_CR43","unstructured":"Pass, R.: Unprovable security of perfect nizk and non-interactive non-malleable commitments (2017). https:\/\/www.cs.cornell.edu\/~rafael\/papers\/limits2new.pdf. Accessed 10 Feb 2025"},{"key":"19_CR44","doi-asserted-by":"crossref","unstructured":"Sasson, E.B., et al.: Zerocash: Decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 459\u2013474. IEEE (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"19_CR45","doi-asserted-by":"crossref","unstructured":"Shaltiel, R., Umans, C.: Pseudorandomness for approximate counting and sampling. In: 20th Annual IEEE Conference on Computational Complexity (CCC\u201905), pp. 212\u2013226 (2005)","DOI":"10.1109\/CCC.2005.26"},{"issue":"1","key":"19_CR46","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00037-011-0006-4","volume":"20","author":"R Shaltiel","year":"2011","unstructured":"Shaltiel, R.: Weak derandomization of weak algorithms: Explicit versions of yao\u2019s lemma. Comput. Complex. 20(1), 87\u2013143 (2011)","journal-title":"Comput. Complex."},{"issue":"2","key":"19_CR47","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/1059513.1059516","volume":"52","author":"R Shaltiel","year":"2005","unstructured":"Shaltiel, R., Umans, C.: Simple extractors for all min-entropies and a new pseudorandom generator. J. ACM 52(2), 172\u2013216 (2005)","journal-title":"J. ACM"},{"issue":"4","key":"19_CR48","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/s00037-007-0218-9","volume":"15","author":"R Shaltiel","year":"2006","unstructured":"Shaltiel, R., Umans, C.: Pseudorandomness for approximate counting and sampling. Comput. Complex. 15(4), 298\u2013341 (2006)","journal-title":"Comput. Complex."},{"issue":"3","key":"19_CR49","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1137\/070698348","volume":"39","author":"R Shaltiel","year":"2009","unstructured":"Shaltiel, R., Umans, C.: Low-end uniform hardness versus randomness tradeoffs for AM. SIAM J. Comput. 39(3), 1006\u20131037 (2009)","journal-title":"SIAM J. Comput."},{"key":"19_CR50","doi-asserted-by":"crossref","unstructured":"Trevisan, L., Vadhan, S.P.: Extracting randomness from samplable distributions. In: 41st FOCS, pp. 32\u201342. IEEE Computer Society Press (2000)","DOI":"10.1109\/SFCS.2000.892063"},{"key":"19_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-40041-4_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Vadhan","year":"2013","unstructured":"Vadhan, S., Zheng, C.J.: A uniform min-max theorem with applications in cryptography. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 93\u2013110. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_6"},{"key":"19_CR52","unstructured":"Waters, B., Wu, D.J.: Adaptively-sound succinct arguments for NP from indistinguishability obfuscation. Cryptology ePrint Archive, Paper 2024\/165 (2024). https:\/\/eprint.iacr.org\/2024\/165"},{"key":"19_CR53","unstructured":"Waters, B., Wu, D.J.: A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP. Cryptology ePrint Archive, Paper 2024\/933 (2024). https:\/\/eprint.iacr.org\/2024\/933"},{"key":"19_CR54","doi-asserted-by":"crossref","unstructured":"Waters, B., Zhandry, M.: Adaptive security in SNARGs via iO and lossy functions. Cryptology ePrint Archive, Paper 2024\/254 (2024). https:\/\/eprint.iacr.org\/2024\/254","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-01855-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T19:21:55Z","timestamp":1768850515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01855-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018540","9783032018557"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01855-7_19","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"}}]}}