Verifable Delay Functions (paper)
eprint.iacr.org · 9,303 words · saved by 1 readers
N/A
Verifiable Delay Functions Dan Boneh1 , Joseph Bonneau2 , Benedikt Bünz1 , and Ben Fisch1 1 Stanford University 2 New York University June 26, 2019 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…
saved by
related reading
- Verifiable Delay Functions. A brief and gentle introduction | by Ramses Fernandez | RootstockLabs: Research & Technology | Mediummedium.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- 370.pdfeprint.iacr.org
- VDF Alliancevdfalliance.org
- thesis.pdfaayushg.com
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- Computer Scientists Figure Out How To Prove Lies | Quanta Magazinequantamagazine.org
- Flock: Fast Proving for Batch Boolean Computationseprint.iacr.org
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- Towards a Theory of Maximal Extractable Value II: Uncertaintyarxiv.org
- The Compute Verification Postfirstscattering.com