Simple verifiable delay functions
From MaRDI portal
Publication:5090439
DOI10.4230/LIPIcs.ITCS.2019.60OpenAlexW2899466157MaRDI QIDQ5090439
Publication date: 18 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/10153/pdf/LIPIcs-ITCS-2019-60.pdf/
Related Items (40)
Non-malleable codes for bounded parallel-time tampering ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ A proof of the conjectured run time of the Hafner-McCurley class group algorithm ⋮ An incremental PoSW for general weight distributions ⋮ 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 ⋮ Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments ⋮ Certifying giant nonprimes ⋮ Practical statistically-sound proofs of exponentiation in any group ⋮ TIDE: a novel approach to constructing timed-release encryption ⋮ Parallelizable delegation from LWE ⋮ SNACKs: leveraging proofs of sequential work for blockchain light clients ⋮ Short-lived zero-knowledge proofs and signatures ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ Astrolabous: a universally composable time-lock encryption scheme ⋮ Snarky ceremonies ⋮ Time-release cryptography from minimal circuit assumptions ⋮ PPAD is as hard as LWE and iterated squaring ⋮ Applications of timed-release encryption with implicit authentication ⋮ Completeness theorems for adaptively secure broadcast ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ Lattice-based timed cryptography ⋮ On the impossibility of purely algebraic signatures ⋮ Simple and efficient batch verification techniques for verifiable delay functions ⋮ Non-malleable time-lock puzzles and applications ⋮ Minting mechanism for proof of stake blockchains ⋮ Multiparty generation of an RSA modulus ⋮ Transparent SNARKs from DARK compilers ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Continuous verifiable delay functions ⋮ Generic-group delay functions require hidden-order groups ⋮ Bandwidth-efficient threshold EC-DSA ⋮ Delay encryption ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Multiparty generation of an RSA modulus ⋮ 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 ⋮ Delegation with updatable unambiguous proofs and PPAD-hardness
Cites Work
- Simple proofs of sequential work
- Verifiable delay functions
- A signature scheme based on the intractability of computing roots
- Stronger security proofs for RSA and Rabin bits.
- Generating safe primes
- Publicly verifiable proofs of sequential work
- The Group of Signed Quadratic Residues and Applications
- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
This page was built for publication: Simple verifiable delay functions
