{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:25:40Z","timestamp":1778127940659,"version":"3.51.4"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032019066","type":"print"},{"value":"9783032019073","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-01907-3_6","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:32Z","timestamp":1755383252000},"page":"161-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Breaking Verifiable Delay Functions in\u00a0the\u00a0Random Oracle Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-2779-7026","authenticated-orcid":false,"given":"Ziyi","family":"Guan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7892-1502","authenticated-orcid":false,"given":"Artur","family":"Riazanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9149-1842","authenticated-orcid":false,"given":"Weiqiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Abusalah, H.: Snacks for proof-of-space blockchains. IACR Cryptology ePrint Archive, Report 2023\/806 (2023)","DOI":"10.1007\/978-3-031-47751-5_1"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Abusalah, H., Cini, V.: An incremental posw for general weight distributions. In: Proceedings of the 42th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT\u00a0\u201923, pp. 282\u2013311 (2023)","DOI":"10.1007\/978-3-031-30617-4_10"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Abusalah, H., Fuchsbauer, G., Ga\u017ei, P., Klein, K.: Snacks: leveraging proofs of sequential work for blockchain light clients. In: Proceedings of the 28th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT\u00a0\u201922, pp. 806\u2013836 (2022)","DOI":"10.1007\/978-3-031-22963-3_27"},{"key":"6_CR4","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":"6_CR5","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, New York (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"6_CR6","unstructured":"Back, A.: Hashcash: a denial-of-service counter-measure (2002). http:\/\/www.hashcash.org\/papers\/hashcash.pdf, technical Memo"},{"key":"6_CR7","unstructured":"Barbara, A., Chiesa, A., Guan, Z.: Relativized succinct arguments in the ROM do not exist. Cryptology ePrint Archive, Paper 2024\/728 (2024). https:\/\/eprint.iacr.org\/2024\/728"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Berg, J.V.D., Kesten, H.: Inequalities with applications to percolation and reliability. J. Appl. Probab. 22(3), 556\u2013569 (1985). https:\/\/doi.org\/10.2307\/3213860","DOI":"10.2307\/3213860"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Bitansky, N., et al.: PPAD is as hard as LWE and iterated squaring. In: Proceedings of the 20th Theory of Cryptography Conference, TCC\u00a0\u201922, pp. 593\u2013622 (2022)","DOI":"10.1007\/978-3-031-22365-5_21"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Paneth, O., Rosen, A.: On the cryptographic hardness of finding a nash equilibrium. In: Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science, FOCS\u00a0\u201915, pp. 1480\u20131498 (2015)","DOI":"10.1109\/FOCS.2015.94"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Blum, M., Impagliazzo, R.: Generic oracles and oracle classes. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science, SFCS \u201987, pp. 118\u2013126. IEEE Computer Society (1987).https:\/\/doi.org\/10.1109\/SFCS.1987.30","DOI":"10.1109\/SFCS.1987.30"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 757\u2013788. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: A survey of two verifiable delay functions. IACR Cryptology ePrint Archive, Report 2018\/712 (2018)","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"6_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. LNCS, vol. 10821, pp. 451\u2013467. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_15"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"D\u00f6ttling, N., Garg, S., Malavolta, G., Vasudevan, P.: Tight verifiable delay functions. In: Proceedings of the 15th International Conference on Security and Cryptography for Networks, SCN \u201920, pp. 65\u201384 (2020)","DOI":"10.1007\/978-3-030-57990-6_4"},{"key":"6_CR16","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. LNCS, vol. 11477, pp. 292\u2013323. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_11"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_10"},{"key":"6_CR18","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. LNCS, vol. 12107, pp. 125\u2013154. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_5"},{"key":"6_CR19","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. LNCS, vol. 11921, pp. 248\u2013277. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_10"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Hall-Andersen, M., Nielsen, J.B.: On valiant\u2019s conjecture: impossibility of incrementally verifiable computation from random oracles. In: Proceedings of the 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT\u00a0\u201923 (2023)","DOI":"10.1007\/978-3-031-30617-4_15"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Hoffmann, C., Hub\u00e1\u010dek, P., Kamath, C., Kr\u0148\u00e1k, T.: (verifiable) delay functions from lucas sequences. In: Proceedings of the 20th Theory of Cryptography Conference, TCC\u00a0\u201923 (2023)","DOI":"10.1007\/978-3-031-48624-1_13"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Hub\u00e1\u010dek, P., Yogev, E.: Hardness of continuous local search: Query complexity and cryptographic lower bounds. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u00a0\u201917, pp. 1352\u20131371 (2017)","DOI":"10.1137\/1.9781611974782.88"},{"key":"6_CR24","series-title":"IFIP \u2014 The International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-0-387-35568-9_18","volume-title":"Secure Information Networks","author":"M Jakobsson","year":"1999","unstructured":"Jakobsson, M., Juels, A.: Proofs of work and bread pudding protocols (extended abstract). In: Preneel, B. (ed.) Secure Information Networks. ITIFIP, vol. 23, pp. 258\u2013272. Springer, Boston, MA (1999). https:\/\/doi.org\/10.1007\/978-0-387-35568-9_18"},{"key":"6_CR25","unstructured":"Juels, A., Brainard, J.: Client puzzles: a cryptographic defense against denial of service attacks. In: Proceedings of the 1999 Network and Distributed System Security Symposium (NDSS \u201999) (1999)"},{"issue":"2","key":"6_CR26","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1017\/S0963548310000465","volume":"20","author":"J Kahn","year":"2011","unstructured":"Kahn, J., Saks, M., Smyth, C.: The dual bkr inequality and rudich\u2019s conjecture. Comb. Probabil. Comput. 20(2), 257\u2013266 (2011). https:\/\/doi.org\/10.1017\/S0963548310000465","journal-title":"Comb. Probabil. Comput."},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Li, F., Mittal, P., Caesar, M., Borisov, N.: Sybilcontrol: practical sybil defense with computational puzzles. In: Proceedings of the Seventh ACM Workshop on Scalable Trusted Computing, STC \u201912, pp. 67\u201378. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2382536.2382548","DOI":"10.1145\/2382536.2382548"},{"key":"6_CR28","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":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-22792-9_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"M Mahmoody","year":"2011","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.: Time-lock puzzles in the random oracle model. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 39\u201350. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_3"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.: Publicly verifiable proofs of sequential work. In: Proceedings of the 4th Innovations in Theoretical Computer Science Conference, ITCS\u00a0\u201913, pp. 373\u2013388 (2013)","DOI":"10.1145\/2422436.2422479"},{"key":"6_CR31","unstructured":"Mahmoody, M., Smith, C., Wu, D.J.: Can verifiable delay functions be based on random oracles? In: Proceedings of the 47th International Colloquium on Automata, Languages and Programming, ICALP\u00a0\u201920, pp. 83:1\u201383:17 (2020)"},{"key":"6_CR32","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"6_CR33","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: Proceedings of the 10rd Innovations in Theoretical Computer Science Conference, ITCS\u00a0\u201919, pp. 60:1\u201360:15 (2019)"},{"key":"6_CR34","doi-asserted-by":"publisher","unstructured":"Reimer, D.: Proof of the van den berg\u2013kesten conjecture. Comb. Probab. Comput. 9(1), 27\u201332 (2000). https:\/\/doi.org\/10.1017\/S0963548399004113","DOI":"10.1017\/S0963548399004113"},{"key":"6_CR35","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical report (1996)"},{"key":"6_CR36","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":"6_CR37","unstructured":"Rudich, S.: Limits on the provable consequences of one-way functions. Technical report (1988)"},{"key":"6_CR38","doi-asserted-by":"publisher","unstructured":"Smyth, C.: Reimer\u2019s inequality and tardos\u2019 conjecture. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, STOC \u201902, pp. 218\u2013221. Association for Computing Machinery, New York (2002).https:\/\/doi.org\/10.1145\/509907.509942","DOI":"10.1145\/509907.509942"},{"key":"6_CR39","unstructured":"StarkWare Industries: Presenting: VeeDo (2020). https:\/\/medium.com\/starkware\/presenting-veedo-e4bbff77c7ae"},{"key":"6_CR40","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":"6_CR41","doi-asserted-by":"crossref","unstructured":"Wesolowski, B.: Efficient verifiable delay functions, p.\u00a0623 (2019)","DOI":"10.1007\/978-3-030-17659-4_13"}],"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-01907-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:37Z","timestamp":1755383257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01907-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019066","9783032019073"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01907-3_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"}}]}}