{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T02:14:22Z","timestamp":1773022462826,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T00:00:00Z","timestamp":1599609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T00:00:00Z","timestamp":1599609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s00145-020-09364-x","type":"journal-article","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T09:54:13Z","timestamp":1599731653000},"page":"2113-2147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["Efficient Verifiable Delay Functions"],"prefix":"10.1007","volume":"33","author":[{"given":"Benjamin","family":"Wesolowski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,9]]},"reference":[{"key":"9364_CR1","unstructured":"M.\u00a0Bellare and S.\u00a0Goldwasser. Encapsulated key escrow. Technical report, 1996."},{"key":"9364_CR2","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare and S.\u00a0Goldwasser. Verifiable partial key escrow. In Proceedings of the 4th ACM Conference on Computer and Communications Security, CCS \u201997, pages 78\u201391, New York, NY, USA, 1997. ACM.","DOI":"10.1145\/266420.266439"},{"issue":"3","key":"9364_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1014927327846","volume":"25","author":"I Biehl","year":"2002","unstructured":"I.\u00a0Biehl, J.\u00a0Buchmann, S.\u00a0Hamdy, and A.\u00a0Meyer. A signature scheme based on the intractability of computing roots. Designs, Codes and Cryptography, 25(3):223\u2013236, 2002.","journal-title":"Designs, Codes and Cryptography"},{"key":"9364_CR4","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, J.\u00a0Bonneau, B.\u00a0B\u00fcnz, and B.\u00a0Fisch. Verifiable delay functions. In E.\u00a0F. Brickell, editor, Advances in Cryptology \u2013 CRYPTO 2018, pages 757\u2013788. Springer, 2018.","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"9364_CR5","unstructured":"D.\u00a0Boneh, B.\u00a0B\u00fcnz, and B.\u00a0Fisch. A survey of two verifiable delay functions. Cryptology ePrint Archive, Report 2018\/712, 2018. https:\/\/eprint.iacr.org\/2018\/712."},{"key":"9364_CR6","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, B.\u00a0B\u00fcnz, and B.\u00a0Fisch. Batching techniques for accumulators with applications to iops and stateless blockchains. In A.\u00a0Boldyreva and D.\u00a0Micciancio, editors, Advances in Cryptology \u2013 CRYPTO 2019, volume 11692 of Lecture Notes in Computer Science, pages 561\u2013586. Springer, 2019.","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"9364_CR7","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh and M.\u00a0Franklin. Efficient generation of shared RSA keys. In Annual International Cryptology Conference, pages 425\u2013439. Springer, 1997.","DOI":"10.1007\/BFb0052253"},{"key":"9364_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 - CRYPTO 2000","author":"D Boneh","year":"2000","unstructured":"D.\u00a0Boneh and M.\u00a0Naor. Timed commitments. In M.\u00a0Bellare, editor, Advances in Cryptology \u2013 CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 236\u2013254. Springer Berlin Heidelberg, 2000."},{"key":"9364_CR9","doi-asserted-by":"crossref","unstructured":"J.\u00a0Buchmann and S.\u00a0Hamdy. A survey on IQ cryptography. In In Proceedings of Public Key Cryptography and Computational Number Theory, pages 1\u201315, 2001.","DOI":"10.1515\/9783110881035.1"},{"issue":"2","key":"9364_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02351719","volume":"1","author":"J Buchmann","year":"1988","unstructured":"J.\u00a0Buchmann and H.\u00a0C. Williams. A key-exchange system based on imaginary quadratic fields. Journal of Cryptology, 1(2):107\u2013118, 1988.","journal-title":"Journal of Cryptology"},{"key":"9364_CR11","unstructured":"B.\u00a0B\u00fcnz, B.\u00a0Fisch, and A.\u00a0Szepieniec. Transparent snarks from DARK compilers. Cryptology ePrint Archive, Report 2019\/1229, 2019. https:\/\/eprint.iacr.org\/2019\/1229."},{"key":"9364_CR12","unstructured":"B.\u00a0Cohen and K.\u00a0Pietrzak. The Chia network blockchain. Chia network, white paper, 2019. https:\/\/vdfresearch.org\/assets\/P0137-R-004b%20(VDF%20proof%20feasibility%20study).pdf."},{"key":"9364_CR13","unstructured":"D.\u00a0A. Cox. Primes of the form$$x^2+ ny^2$$: Fermat, class field theory, and complex multiplication, volume\u00a034. John Wiley & Sons, 2011."},{"key":"9364_CR14","unstructured":"CPU-Z OC world records. http:\/\/valid.canardpc.com\/records.php, 2018."},{"key":"9364_CR15","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, J.\u00a0Katz, A.\u00a0Smith, and S.\u00a0Walfish. Composability and On-Line Deniability of Authentication, pages 146\u2013162. Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.","DOI":"10.1007\/978-3-642-00457-5_10"},{"issue":"4","key":"9364_CR16","first-page":"727","volume":"45","author":"D Dolev","year":"2003","unstructured":"D.\u00a0Dolev, C.\u00a0Dwork, and M.\u00a0Naor. Nonmalleable cryptography. SIAM review, 45(4):727\u2013784, 2003.","journal-title":"Nonmalleable cryptography. SIAM review"},{"key":"9364_CR17","unstructured":"N.\u00a0D\u00f6ttling, S.\u00a0Garg, G.\u00a0Malavolta, and P.\u00a0N. Vasudevan. Tight verifiable delay functions. Cryptology ePrint Archive, Report 2019\/659, 2019. https:\/\/eprint.iacr.org\/2019\/659."},{"key":"9364_CR18","unstructured":"J.\u00a0Drake. Ethereum 2.0 randomness. August 2018 workshop at Stanford hosted by the Ethereum Foundation and the Stanford Center for Blockchain Research, 2018. https:\/\/www.chia.net\/assets\/ChiaGreenPaper.pdf."},{"key":"9364_CR19","unstructured":"J.\u00a0Drake. Minimal VDF randomness beacon. Ethereum Research post, 2018. https:\/\/ethresear.ch\/t\/minimal-vdf-randomness-beacon\/3566."},{"issue":"6","key":"9364_CR20","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1145\/1039488.1039489","volume":"51","author":"C Dwork","year":"2004","unstructured":"C.\u00a0Dwork, M.\u00a0Naor, and A.\u00a0Sahai. Concurrent zero-knowledge. Journal of the ACM (JACM), 51(6):851\u2013898, 2004.","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"9364_CR21","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"S.\u00a0Goldwasser, S.\u00a0Micali, and C.\u00a0Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on computing, 18(1):186\u2013208, 1989.","journal-title":"SIAM Journal on computing"},{"issue":"4","key":"9364_CR22","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1090\/S0894-0347-1989-1002631-0","volume":"2","author":"JL Hafner","year":"1989","unstructured":"J.\u00a0L. Hafner and K.\u00a0S. McCurley. A rigorous subexponential algorithm for computation of class groups. Journal of the American mathematical society, 2(4):837\u2013850, 1989.","journal-title":"Journal of the American mathematical society"},{"key":"9364_CR23","doi-asserted-by":"crossref","unstructured":"A.\u00a0Joux, D.\u00a0Naccache, and E.\u00a0Thom\u00e9. When e-th roots become easier than factoring. In K.\u00a0Kurosawa, editor, Advances in Cryptology \u2013 ASIACRYPT 2007, volume 4833 of Lecture Notes in Computer Science, pages 13\u201328. Springer, 2007.","DOI":"10.1007\/978-3-540-76900-2_2"},{"key":"9364_CR24","doi-asserted-by":"crossref","unstructured":"J.\u00a0Kilian. A note on efficient zero-knowledge proofs and arguments. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pages 723\u2013732, 1992.","DOI":"10.1145\/129712.129782"},{"key":"9364_CR25","doi-asserted-by":"crossref","unstructured":"A.\u00a0K. Lenstra and B.\u00a0Wesolowski. Trustworthy public randomness with sloth, unicorn and trx. International Journal of Applied Cryptology, 2016.","DOI":"10.1504\/IJACT.2017.089354"},{"key":"9364_CR26","unstructured":"L.\u00a0Long. Binary quadratic forms. Chia network, Chia VDF Competition Guide, 2019. https:\/\/github.com\/Chia-Network\/vdf-competition\/blob\/master\/classgroups.pdf."},{"issue":"4","key":"9364_CR27","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"S.\u00a0Micali. Computationally sound proofs. SIAM Journal on Computing, 30(4):1253\u20131298, 2000.","journal-title":"SIAM Journal on Computing"},{"key":"9364_CR28","doi-asserted-by":"crossref","unstructured":"R.\u00a0Pass. On deniability in the common reference string and random oracle model. In D.\u00a0Boneh, editor, Advances in Cryptology \u2013 CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 316\u2013337. Springer, 2003.","DOI":"10.1007\/978-3-540-45146-4_19"},{"key":"9364_CR29","unstructured":"K.\u00a0Pietrzak. Simple verifiable delay functions. Cryptology ePrint Archive, Report 2018\/627, Version 20180626:145529, 2018. https:\/\/eprint.iacr.org\/2018\/627."},{"issue":"2","key":"9364_CR30","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27","author":"MO Rabin","year":"1983","unstructured":"M.\u00a0O. Rabin. Transaction protection by beacons. Journal of Computer and System Sciences, 27(2):256 \u2013 267, 1983.","journal-title":"Journal of Computer and System Sciences"},{"key":"9364_CR31","unstructured":"R.\u00a0L. Rivest, A.\u00a0Shamir, and D.\u00a0A. Wagner. Time-lock puzzles and timed-release crypto. 1996."},{"key":"9364_CR32","doi-asserted-by":"crossref","unstructured":"T.\u00a0Sander. Efficient accumulators without trapdoor extended abstract. In International Conference on Information and Communications Security, pages 252\u2013262. Springer, 1999.","DOI":"10.1007\/978-3-540-47942-0_21"},{"key":"9364_CR33","unstructured":"R.\u00a0Swarbrick. VDF proof feasibility study. Argon Design, technical report, 2018. https:\/\/vdfresearch.org\/assets\/P0137-R-004b%20(VDF%20proof%20feasibility%20study).pdf."},{"key":"9364_CR34","doi-asserted-by":"crossref","unstructured":"U.\u00a0Vollmer. Asymptotically fast discrete logarithms in quadratic number fields. In International Algorithmic Number Theory Symposium (ANTS), pages 581\u2013594. Springer, 2000.","DOI":"10.1007\/10722028_39"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-020-09364-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-020-09364-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-020-09364-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T23:17:02Z","timestamp":1631143022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-020-09364-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,9]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["9364"],"URL":"https:\/\/doi.org\/10.1007\/s00145-020-09364-x","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,9]]},"assertion":[{"value":"21 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}