{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T02:12:27Z","timestamp":1771899147970,"version":"3.50.1"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031918193","type":"print"},{"value":"9783031918209","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-031-91820-9_2","type":"book-chapter","created":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T06:01:50Z","timestamp":1746597710000},"page":"36-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Watermarkable and\u00a0Zero-Knowledge Verifiable Delay Functions from\u00a0Any Proof of\u00a0Exponentiation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2027-5549","authenticated-orcid":false,"given":"Charlotte","family":"Hoffmann","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"key":"2_CR1","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":"2_CR2","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\u00a02022, Part\u00a0III. LNCS, vol. 13793, pp. 487\u2013516. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_17","DOI":"10.1007\/978-3-031-22969-5_17"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1007\/978-3-662-53890-6_30","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"F Baldimtsi","year":"2016","unstructured":"Baldimtsi, F., Kiayias, A., Zacharias, T., Zhang, B.: Indistinguishable proofs of work or knowledge. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 902\u2013933. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_30"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1090\/S0025-5718-06-01849-7","volume":"76","author":"D Bernstein","year":"2007","unstructured":"Bernstein, D., Sorenson, J.: Modular exponentiation via the explicit Chinese remainder theorem. Math. Comput. 76, 443\u2013454 (2007)","journal-title":"Math. Comput."},{"key":"2_CR5","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":"2_CR6","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":"2_CR7","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: A survey of two verifiable delay functions. Cryptology ePrint Archive, Report 2018\/712 (2018). https:\/\/eprint.iacr.org\/2018\/712"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"D Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 236\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_15"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BFb0052255","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"R Canetti","year":"1997","unstructured":"Canetti, R.: Towards realizing random oracles: hash functions that hide all partial information. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 455\u2013469. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052255"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"D Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89\u2013105. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_7"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-99277-4_21","volume-title":"Selected Areas in Cryptography","author":"J Chavez-Saab","year":"2022","unstructured":"Chavez-Saab, J., Rodr\u00edguez-Henr\u00edquez, F., Tibouchi, M.: Verifiable isogeny walks: towards an isogeny-based postquantum VDF. In: AlTawy, R., H\u00fclsing, A. (eds.) Selected Areas in Cryptography, pp. 441\u2013460. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99277-4_21"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Cini, V., Lai, R.W.F., Malavolta, G.: Lattice-based succinct arguments from vanishing polynomials - (extended abstract). In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part II. LNCS, vol. 14082, pp. 72\u2013105. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_3","DOI":"10.1007\/978-3-031-38545-2_3"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-32946-3_28","volume-title":"Financial Cryptography and Data Security","author":"J Clark","year":"2012","unstructured":"Clark, J., Essex, A.: CommitCoin: carbon dating commitments with bitcoin. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol. 7397, pp. 390\u2013398. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32946-3_28"},{"key":"2_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":"2_CR15","unstructured":"Colburn, M.: Short-lived signatures. Master\u2019s thesis, Concordia University (2018)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-319-56614-6_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"G Couteau","year":"2017","unstructured":"Couteau, G., Peters, T., Pointcheval, D.: Removing the strong RSA assumption from arguments over the integers. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 321\u2013350. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_11"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"R Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174\u2013187. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_19"},{"key":"2_CR18","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":"2_CR19","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., 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":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-38898-4_22","volume-title":"Information Security and Cryptology","author":"H Ferradi","year":"2016","unstructured":"Ferradi, H., G\u00e9raud, R., Naccache, D.: Slow motion zero knowledge identifying with colliding commitments. In: Lin, D., Wang, X.F., Yung, M. (eds.) Inscrypt 2015. LNCS, vol. 9589, pp. 381\u2013396. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-38898-4_22"},{"key":"2_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":"2_CR22","doi-asserted-by":"crossref","unstructured":"Fischlin, R., Schnorr, C.P.: Stronger security proofs for RSA and Rabin bits. J. Cryptol. 13(2), 221\u2013244 (2000)","DOI":"10.1007\/s001459910008"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Freitag, C., Pass, R., Sirkin, N.: Parallelizable delegation from LWE. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0II. LNCS, vol. 13748, pp. 623\u2013652. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_22","DOI":"10.1007\/978-3-031-22365-5_22"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/0-387-34799-2_16","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"LC Guillou","year":"1990","unstructured":"Guillou, L.C., Quisquater, J.-J.: A \u201cParadoxical\u2019\u2019 indentity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 216\u2013231. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_16"},{"key":"2_CR25","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, pp. 370\u2013399. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_13","DOI":"10.1007\/978-3-031-15979-4_13"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Hoffmann, C., Hub\u00e1cek, P., Kamath, C., Pietrzak, K.: Certifying giant nonprimes. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0I. LNCS, vol. 13940, pp. 530\u2013553. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_19","DOI":"10.1007\/978-3-031-31368-4_19"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Hoffmann, C., Hub\u00e1\u010dek, P., Kamath, C., Kr\u0148\u00e1k, T.: (Verifiable) delay functions from Lucas sequences. In: Rothblum, G.N., Wee, H. (eds.) TCC 2023, Part IV. LNCS, vol. 14372, pp. 336\u2013362. 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_CR28","unstructured":"Hoffmann, C., Hub\u00e1\u010dek, P., Ivanova, S.: Practical batch proofs of exponentiation. Cryptology ePrint Archive, Paper 2024\/145 (2024). https:\/\/eprint.iacr.org\/2024\/145"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-03356-8_37","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"D Hofheinz","year":"2009","unstructured":"Hofheinz, D., Kiltz, E.: The group of signed quadratic residues and applications. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 637\u2013653. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_37"},{"key":"2_CR30","unstructured":"Khovratovich, D., Maller, M., Tiwari, P.R.: MinRoot: candidate sequential function for Ethereum VDF. Cryptology ePrint Archive, Report 2022\/1626 (2022). https:\/\/eprint.iacr.org\/2022\/1626"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-540-24676-3_34","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"A Kiayias","year":"2004","unstructured":"Kiayias, A., Tsiounis, Y., Yung, M.: Traceable signatures. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 571\u2013589. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_34"},{"key":"2_CR32","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, pp. 782\u2013804. 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_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-030-51280-4_29","volume-title":"Financial Cryptography and Data Security","author":"E Landerreche","year":"2020","unstructured":"Landerreche, E., Stevens, M., Schaffner, C.: Non-interactive cryptographic timestamping based on verifiable delay\u00a0functions. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 541\u2013558. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_29"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Lenstra, A.K., Wesolowski, B.: Trustworthy public randomness with sloth, unicorn, and TRX. Int. J. Appl. Cryptogr. 3(4), 330\u2013343 (2017). https:\/\/doi.org\/10.1504\/IJACT.2017.10010315","DOI":"10.1504\/IJACT.2017.10010315"},{"key":"2_CR35","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":"2_CR36","doi-asserted-by":"crossref","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.P.: Publicly verifiable proofs of sequential work. In: Kleinberg, R.D. (ed.) ITCS 2013: 4th Innovations in Theoretical Computer Science, pp. 373\u2013388. Association for Computing Machinery, Berkeley, CA, USA, 9\u201312 January 2013","DOI":"10.1145\/2422436.2422479"},{"key":"2_CR37","unstructured":"Mahmoody, M., Smith, C., Wu, D.J.: Can verifiable delay functions be based on random oracles? In: Czumaj, A., Dawar, A., Merelli, E. (eds.) ICALP 2020: 47th International Colloquium on Automata, Languages and Programming. LIPIcs, vol. 168, pp. 83:1\u201383:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Saarbr\u00fccken, Germany, 8\u201311 July 2020"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-030-26948-7_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"G Malavolta","year":"2019","unstructured":"Malavolta, G., Thyagarajan, S.: Homomorphic time-lock puzzles and applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 620\u2013649. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_22"},{"key":"2_CR39","unstructured":"May, T.C.: Timed-release crypto (1994)"},{"key":"2_CR40","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: Blum, A. (ed.) ITCS 2019: 10th Innovations in Theoretical Computer Science Conference. vol. 124, pp. 60:1\u201360:15. LIPIcs, San Diego, CA, USA, 10\u201312 January 2019"},{"issue":"2","key":"2_CR41","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27","author":"MO Rabin","year":"1983","unstructured":"Rabin, M.O.: Transaction protection by beacons. J. Comput. Syst. Sci. 27(2), 256\u2013267 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR42","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical report, Massachusetts Institute of Technology (1996)"},{"key":"2_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-030-90456-2_13","volume-title":"Theory of Cryptography","author":"L Rotem","year":"2021","unstructured":"Rotem, L.: Simple and efficient batch verification techniques for verifiable delay functions. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 382\u2013414. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_13"},{"key":"2_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-030-56877-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"L Rotem","year":"2020","unstructured":"Rotem, L., Segev, G.: Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 481\u2013509. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_17"},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"Schindler, P., Judmayer, A., Hittmeir, M., Stifter, N., Weippl, E.R.: RandRunner: distributed randomness from trapdoor VDFs with strong uniqueness. In: ISOC Network and Distributed System Security Symposium \u2013 NDSS\u00a02021. The Internet Society, Virtual, 21\u201325 February 2021","DOI":"10.14722\/ndss.2021.24116"},{"issue":"3","key":"2_CR46","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161\u2013174 (1991). https:\/\/doi.org\/10.1007\/BF00196725","journal-title":"J. Cryptol."},{"key":"2_CR47","unstructured":"Segal, K., Brand, T.: Presenting: VeeDo a STARK-based VDF service. Technical report, StarkWare (2019). https:\/\/medium.com\/starkware\/presenting-veedo-e4bbff77c7ae"},{"key":"2_CR48","unstructured":"Shani, B.: A note on isogeny-based hybrid verifiable delay functions. Cryptology ePrint Archive, Paper 2019\/205 (2019). https:\/\/eprint.iacr.org\/2019\/205"},{"key":"2_CR49","unstructured":"Specter, M.A., Park, S., Green, M.: KeyForge: non-attributable email from forward-forgeable signatures. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021: 30th USENIX Security Symposium, pp. 1755\u20131773. USENIX Association, 11\u201313 August 2021"},{"key":"2_CR50","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","Public-Key Cryptography \u2013 PKC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91820-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T06:02:00Z","timestamp":1746597720000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91820-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031918193","9783031918209"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91820-9_2","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":"5 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"R\u00f8ros","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}