Tight verifiable delay functions
From MaRDI portal
Publication:2106631
DOI10.1007/978-3-030-57990-6_4zbMath1506.94040OpenAlexW2953635274MaRDI QIDQ2106631
Sanjam Garg, Prashant Nalini Vasudevan, Giulio Malavolta, Nico Döttling
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-57990-6_4
Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25)
Related Items (7)
Practical statistically-sound proofs of exponentiation in any group ⋮ Parallelizable delegation from LWE ⋮ Time-release cryptography from minimal circuit assumptions ⋮ Lattice-based timed cryptography ⋮ Simple and efficient batch verification techniques for verifiable delay functions ⋮ Generic-group delay functions require hidden-order groups ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
This page was built for publication: Tight verifiable delay functions
