{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:13:07Z","timestamp":1778087587058,"version":"3.51.4"},"publisher-location":"Cham","reference-count":40,"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_1","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:34:18Z","timestamp":1778085258000},"page":"3-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Impossibility of\u00a0VDFs in\u00a0the\u00a0ROM: The Complete Picture"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7524-3133","authenticated-orcid":false,"given":"Hamza","family":"Abusalah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9303-750X","authenticated-orcid":false,"given":"Karen","family":"Azari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6812-7317","authenticated-orcid":false,"given":"Chethan","family":"Kamath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2283-4829","authenticated-orcid":false,"given":"Erkan","family":"Tairi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maximilian von","family":"Consbruch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"1_CR1","unstructured":"Abram, D., Roy, L., Simkin, M.: Time-based cryptography from weaker assumptions: randomness beacons, delay functions and more. Cryptology ePrint Archive, Report 2024\/769"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Abusalah, H.: On graphs of incremental proofs of sequential work. In: PKC\u00a02025, Part\u00a0V","DOI":"10.1007\/978-3-031-91832-2_7"},{"key":"1_CR3","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":"1_CR4","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 (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_27","DOI":"10.1007\/978-3-031-22963-3_27"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-17656-3_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"H Abusalah","year":"2019","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, pp. 277\u2013291. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_10"},{"key":"1_CR6","unstructured":"Alwen, J., Serbinenko, V.: High parallel complexity graphs and memory-hard functions. In: 47th ACM STOC"},{"key":"1_CR7","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":"1_CR8","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM CCS 93"},{"key":"1_CR9","doi-asserted-by":"publisher","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 2022, Part II. LNCS, vol 13748. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-22365-5_21","DOI":"10.1007\/978-3-031-22365-5_21"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-84259-8_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"AR Block","year":"2021","unstructured":"Block, 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, pp. 123\u2013152. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_5"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Jajodia, S., Samarati, P., Yung, M. (eds.) Encyclopedia of Cryptography, Security and Privacy, Part I. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-71522-9_1664","DOI":"10.1007\/978-3-030-71522-9_1664"},{"key":"1_CR12","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":"1_CR13","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 (2023)","DOI":"10.1007\/978-3-031-38545-2_3"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-319-78375-8_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Cohen","year":"2018","unstructured":"Cohen, B., Pietrzak, K.: Simple proofs of sequential work. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part II. LNCS, vol. 10821, pp. 451\u2013467. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_15"},{"key":"1_CR15","unstructured":"Cohen, B., Pietrzak, K.: The chia network blockchain. https:\/\/www.chia.net\/wp-content\/uploads\/2022\/07\/ChiaGreenPaper.pdf. Accessed 28 Aug 2025"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-34578-5_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"L De Feo","year":"2019","unstructured":"De Feo, L., Masson, S., Petit, C., Sanso, A.: Verifiable delay functions from supersingular isogenies and pairings. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part I. LNCS, vol. 11921, pp. 248\u2013277. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_10"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-030-57990-6_4","volume-title":"Security and Cryptography for Networks","author":"N D\u00f6ttling","year":"2020","unstructured":"D\u00f6ttling, N., Garg, S., Malavolta, G., Vasudevan, P.N.: Tight verifiable delay functions. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 65\u201384. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_4"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-030-17656-3_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"N D\u00f6ttling","year":"2019","unstructured":"D\u00f6ttling, N., Lai, R.W.F., Malavolta, G.: Incremental proofs of sequential work. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part II. LNCS, vol. 11477, pp. 292\u2013323. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_11"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-030-45727-3_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"N Ephraim","year":"2020","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: Continuous verifiable delay functions. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part III. LNCS, vol. 12107, pp. 125\u2013154. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_5"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-030-45721-1_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"N Ephraim","year":"2020","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: SPARKs: succinct parallelizable arguments of knowledge. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 707\u2013737. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_25"},{"key":"1_CR21","unstructured":"Goldschlag, D.M., Stubblebine, S.G.: Publicly verifiable lotteries: applications of delaying functions. In: FC\u201998"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Guan, Z., Riazanov, A., Yuan, W.: Breaking verifiable delay functions in the random oracle model. In: In: Tauman Kalai, Y., Kamara, S.F. (eds.) CRYPTO 2025, Part\u00a0VII. LNCS, vol. 16006. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01907-3_6","DOI":"10.1007\/978-3-032-01907-3_6"},{"key":"1_CR23","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\u00a02022, Part\u00a0II. 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":"1_CR24","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\u00a02023, Part\u00a0IV. LNCS, vol. 14372. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-48624-1_13","DOI":"10.1007\/978-3-031-48624-1_13"},{"key":"1_CR25","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: 21st ACM STOC"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-030-92518-5_26","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2021","author":"S Jaques","year":"2021","unstructured":"Jaques, S., Montgomery, H., Rosie, R., Roy, A.: Time-release cryptography from\u00a0minimal circuit assumptions. In: Adhikari, A., K\u00fcsters, R., Preneel, B. (eds.) INDOCRYPT 2021. LNCS, vol. 13143, pp. 584\u2013606. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92518-5_26"},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Lai, R.W.F., Malavolta, G.: Lattice-based timed cryptography. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V 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":"1_CR28","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":"1_CR29","unstructured":"Lenstra, A.K., Wesolowski, B.: A random zoo: sloth, unicorn, and trx. Cryptology ePrint Archive, Report 2015\/366"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/978-3-030-56877-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"A Lombardi","year":"2020","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, pp. 632\u2013651. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_22"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.P.: Time-lock puzzles in the random oracle model. In: CRYPTO\u00a02011","DOI":"10.1007\/978-3-642-22792-9_3"},{"key":"1_CR32","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":"1_CR33","unstructured":"Mahmoody, M., Smith, C., Wu, D.J.: Can verifiable delay functions be based on random oracles? In: ICALP 2020"},{"key":"1_CR34","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":"1_CR35","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: ITCS 2019"},{"key":"1_CR36","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Tech. rep., USA"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-45727-3_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"L Rotem","year":"2020","unstructured":"Rotem, L., Segev, G., Shahaf, I.: Generic-group delay functions require hidden-order groups. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 155\u2013180. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_6"},{"key":"1_CR38","unstructured":"Rudich, S.: Limits on the provable consequences of one-way functions. Tech. rep., USA"},{"key":"1_CR39","unstructured":"StarkWare: Veed. https:\/\/medium.com\/starkware\/presenting-veedo-e4bbff77c7ae. Accessed 28 Aug 2025"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-17659-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Wesolowski","year":"2019","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 379\u2013407. Springer, Cham (2019). https:\/\/doi.org\/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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:34:30Z","timestamp":1778085270000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25330-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253293","9783032253309"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25330-9_1","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"}}]}}