Verifiable delay functions

Dan Boneh; Joseph Bonneau; Benedikt Bünz; Ben Fisch

doi:10.1007/978-3-319-96884-1_25

Verifiable delay functions

Dan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We study the problem of building a verifiable delay function (VDF). A VDF requires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficiently and publicly verified. VDF s have many applications in decentralized systems, including public randomness beacons, leader election in consensus protocols, and proofs of replication. We formalize the requirements for VDF s and present new candidate constructions that are the first to achieve an exponential gap between evaluation and verification time.

Original language	English (US)
Title of host publication	Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings
Editors	Alexandra Boldyreva, Hovav Shacham
Publisher	Springer Verlag
Pages	757-788
Number of pages	32
ISBN (Print)	9783319968834
DOIs	https://doi.org/10.1007/978-3-319-96884-1_25
State	Published - 2018
Event	38th Annual International Cryptology Conference, CRYPTO 2018 - Santa Barbara, United States Duration: Aug 19 2018 → Aug 23 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10991 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	38th Annual International Cryptology Conference, CRYPTO 2018
Country/Territory	United States
City	Santa Barbara
Period	8/19/18 → 8/23/18

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-96884-1_25

Cite this

Boneh, D., Bonneau, J., Bünz, B., & Fisch, B. (2018). Verifiable delay functions. In A. Boldyreva, & H. Shacham (Eds.), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings (pp. 757-788). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10991 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-96884-1_25

Verifiable delay functions. / Boneh, Dan; Bonneau, Joseph; Bünz, Benedikt et al.
Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. ed. / Alexandra Boldyreva; Hovav Shacham. Springer Verlag, 2018. p. 757-788 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10991 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Boneh, D, Bonneau, J, Bünz, B & Fisch, B 2018, Verifiable delay functions. in A Boldyreva & H Shacham (eds), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10991 LNCS, Springer Verlag, pp. 757-788, 38th Annual International Cryptology Conference, CRYPTO 2018, Santa Barbara, United States, 8/19/18. https://doi.org/10.1007/978-3-319-96884-1_25

Boneh D, Bonneau J, Bünz B, Fisch B. Verifiable delay functions. In Boldyreva A, Shacham H, editors, Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. Springer Verlag. 2018. p. 757-788. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-96884-1_25

Boneh, Dan ; Bonneau, Joseph ; Bünz, Benedikt et al. / Verifiable delay functions. Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. editor / Alexandra Boldyreva ; Hovav Shacham. Springer Verlag, 2018. pp. 757-788 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2de7d2a600ee4548b4c69b1faf04b4af,

title = "Verifiable delay functions",

abstract = "We study the problem of building a verifiable delay function (VDF). A VDF requires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficiently and publicly verified. VDF s have many applications in decentralized systems, including public randomness beacons, leader election in consensus protocols, and proofs of replication. We formalize the requirements for VDF s and present new candidate constructions that are the first to achieve an exponential gap between evaluation and verification time.",

author = "Dan Boneh and Joseph Bonneau and Benedikt B{\"u}nz and Ben Fisch",

note = "Funding Information: Acknowledgments. We thank Micheal Zieve for his help with permutation polynomials. We thank the CRYPTO reviewers for their helpful comments. This work was supported by NSF, a grant from ONR, the Simons Foundation, and a Google faculty fellowship. Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2018.; 38th Annual International Cryptology Conference, CRYPTO 2018 ; Conference date: 19-08-2018 Through 23-08-2018",

year = "2018",

doi = "10.1007/978-3-319-96884-1_25",

language = "English (US)",

isbn = "9783319968834",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "757--788",

editor = "Alexandra Boldyreva and Hovav Shacham",

booktitle = "Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings",

}

TY - GEN

T1 - Verifiable delay functions

AU - Boneh, Dan

AU - Bonneau, Joseph

AU - Bünz, Benedikt

AU - Fisch, Ben

N1 - Funding Information: Acknowledgments. We thank Micheal Zieve for his help with permutation polynomials. We thank the CRYPTO reviewers for their helpful comments. This work was supported by NSF, a grant from ONR, the Simons Foundation, and a Google faculty fellowship. Publisher Copyright: © International Association for Cryptologic Research 2018.

PY - 2018

Y1 - 2018

N2 - We study the problem of building a verifiable delay function (VDF). A VDF requires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficiently and publicly verified. VDF s have many applications in decentralized systems, including public randomness beacons, leader election in consensus protocols, and proofs of replication. We formalize the requirements for VDF s and present new candidate constructions that are the first to achieve an exponential gap between evaluation and verification time.

AB - We study the problem of building a verifiable delay function (VDF). A VDF requires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficiently and publicly verified. VDF s have many applications in decentralized systems, including public randomness beacons, leader election in consensus protocols, and proofs of replication. We formalize the requirements for VDF s and present new candidate constructions that are the first to achieve an exponential gap between evaluation and verification time.

UR - http://www.scopus.com/inward/record.url?scp=85052377031&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85052377031&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-96884-1_25

DO - 10.1007/978-3-319-96884-1_25

M3 - Conference contribution

AN - SCOPUS:85052377031

SN - 9783319968834

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 757

EP - 788

BT - Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings

A2 - Boldyreva, Alexandra

A2 - Shacham, Hovav

PB - Springer Verlag

T2 - 38th Annual International Cryptology Conference, CRYPTO 2018

Y2 - 19 August 2018 through 23 August 2018

ER -

Verifiable delay functions

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this