vdf
Papers (26)
# | Title | |
1. | Verifiable Delay Functions Dan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch. 2018. | |
2. | Efficient verifiable delay functions Wesolowski, Benjamin. 2019. | |
3. | Simple verifiable delay functions Pietrzak, Krzysztof Z. 2019. | |
4. | A Survey of Two Verifiable Delay Functions. Boneh, Dan and B\"unz, Benedikt and Fisch, Ben. 2018. | |
5. | Verifiable Delay Functions from Supersingular Isogenies and Pairings Luca De Feo and Simon Masson and Christophe Petit and Antonio Sanso. 2019. | |
6. | Continuous verifiable delay functions Ephraim, Naomi and Freitag, Cody and Komargodski, Ilan and Pass, Rafael. 2019. | |
7. | Proofs-of-delay and randomness beacons in ethereum B\"unz, Benedikt and Goldfeder, Steven and Bonneau, Joseph. 2017. | |
8. | On the Security of Time-Locked Puzzles and Timed Commitments Jonathan Katz and Julian Loss and Jiayu Xu. 2020. | |
9. | Tight Verifiable Delay Functions D\"ottling, Nico and Garg, Sanjam and Malavolta, Giulio and Nalini, Prashant. 2019. | |
10. | Randrunner: Distributed randomness from trapdoor vdfs with strong uniqueness Schindler, Philipp and Judmayer, Aljosha and Hittmeir, Markus and Stifter, Nicholas and Weippl, Edgar. 2021. | |
11. | Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority Megan Chen and Carmit Hazay and Yuval Ishai and Yuriy Kashnikov and Daniele Micciancio and Tarik Riviere and abhi shelat and Muthu Venkitasubramaniam and Ruihan Wang. 2020. | |
12. | Trustless Groups of Unknown Order with Hyperelliptic Curves Samuel Dobson and Steven D. Galbraith. 2020. | |
13. | Generic-Group Delay Functions Require Hidden-Order Groups Lior Rotem and Gil Segev and Ido Shahaf. 2020. | |
14. | Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions Lior Rotem and Gil Segev. 2020. | |
15. | Multi-instance Publicly Verifiable Time-lock Puzzle and its Applications Abadi, Aydin and Kiayias, Aggelos. 2021. | |
16. | A note on the low order assumption in class group of an imaginary quadratic number fields Karim Belabas and Thorsten Kleinjung and Antonio Sanso and Benjamin Wesolowski. 2020. | |
17. | Verifiable computing applications in blockchain \vSimuni\'c, Silvio and Bernaca, Dalen and Lenac, Kristijan. 2021. | |
18. | CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time-Lock Puzzles Carsten Baum and Bernardo David and Rafael Dowsley and Jesper Buus Nielsen and Sabine Oechsner. 2020. | |
19. | Time-release Cryptography from Minimal Circuit Assumptions Samuel Jaques and Hart Montgomery and Arnab Roy. 2020. | |
20. | Lower bounds for the depth of modular squaring Benjamin Wesolowski and Ryan Williams. 2020. | |
21. | Short-lived zero-knowledge proofs and signatures Arasu Arun and Joseph Bonneau and Jeremy Clark. 2022. | |
22. | MinRoot: Candidate Sequential Function for Ethereum VDF Dmitry Khovratovich and Mary Maller and Pratyush Ranjan Tiwari. 2022. | |
23. | A Note on Low Order Assumptions in RSA groups István András Seres and Péter Burcsi. 2020. | |
24. | Lattice-based succinct arguments from vanishing polynomials Cini, Valerio and Lai, Russell WF and Malavolta, Giulio. 2023. | |
25. | Binary quadratic forms Lipa Long. 2019. | |
26. | Eth 2.0 Randomness Ben Edgington. 2022. |
Videos
–