Verifiable delay functions

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

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationAdvances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings
EditorsAlexandra Boldyreva, Hovav Shacham
PublisherSpringer-Verlag
Pages757-788
Number of pages32
ISBN (Print)9783319968834
DOIs
StatePublished - Jan 1 2018
Event38th Annual International Cryptology Conference, CRYPTO 2018 - Santa Barbara, United States
Duration: Aug 19 2018Aug 23 2018

Publication series

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

Other

Other38th Annual International Cryptology Conference, CRYPTO 2018
CountryUnited States
CitySanta Barbara
Period8/19/188/23/18

Fingerprint

Leader Election
Randomness
Decentralized
Replication
Network protocols
Evaluate
Output
Requirements
Evaluation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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; Fisch, Ben.

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 proceedingConference 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)). https://doi.org/10.1007/978-3-319-96884-1_25
Boneh, Dan ; Bonneau, Joseph ; Bünz, Benedikt ; Fisch, Ben. / 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",
year = "2018",
month = "1",
day = "1",
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

PY - 2018/1/1

Y1 - 2018/1/1

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

ER -