Verifiable delay functions
发表信息
作者
- Dan Boneh
- Joseph Bonneau
- Benedikt Bünz
- Ben Fisch
笔记
We study the problem of building a verifiable delay function (VDF). A requires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficiently and publicly verified. 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 s and present new candidate constructions that are the first to achieve an exponential gap between evaluation and verification time.
我们研究构建可验证延迟函数(verifiable delay function, VDF)的问题。VDF需要特定数量的顺序步骤来评估，但能产生一个可以被高效且公开验证的唯一输出。VDF在去中心化系统中有许多应用，包括公共随机信标、共识协议中的领导者选举以及复制证明。我们形式化了VDF的需求，并提出了新的候选构造方案，这是首次在评估时间和验证时间之间实现指数级差距的方案。
(注：由于原文摘要仅有一段，所以译文也保持一段的形式。原文中虽然没有出现数学公式，但我已准备好按要求处理任何可能出现的数学公式，并严格保持其格式。)