{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T15:15:15Z","timestamp":1767971715898,"version":"3.49.0"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018779","type":"print"},{"value":"9783032018786","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-01878-6_6","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T18:09:02Z","timestamp":1755367742000},"page":"170-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Merkle Mountain Ranges are Optimal: On Witness Update Frequency for\u00a0Cryptographic Accumulators"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Bonneau","sequence":"first","affiliation":[]},{"given":"Jessica","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Miranda","family":"Christ","sequence":"additional","affiliation":[]},{"given":"Ioanna","family":"Karantaidou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/978-3-030-64840-4_28","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"S Agrawal","year":"2020","unstructured":"Agrawal, S., Raghuraman, S.: KVaC: key-value commitments for blockchains and beyond. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 839\u2013869. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_28"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-00862-7_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"MH Au","year":"2009","unstructured":"Au, M.H., Tsang, P.P., Susilo, W., Mu, Y.: Dynamic universal accumulators for DDH groups and their application to attribute-based anonymous credential systems. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 295\u2013308. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00862-7_20"},{"key":"6_CR3","unstructured":"Axiom (2024). https:\/\/docs.axiom.xyz\/"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Baldimtsi, F., et al.: Accumulators with applications to anonymity-preserving revocation. In: IEEE EuroS &P (2017)","DOI":"10.1109\/EuroSP.2017.13"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"J Benaloh","year":"1994","unstructured":"Benaloh, J., de Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274\u2013285. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_24"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01185212","volume":"12","author":"M Blum","year":"1994","unstructured":"Blum, M., Evans, W., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. Algorithmica 12, 225\u2013244 (1994)","journal-title":"Algorithmica"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-030-26948-7_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Boneh","year":"2019","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: Batching techniques for accumulators with applications to IOPs and stateless blockchains. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 561\u2013586. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_20"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Komargodski, I., Vafa, N.: Memory checking requires logarithmic overhead. In: ACM TOC (2024)","DOI":"10.1145\/3618260.3649686"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Kiffer, L., Luu, L., Zamani, M.: Flyclient: super-light clients for cryptocurrencies. In: IEEE Security & Privacy (2020)","DOI":"10.1109\/SP40000.2020.00049"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-14712-8_11","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"P Camacho","year":"2010","unstructured":"Camacho, P., Hevia, A.: On the impossibility of batch update for cryptographic accumulators. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol. 6212, pp. 178\u2013188. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14712-8_11"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61\u201376. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_5"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36362-7_5","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Christ, M., Bonneau, J.: Limits on revocable proof systems, with applications to stateless blockchains. In: Financial Crypto (2022)","DOI":"10.1007\/978-3-031-47751-5_4"},{"key":"6_CR14","unstructured":"Compact Ranges. Google Transparency project (2024). https:\/\/github.com\/transparency-dev\/merkle\/blob\/main\/docs\/compact_ranges.md"},{"key":"6_CR15","unstructured":"Crosby, S.A., Wallach, D.S.: Efficient data structures for tamper-evident logging. In: USENIX Security (2009)"},{"key":"6_CR16","unstructured":"Damg\u00e5rd, I., Triandopoulos, N.: Supporting Non-membership Proofs with Bilinear-map Accumulators. Cryptology ePrint Archive, Report 2008\/538 (2008)"},{"key":"6_CR17","unstructured":"Data Trails (2024). https:\/\/docs.datatrails.ai\/developers\/developer-patterns\/navigating-merklelogs\/"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Dujmovic, J., Malavolta, G., Qi, W.: Registration-based encryption in the plain model. In: Jager, T., Pan, J. (eds.) PKC 2025. LNCS, vol. 15674, pp. 194\u2013226. Springer, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-031-91820-9_7","DOI":"10.1007\/978-3-031-91820-9_7"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-642-00457-5_30","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2009","unstructured":"Dwork, C., Naor, M., Rothblum, G.N., Vaikuntanathan, V.: How efficient can memory checking be? In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 503\u2013520. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_30"},{"key":"6_CR20","unstructured":"Explaining FlyClient. Electronic Coin Company blog (2020). https:\/\/electriccoin.co\/blog\/explaining-flyclient-2\/"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Fiore, D., Kolonelos, D., de\u00a0Perthuis, P.: Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces. In: Guo, J., Steinfeld, R. (eds.) Asiscrypt 2023, pp. 166\u2013200. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_6","DOI":"10.1007\/978-981-99-8733-7_6"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-030-03807-6_25","volume-title":"Theory of Cryptography","author":"S Garg","year":"2018","unstructured":"Garg, S., Hajiabadi, M., Mahmoody, M., Rahimi, A.: Registration-based encryption: removing private-key generator from IBE. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 689\u2013718. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_25"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Reyzin, L., Wee, H., Zhang, Z.: Pointproofs: aggregating proofs for multiple vector commitments. In: ACM CCS (2020)","DOI":"10.1145\/3372297.3417244"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Greenwald, S., Haueter, R., Alexander, S.: Seac. IRE 41(10) (1953)","DOI":"10.1109\/JRPROC.1953.274304"},{"key":"6_CR25","unstructured":"Merkle structures. Grin project (2024). https:\/\/docs.grin.mw\/wiki\/chain-state\/merkle-structures%28old%29\/"},{"key":"6_CR26","unstructured":"Herodotus. Herodotus Project (2024). https:\/\/docs.herodotus.dev\/herodotus-docs"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Karantaidou, I., Baldimtsi, F.: Efficient constructions of pairing based accumulators. In: IEEE CSF (2021)","DOI":"10.1109\/CSF51468.2021.00033"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-030-26948-7_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"RWF Lai","year":"2019","unstructured":"Lai, R.W.F., Malavolta, G.: Subvector commitments with application to succinct arguments. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 530\u2013560. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_19"},{"key":"6_CR29","unstructured":"Leung, D., Gilad, Y., Gorbunov, S., Reyzin, L., Zeldovich, N.: Aardvark: an asynchronous authenticated dictionary with applications to account-based cryptocurrencies. In: USENIX Security (2020)"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-72738-5_17","volume-title":"Applied Cryptography and Network Security","author":"J Li","year":"2007","unstructured":"Li, J., Li, N., Xue, R.: Universal accumulators with efficient nonmembership proofs. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 253\u2013269. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72738-5_17"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Liang, C., et al.: Study on data storage and verification methods based on improved Merkle mountain range in IoT scenarios. J. King Saud Univ.-Comput. Inf. Sci. 36(6) (2024)","DOI":"10.1016\/j.jksuci.2024.102117"},{"key":"6_CR32","unstructured":"Mahmoody, M., Qi, W.: Online mergers and applications to registration-based encryption and accumulators. In: 4th Conference on Information-Theoretic Cryptography (ITC 2023), pp. 15\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"6_CR33","doi-asserted-by":"publisher","unstructured":"Mahmoody, M., Qi, W., Rahimi, A.: Lower bounds for the number of decryption updates in registration-based encryption. In: Theory of Cryptography Conference, pp. 559\u2013587. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_20","DOI":"10.1007\/978-3-031-22318-1_20"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"RC Merkle","year":"1988","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369\u2013378. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_32"},{"key":"6_CR35","doi-asserted-by":"publisher","unstructured":"Miller, A., Hicks, M., Katz, J., Shi, E.: Authenticated data structures, generically. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201914, San Diego, CA, USA, 20\u201321 January 2014, pp. 411\u2013424. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535851","DOI":"10.1145\/2535838.2535851"},{"key":"6_CR36","unstructured":"Minima (2024). https:\/\/docs.minima.global\/docs\/about\/welcome"},{"issue":"1","key":"6_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462153.1462155","volume":"56","author":"M Naor","year":"2009","unstructured":"Naor, M., Rothblum, G.N.: The complexity of online memory checking. J. ACM (JACM) 56(1), 1\u201346 (2009)","journal-title":"J. ACM (JACM)"},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30574-3_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"L Nguyen","year":"2005","unstructured":"Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275\u2013292. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_19"},{"key":"6_CR39","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/s00453-014-9968-3","volume":"74","author":"C Papamanthou","year":"2016","unstructured":"Papamanthou, C., Tamassia, R., Triandopoulos, N.: Authenticated hash tables based on cryptographic accumulators. Algorithmica 74, 664\u2013712 (2016)","journal-title":"Algorithmica"},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-030-90456-2_16","volume-title":"Theory of Cryptography","author":"C Peikert","year":"2021","unstructured":"Peikert, C., Pepin, Z., Sharp, C.: Vector and functional commitments from lattices. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 480\u2013511. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_16"},{"key":"6_CR41","unstructured":"Picasso (2024). https:\/\/docs.picasso.network\/"},{"key":"6_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-319-44618-9_16","volume-title":"Security and Cryptography for Networks","author":"L Reyzin","year":"2016","unstructured":"Reyzin, L., Yakoubov, S.: Efficient asynchronous accumulators for distributed PKI. In: Zikas, V., De Prisco, R. (eds.) SCN 2016. LNCS, vol. 9841, pp. 292\u2013309. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44618-9_16"},{"key":"6_CR43","doi-asserted-by":"publisher","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Techn. J. 27(3), 379\u2013423 (1948). https:\/\/doi.org\/10.1002\/j.1538-7305.1948.tb01338.x. https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/j.1538-7305.1948.tb01338.x","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"6_CR44","unstructured":"Srinivasan, S., Chepurnoy, A., Papamanthou, C., Tomescu, A., Zhang, Y.: Hyperproofs: aggregating and maintaining proofs in vector commitments. In: 31st USENIX Security Symposium (USENIX Security 22), pp. 3001\u20133018 (2022)"},{"key":"6_CR45","unstructured":"Szepieniec, A., V\u00e6rge, T.: Neptune White Paper (2024). https:\/\/neptune.cash\/whitepaper\/"},{"key":"6_CR46","unstructured":"Tas, E.N., Boneh, D.: Vector commitments with efficient updates. In: AFT (2023)"},{"key":"6_CR47","unstructured":"Todd, P.: Merkle Mountain Ranges. OpenTimestamps (2013). https:\/\/github.com\/opentimestamps\/opentimestamps-server\/blob\/master\/doc\/merkle-mountain-range.md"},{"key":"6_CR48","unstructured":"Todd, P.: Making UTXO Set Growth Irrelevant With Low-Latency Delayed TXO Commitments. Bitcoin Devs mailing list (2016). https:\/\/lists.linuxfoundation.org\/pipermail\/bitcoin-dev\/2016-May\/012715.html"},{"key":"6_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-57990-6_3","volume-title":"Security and Cryptography for Networks","author":"A Tomescu","year":"2020","unstructured":"Tomescu, A., Abraham, I., Buterin, V., Drake, J., Feist, D., Khovratovich, D.: Aggregatable subvector commitments for stateless cryptocurrencies. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 45\u201364. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_3"},{"key":"6_CR50","doi-asserted-by":"crossref","unstructured":"Tomescu, A., Bhupatiraju, V., Papadopoulos, D., Papamanthou, C., Triandopoulos, N., Devadas, S.: Transparency logs via append-only authenticated dictionaries. In: ACM CCS (2019)","DOI":"10.1145\/3319535.3345652"},{"key":"6_CR51","unstructured":"Tomescu, A., Xia, Y., Newman, Z.: Authenticated dictionaries with cross-incremental proof (dis) aggregation. Cryptology ePrint Archive (2020)"},{"key":"6_CR52","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Fisch, B., Zitek, A., Bonneau, J., Tessaro, S.: VeRSA: verifiable registries with efficient client audits from rsa authenticated dictionaries. In: ACM CCS (2022)","DOI":"10.1145\/3548606.3560605"},{"key":"6_CR53","doi-asserted-by":"crossref","unstructured":"Wang, W., Lu, Y., Papamanthou, C., Zhang, F.: The locality of memory checking. In: ACM CCS (2023)","DOI":"10.1145\/3576915.3623195"},{"key":"6_CR54","unstructured":"Witness (2024). https:\/\/docs.witness.co\/"},{"key":"6_CR55","unstructured":"Xie, J.: Nervos CKB: a common knowledge base for crypto-economy. Nervos Netw. (2018)"}],"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-01878-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T15:13:55Z","timestamp":1757430835000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01878-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018779","9783032018786"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01878-6_6","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"}}]}}