{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:39:34Z","timestamp":1779935974297,"version":"3.53.1"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018861","type":"print"},{"value":"9783032018878","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-01887-8_1","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:17:05Z","timestamp":1755371825000},"page":"3-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["How to\u00a0Prove False Statements: Practical Attacks on\u00a0Fiat-Shamir"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Khovratovich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lev","family":"Soukhanov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"1_CR1","unstructured":"Arnon, G., Yogev, E.: Towards a white-box secure Fiat-Shamir transformation. IACR Cryptol. ePrint Arch., p. 329 (2025)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada, USA, pp. 106\u2013115. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/978-3-030-36033-7_20","volume-title":"Theory of Cryptography","author":"J Bartusek","year":"2019","unstructured":"Bartusek, J., Bronfman, L., Holmgren, J., Ma, F., Rothblum, R.D.: On the (In)security of Kilian-Based SNARGs. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 522\u2013551. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_20"},{"key":"1_CR4","doi-asserted-by":"crossref","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.) Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, June 1-4, pp. 111\u2013120. ACM (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1007\/s00453-016-0221-0","volume":"79","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. Algorithmica 79(4), 1102\u20131160 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0221-0","journal-title":"Algorithmica"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Branco, P., D\u00f6ttling, N., Dujmovi\u0107, J.: Rate-1 incompressible encryption from standard assumptions. IACR Cryptol. ePrint Arch., p. 697 (2022)","DOI":"10.1007\/978-3-031-22365-5_2"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-56877-1_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., Koppula, V., Mour, T.: NIZK from LPN and trapdoor hash via correlation intractability for approximable relations. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 738\u2013767. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_26"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-34961-4_38","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"D Bernhard","year":"2012","unstructured":"Bernhard, D., Pereira, O., Warinschi, B.: How not to prove yourself: pitfalls of the Fiat-Shamir heuristic and applications to Helios. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 626\u2013643. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_38"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Victoria, A. (eds.) CCS 1993, Proceedings of the 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, USA, November 3-5, 1993, pp. 62\u201373. ACM, (1993)","DOI":"10.1145\/168588.168596"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R.: et al.: Fiat-Shamir: from practice to theory. In: Charikar, M., Cohen, E. (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, pages 1082\u20131090. ACM (2019)","DOI":"10.1145\/3313276.3316380"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-662-49096-9_17","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2016","unstructured":"Canetti, R., Chen, Y., Reyzin, L.: On the correlation intractability of obfuscated pseudorandom functions. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 389\u2013415. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_17"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Canetti, R., Chen, Y., Reyzin, L., Rothblum, R.D.: Fiat- Shamir and correlation intractability from strong KDM-secure encryption. In: Nielsen, J., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part I, vol. 10820 . LNCS, pp. 91\u2013122. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_4","DOI":"10.1007\/978-3-319-78381-9_4"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM  51(4), 557\u2013594 (2004)","DOI":"10.1145\/1008731.1008734"},{"key":"1_CR15","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) Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part IV, volume 14084. LNCS, 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":"1_CR16","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: SNARGs for P from LWE. In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pp. 68\u201379. IEEE (2021)","DOI":"10.1109\/FOCS52979.2021.00016"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Chen, L., Rothblum, R.D., Tell, R.: Fiat-Shamir in the plain model from derandomization (or: Do efficient algorithms believe that NP = PSPACE?). Electron. Colloquium Comput. Complex. TR24-116 (2024)","DOI":"10.1145\/3717823.3718177"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Chen, L., Tell, R.: When arthur has neither random coins nor time to spare: superfast derandomization of proof systems. In: Saha, B., Servedio, R.A. (eds.) Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pp. 60\u201369. ACM (2023)","DOI":"10.1145\/3564246.3585215"},{"key":"1_CR19","unstructured":"Chiesa, A., Yogev, E.: Building Cryptographic Proofs from Hash Functions (2024)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Dao, Q., Miller, J., Wright, O., Grubbs, P.: Weak Fiat-Shamir attacks on modern proof systems. In: 44th IEEE Symposium on Security and Privacy, SP 2023, San Francisco, CA, USA, May 21-25, 2023, pp. 199\u2013216. IEEE (2023)","DOI":"10.1109\/SP46215.2023.10179408"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in)security of the Fiat-Shamir paradigm. In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 102\u2013113. IEEE Computer Society (2003)","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for Muggles. J. ACM 62(4), 27:1\u201327:64 (2015)","DOI":"10.1145\/2699436"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: On doubly-efficient interactive proof systems. Found. Trends Theor. Comput. Sci. 13(3), 158\u2013246 (2018)","DOI":"10.1561\/0400000084"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Fortnow, L., Vadhan, S.P. (eds.) Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pp. 99\u2013108. ACM (2011)","DOI":"10.1145\/1993636.1993651"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Haines, T., Lewis, S.J., Pereira, O., Teague, V.: How not to prove your election outcome. In: 2020 IEEE Symposium on Security and Privacy, SP 2020, San Francisco, CA, USA, May 18-21, 2020, pp. 644\u2013660. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00048"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Holmgren, J., Lombardi, A., Rothblum, R.D.: Fiat-Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge). In: Khuller, S., Williams, V.V., (eds.) STOC 2021: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pp. 750\u2013760. ACM (2021)","DOI":"10.1145\/3406325.3451116"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Jawale, R., Kalai, Y.T., Khurana, D., Zhang, R.: SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE. In: Khuller, S., Williams, V.V. (eds.) STOC 2021: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pp. 708\u2013721. ACM (2021)","DOI":"10.1145\/3406325.3451055"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Kosaraju, S.R., Fellows, M., Wigderson, A., Ellis, J.A. (eds.) Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada, pp. 723\u2013732. ACM (1992)","DOI":"10.1145\/129712.129782"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-63715-0_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"YT Kalai","year":"2017","unstructured":"Kalai, Y.T., Rothblum, G.N., Rothblum, R.D.: From obfuscation to the security of Fiat-Shamir for proofs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 224\u2013251. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_8"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859\u2013868 (1992)","DOI":"10.1145\/146585.146605"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253\u20131298 (2000)","DOI":"10.1137\/S0097539795284959"},{"key":"1_CR33","unstructured":"Papini, S., Hab\u00f6ck, U.: Improving logarithmic derivative lookups using GKR. IACR Cryptol. ePrint Arch., p. 1284 (2023)"},{"key":"1_CR34","unstructured":"Polyhedra Network. Expander 2024. https:\/\/github.com\/PolyhedraZK\/Expander. Accessed 15 Jan 2025"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361\u2013396 (2000)","DOI":"10.1007\/s001450010003"},{"key":"1_CR36","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)"},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"Setty, S., Thaler, J., Wahby, R.: Unlocking the lookup singularity with Lasso. In: In: Joye, M., Leander, G. (eds.) Advances in Cryptology - EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zurich, Switzerland, May 26-30, 2024, Proceedings, Part VI, vol. 14656 LNCS, pp. 180\u2013209. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_7","DOI":"10.1007\/978-3-031-58751-1_7"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-40084-1_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J Thaler","year":"2013","unstructured":"Thaler, J.: Time-optimal interactive proofs for circuit evaluation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 71\u201389. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_5"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Thaler, J.: Proofs, arguments, and zero-knowledge. Found. Trends Priv. Secur. 4(2-4), 117\u2013660 (2022)","DOI":"10.1561\/3300000030"},{"key":"1_CR40","unstructured":"Thaler, J.: 17 misconceptions about SNARKs (and why they hold us back) (2023). https:\/\/a16zcrypto.com\/posts\/article\/17-misconceptions-about-snarks. Accessed 19 Dec 2024"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78524-8_1","volume-title":"Theory of Cryptography","author":"P Valiant","year":"2008","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 1\u201318. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zkSNARKs without trusted setup. In: 2018 IEEE Symposium on Security and Privacy, SP 2018, Proceedings, 21-23 May 2018, San Francisco, California, USA, pp. 926\u2013943. IEEE Computer Society (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-030-26954-8_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"T Xie","year":"2019","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 733\u2013764. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Genkin, D., Katz, J., Papadopoulos, D., Papamanthou, C.: vSQL: verifying arbitrary SQL queries over dynamic outsourced databases. In: 2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017, pp. 863\u2013880. IEEE Computer Society (2017)","DOI":"10.1109\/SP.2017.43"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Zhang, J., et al.: Doubly efficient interactive proofs for general arithmetic circuits with linear prover time. In: Kim, Y., Kim, J., Vigna, G., Shi, E., (eds.) CCS 2021: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15 - 19, 2021, pp. 159\u2013177. ACM (2021)","DOI":"10.1145\/3460120.3484767"}],"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-01887-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:17:11Z","timestamp":1755371831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01887-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018861","9783032018878"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01887-8_1","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"}}]}}