Continuous verifiable delay functions
From MaRDI portal
Publication:2055650
Recommendations
Cites work
- Algebraic methods for interactive proof systems
- Efficient verifiable delay functions
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- From Minicrypt to Obfustopia via private-key functional encryption
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 177820 (Why is no real title available?)
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- Incremental proofs of sequential work
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Obfustopia built on secret-key functional encryption
- On the complexity of the parity argument and other inefficient proofs of existence
- On total functions, existence theorems and computational complexity
- Publicly verifiable proofs of sequential work
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Settling the complexity of computing two-player Nash equilibria
- Simple proofs of sequential work
- Simple verifiable delay functions
- The complexity of computing a Nash equilibrium
- The Magic of ELFs
- Time-lock puzzles from randomized encodings
- Time/Space Trade-Offs for Reversible Computation
- Transaction protection by beacons
- Trustworthy public randomness with sloth, unicorn, and trx
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Verifiable delay functions
Cited in
(35)- Design for delay verifiability
- Verifiable delay functions
- 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
- Tight verifiable delay functions
- Non-malleable codes for bounded parallel-time tampering
- PoSAT: proof-of-work availability and unpredictability, without the work
- Simple and efficient batch verification techniques for verifiable delay functions
- Simple verifiable delay functions
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- Efficient verifiable delay functions
- Efficient verifiable delay functions
- An incremental PoSW for general weight distributions
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- 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
- (Verifiable) delay functions from Lucas sequences
- On sequential functions and fine-grained cryptography
- CaSCaDE: (time-based) Cryptography from Space Communications DElay
- Breaking verifiable delay functions in the random oracle model
- Proofs of sequential communication delays from physical assumptions and their applications
- Homomorphic secret sharing with verifiable evaluation
- Indistinguishability obfuscation from well-founded assumptions
- Time/space tradeoffs for generic attacks on delay functions
- Impossibility of VDFs in the ROM: the complete picture
- Separating verifiable delay functions and time-lock puzzles
- Beyond the 1/2 bound: on the theory and practice of biprimality tests
- On verifiable delay functions from time-lock puzzles
This page was built for publication: Continuous verifiable delay functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055650)
