Breaking verifiable delay functions in the random oracle model
From MaRDI portal
Cites work
- An incremental PoSW for general weight distributions
- Can verifiable delay functions be based on random oracles?
- Computational Complexity
- Continuous verifiable delay functions
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Generic-group delay functions require hidden-order groups
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- Incremental proofs of sequential work
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Inequalities with applications to percolation and reliability
- On the cryptographic hardness of finding a Nash equilibrium
- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
- PPAD is as hard as LWE and iterated squaring
- Proof of the Van den Berg–Kesten Conjecture
- Publicly verifiable proofs of sequential work
- Reimer's inequality and tardos' conjecture
- Reversible proofs of sequential work
- Simple proofs of sequential work
- Simple verifiable delay functions
- SNACKs: leveraging proofs of sequential work for blockchain light clients
- The Bitcoin Backbone Protocol: Analysis and Applications
- The dual BKR inequality and Rudich's conjecture
- Tight verifiable delay functions
- Time-lock puzzles in the random oracle model
- Verifiable delay functions
- Verifiable delay functions from supersingular isogenies and pairings
Cited in
(2)
This page was built for publication: Breaking verifiable delay functions in the random oracle model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862538)
