Continuous verifiable delay functions
From MaRDI portal
Publication:2055650
DOI10.1007/978-3-030-45727-3_5zbMath1479.94164OpenAlexW2953744829MaRDI QIDQ2055650
Cody Freitag, Ilan Komargodski, Naomi Ephraim, Rafael Pass
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_5
Related Items (16)
Non-malleable codes for bounded parallel-time tampering ⋮ PoSAT: proof-of-work availability and unpredictability, without the work ⋮ An incremental PoSW for general weight distributions ⋮ SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ Practical statistically-sound proofs of exponentiation in any group ⋮ TIDE: a novel approach to constructing timed-release encryption ⋮ Parallelizable delegation from LWE ⋮ Short-lived zero-knowledge proofs and signatures ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ Time-release cryptography from minimal circuit assumptions ⋮ PPAD is as hard as LWE and iterated squaring ⋮ Simple and efficient batch verification techniques for verifiable delay functions ⋮ Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On total functions, existence theorems and computational complexity
- Transaction protection by beacons
- On the complexity of the parity argument and other inefficient proofs of existence
- Trustworthy public randomness with sloth, unicorn, and trx
- Simple proofs of sequential work
- Verifiable delay functions
- Incremental proofs of sequential work
- Time-Lock Puzzles from Randomized Encodings
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- The Magic of ELFs
- Publicly verifiable proofs of sequential work
- Settling the complexity of computing two-player Nash equilibria
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Time/Space Trade-Offs for Reversible Computation
- Algebraic methods for interactive proof systems
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
- Simple verifiable delay functions
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
- The Complexity of Computing a Nash Equilibrium
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- From Minicrypt to Obfustopia via Private-Key Functional Encryption
- Obfustopia built on secret-key functional encryption
- Efficient verifiable delay functions
This page was built for publication: Continuous verifiable delay functions
