{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:44:11Z","timestamp":1780069451882,"version":"3.54.0"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253293","type":"print"},{"value":"9783032253309","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-25330-9_2","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:31:38Z","timestamp":1778085098000},"page":"33-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Separating Verifiable Delay Functions and\u00a0Time-Lock Puzzles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7524-3133","authenticated-orcid":false,"given":"Hamza","family":"Abusalah","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nivesh","family":"Aggarwal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9303-750X","authenticated-orcid":false,"given":"Karen","family":"Azari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6812-7317","authenticated-orcid":false,"given":"Chethan","family":"Kamath","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maximilian","family":"von Consbruch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Abusalah, H.: SNACKs for proof-of-space blockchains. In: Baldimtsi, F., Cachin, C. (eds) FC 2023. LNCS, vol. 13951. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-47751-5_1","DOI":"10.1007\/978-3-031-47751-5_1"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Abusalah, H.: On graphs of incremental proofs of sequential work. In: Jager, T., Pan, J. (eds) PKC 2025. LNCS, vol. 15678. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91832-2_7","DOI":"10.1007\/978-3-031-91832-2_7"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Abusalah, H., Avitabile, G.: Black-box timed commitments from time-lock puzzles. In: Boyle, E., Mahmoody, M. (eds.) TCC 2024. LNCS, vol. 15366. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-78020-2_16","DOI":"10.1007\/978-3-031-78020-2_16"},{"key":"2_CR4","unstructured":"Abusalah, H., Azari, K., Fiore, D., Kamath, C., Tairi, E.: On verifiable delay functions from time-lock puzzles. Cryptology ePrint Archive, Paper 2025\/1782"},{"key":"2_CR5","unstructured":"Abusalah, H., Azari, K., Kamath, C., Tairi, E., von Consbruch, M.: Impossibility of VDFs in the ROM: The complete picture. Cryptology ePrint Archive, Paper 2025\/1773"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Abusalah, H., Cini, V.: An incremental PoSW for general weight distributions. In: EUROCRYPT\u00a02023, Part\u00a0II","DOI":"10.1007\/978-3-031-30617-4_10"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Abusalah, H., Fuchsbauer, G., Gazi, P., Klein, K.: SNACKs: leveraging proofs of sequential work for blockchain light clients. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13791. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-22963-3_27","DOI":"10.1007\/978-3-031-22963-3_27"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Abusalah, H., Kamath, C., Klein, K., Pietrzak, K., Walter, M.: Reversible proofs of sequential work. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_10","DOI":"10.1007\/978-3-030-17656-3_10"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Malavolta, G., Zhang, T.: Time-lock puzzles from lattices. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCs, vol. 14922. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_13","DOI":"10.1007\/978-3-031-68382-4_13"},{"key":"2_CR10","unstructured":"Armknecht, F., Barman, L., Bohli, J.M., Karame, G.O.: Mirror: enabling proofs of data replication and retrievability in the cloud. In: USENIX Security 2016"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Arun, A., Bonneau, J., Clark, J.: Short-lived zero-knowledge proofs and signatures. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13793. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_17","DOI":"10.1007\/978-3-031-22969-5_17"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: TARDIS: a foundation of time-lock puzzles in UC. In: Canteaut, A., Standaert, FX. (eds) EUROCRYPT 2021, LNCS, vol. 12698. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_15","DOI":"10.1007\/978-3-030-77883-5_15"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Choudhuri, A.R., Holmgren, J., Kamath, C., Lombardi, A., Paneth, O., Rothblum, R.D.: PPAD is as hard as LWE and iterated squaring. In: TCC\u00a02022, Part\u00a0II","DOI":"10.1007\/978-3-031-22365-5_21"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Garg, R.: Succinct randomized encodings from laconic function evaluation, faster and simpler. In: EUROCRYPT\u00a02025, Part\u00a0VII","DOI":"10.1007\/978-3-031-91098-2_15"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Goldwasser, S., Jain, A., Paneth, O., Vaikuntanathan, V., Waters, B.: Time-lock puzzles from randomized encodings. In: ITCS 2016","DOI":"10.1145\/2840728.2840745"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"lock, A.R., Holmgren, J., Rosen, A., Rothblum, R.D., Soni, P.: Time- and space-efficient arguments from groups of unknown order. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828 (2021). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-84259-8_5","DOI":"10.1007\/978-3-030-84259-8_5"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: CRYPTO\u00a02018, Part\u00a0I","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (eds) CRYPTO 2000. LNCS, vol. 1880. Springer, Berlin, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_15","DOI":"10.1007\/3-540-44598-6_15"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-36033-7_16","DOI":"10.1007\/978-3-030-36033-7_16"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Ch\u00e1vez-Saab, J., Rodr\u00edguez-Henr\u00edquez, F., Tibouchi, M.: Verifiable isogeny walks: towards an isogeny-based postquantum VDF. In: SAC 2021","DOI":"10.1007\/978-3-030-99277-4_21"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Chvojka, P., Jager, T.: Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments. In: Boldyreva, A., Kolesnikov, V. (eds) PKC 2023. LNCS, vol. 13940. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-31368-4_18","DOI":"10.1007\/978-3-031-31368-4_18"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Chvojka, P., Jager, T., Slamanig, D., Striecks, C.: Versatile and sustainable timed-release encryption and sequential time-lock puzzles (Extended Abstract). In: Bertino, E., Shulman, H., Waidner, M. (eds.) ESORICS 2021. LNCS, vol. 12973. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88428-4_4","DOI":"10.1007\/978-3-030-88428-4_4"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Cini, V., Lai, R.W.F., Malavolta, G.: Lattice-based succinct arguments from vanishing polynomials - (extended abstract). In: CRYPTO\u00a02023, Part\u00a0II","DOI":"10.1007\/978-3-031-38545-2_3"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Cohen, B., Pietrzak, K.: Simple proofs of sequential work. In: Nielsen, J., Rijmen, V. (eds) EUROCRYPT 2018. LNCS, vol. 10821. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_15","DOI":"10.1007\/978-3-319-78375-8_15"},{"key":"2_CR25","unstructured":"Cohen, B., Pietrzak, K.: The chia network blockchain. https:\/\/www.chia.net\/wp-content\/uploads\/2022\/07\/ChiaGreenPaper.pdf Accessed 28 August 2025"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"De Feo, L., Masson, S., Petit, C., Sanso, A.: Verifiable delay functions from supersingular isogenies and pairings. In: Galbraith, S., Moriai, S. (eds) ASIACRYPT 2019. LNCS, vol. 11921. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_10","DOI":"10.1007\/978-3-030-34578-5_10"},{"key":"2_CR27","unstructured":"D\u00f6ttling, N., Garg, S., Malavolta, G., Vasudevan, P.N.: Tight verifiable delay functions. In: SCN 20"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Lai, R.W.F., Malavolta, G.: incremental proofs of sequential work. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS. vol. 11477. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_11","DOI":"10.1007\/978-3-030-17656-3_11"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Dujmovic, J., Garg, R., Malavolta, G.: Time-lock puzzles with efficient batch solving. In: Joye, M., Leander, G. (eds) EUROCRYPT 2024. LNCS, vol. 14652. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_11","DOI":"10.1007\/978-3-031-58723-8_11"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: Continuous verifiable delay functions. In: Canteaut, A., Ishai, Y. (eds) EUROCRYPT 2020. LNCS. vol. 12107. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_5","DOI":"10.1007\/978-3-030-45727-3_5"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: SPARKs: succinct parallelizable arguments of knowledge. In: Canteaut, A., Ishai, Y. (eds) EUROCRYPT 2020. LNCS. vol.12105. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_25","DOI":"10.1007\/978-3-030-45721-1_25"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Freitag, C., Komargodski, I., Pass, R., Sirkin, N.: Non-malleable time-lock puzzles and applications. In: Nissim, K., Waters, B. (eds.) Theory of Cryptography. TCC 2021. LNCS. vol. 13044. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_15","DOI":"10.1007\/978-3-030-90456-2_15"},{"key":"2_CR33","unstructured":"Garay, J.A., MacKenzie, P.D., Prabhakaran, M., Yang, K.: Resource fairness and composability of cryptographic protocols. Journal of Cryptology"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Guan, Z., Riazanov, A., Yuan, W.: Breaking verifiable delay functions in the random oracle model. In: CRYPTO\u00a02025, Part\u00a0VII","DOI":"10.1007\/978-3-032-01907-3_6"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Hoffmann, C., Hub\u00e1cek, P., Kamath, C., Klein, K., Pietrzak, K.: Practical statistically-sound proofs of exponentiation in any group. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_13","DOI":"10.1007\/978-3-031-15979-4_13"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Hoffmann, C., Hub\u00e1cek, P., Kamath, C., Krn\u00e1k, T.: (Verifiable) delay functions from lucas sequences. In: Rothblum, G., Wee, H. (eds.) TCC 2023. LNCS, vol. 14372. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_13","DOI":"10.1007\/978-3-031-48624-1_13"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Jaques, S., Montgomery, H., Rosie, R., Roy, A.: Time-release cryptography from minimal circuit assumptions. In: Adhikari, A., K\u00fcsters, R., Preneel, B. (eds.) INDOCRYPT 2021. LNCS, vol. 13143. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92518-5_26","DOI":"10.1007\/978-3-030-92518-5_26"},{"key":"2_CR38","doi-asserted-by":"publisher","unstructured":"Katz, J., Loss, J., Xu, J.: On the security of time-lock puzzles and timed commitments. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS. vol. 12552. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_14","DOI":"10.1007\/978-3-030-64381-2_14"},{"key":"2_CR39","doi-asserted-by":"publisher","unstructured":"Lai, R.W.F., Malavolta, G.: Lattice-based timed cryptography. In: Handschuh, H., Lysyanskaya, A. (eds) CRYPTO 2023. LNCS, vol. 14085. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_25","DOI":"10.1007\/978-3-031-38554-4_25"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Landerreche, E., Stevens, M., Schaffner, C.: Non-interactive cryptographic timestamping based on verifiable delay functions. In: FC 2020","DOI":"10.1007\/978-3-030-51280-4_29"},{"key":"2_CR41","unstructured":"Lenstra, A.K., Wesolowski, B.: A random zoo: sloth, unicorn, and trx. Cryptology ePrint Archive, Report 2015\/366"},{"key":"2_CR42","doi-asserted-by":"publisher","unstructured":"Lombardi, A., Vaikuntanathan, V.: Fiat-shamir for repeated squaring with applications to PPAD-hardness and VDFs. In: Micciancio, D., Ristenpart, T. (eds) CRYPTO 2020. LNCS, vol. 12172. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_22","DOI":"10.1007\/978-3-030-56877-1_22"},{"key":"2_CR43","doi-asserted-by":"publisher","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.P.: Time-lock puzzles in the random oracle model. In: Rogaway, P. (eds) CRYPTO 2011. LNCS, vol. 6841. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_3","DOI":"10.1007\/978-3-642-22792-9_3"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.P.: Publicly verifiable proofs of sequential work. In: ITCS 2013","DOI":"10.1145\/2422436.2422479"},{"key":"2_CR45","unstructured":"Mahmoody, M., Smith, C., Wu, D.J.: Can verifiable delay functions be based on random oracles? In: ICALP 2020"},{"key":"2_CR46","doi-asserted-by":"publisher","unstructured":"Malavolta, G., Thyagarajan, S.A.K.: Homomorphic time-lock puzzles and applications. In: Boldyreva, A., Micciancio, D. (eds) CRYPTO 2019. LNCS, vol 11692. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_22","DOI":"10.1007\/978-3-030-26948-7_22"},{"key":"2_CR47","doi-asserted-by":"crossref","unstructured":"Osadnik, M., Kaviani, D., Cini, V., Lai, R.W.F., Malavolta, G.: Papercraft: lattice-based verifiable delay function implemented. In: 2025 IEEE Symposium on Security and Privacy","DOI":"10.1109\/SP61157.2025.00159"},{"key":"2_CR48","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: ITCS 2019"},{"key":"2_CR49","doi-asserted-by":"crossref","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.P.: Notions of reducibility between cryptographic primitives. In: TCC\u00a02004","DOI":"10.1007\/978-3-540-24638-1_1"},{"key":"2_CR50","unstructured":"Renawi, O.: Time-lock puzzles from verifiable delay functions and witness encryption. Bachelor Thesis, University of Saarland, Germany (2020). https:\/\/doi.org\/10.60882\/cispa.30866072 Acessed 18 Feb 2026"},{"key":"2_CR51","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Tech. rep., USA"},{"key":"2_CR52","doi-asserted-by":"publisher","unstructured":"Srinivasan, S., Loss, J., Malavolta, G., Nayak, K., Papamanthou, C., Thyagarajan, S.A.K.: Transparent batchable time-lock puzzles and applications to byzantine consensus. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023. LNCS, vol. 13940. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_20","DOI":"10.1007\/978-3-031-31368-4_20"},{"key":"2_CR53","unstructured":"StarkWare: Veedo. https:\/\/medium.com\/starkware\/presenting-veedo-e4bbff77c7ae Accessed 28 August 28 2025"},{"key":"2_CR54","doi-asserted-by":"crossref","unstructured":"Thyagarajan, S.A.K., Castagnos, G., Laguillaumie, F., Malavolta, G.: Efficient CCA timed commitments in class groups. In: ACM CCS 2021","DOI":"10.1145\/3460120.3484773"},{"key":"2_CR55","doi-asserted-by":"crossref","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: EUROCRYPT\u00a02019, Part\u00a0III","DOI":"10.1007\/978-3-030-17659-4_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25330-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:31:53Z","timestamp":1778085113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25330-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253293","9783032253309"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25330-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","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":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}