Time/space tradeoffs for generic attacks on delay functions
From MaRDI portal
Cites work
- A cryptanalytic time-memory trade-off
- Can verifiable delay functions be based on random oracles?
- Cell-probe lower bounds for succinct partial sums
- Continuous verifiable delay functions
- Cryptanalysis of algebraic verifiable delay functions
- Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work
- Efficient 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
- Higher cell probe lower bounds for evaluating polynomials
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- Lattice-based timed cryptography
- Logarithmic Lower Bounds in the Cell-Probe Model
- Lower bound for succinct range minimum query
- Lower bounds on the time/memory tradeoff of function inversion
- On the security of time-lock puzzles and timed commitments
- Revisiting time-space tradeoffs for function inversion
- Secret sharing lower bound: either reconstruction is hard or shares are long
- Simple verifiable delay functions
- Space-lock puzzles and verifiable space-hard functions from root-finding in sparse polynomials
- Succinct sampling from discrete distributions
- The cell probe complexity of dynamic range counting
- The function-inversion problem: barriers and opportunities
- The limits of buffering: a tight lower bound for dynamic membership in the external memory model
- Tight cell probe bounds for succinct Boolean matrix-vector multiplication
- Tight cell-probe lower bounds for dynamic succinct dictionaries
- Verifiable delay functions
- Verifiable delay functions from supersingular isogenies and pairings
This page was built for publication: Time/space tradeoffs for generic attacks on delay functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233242)
