Trapdoor memory-hard functions
From MaRDI portal
Publication:6637334
DOI10.1007/978-3-031-58734-4_11MaRDI QIDQ6637334
Krzysztof Pietrzak, Benedikt Auerbach, Christoph U. Günther
Publication date: 13 November 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sustained space complexity
- The Discrete Logarithm problem with preprocessing
- Bandwidth hard functions for ASIC resistance
- Symmetrically and asymmetrically hard cryptography
- Beyond Hellman's time-memory trade-offs with applications to proofs of space
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- Variations on the Erdős distinct-sums problem
- On the security of time-lock puzzles and timed commitments
- Data-independent memory hard functions: new attacks and stronger constructions
- Generating safe primes
- High Parallel Complexity Graphs and Memory-Hard Functions
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
- A linear space algorithm for computing the hermite normal form
- Proof of Space from Stacked Expanders
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- On Systems of Linear Diophantine Equations
- Depth-Robust Graphs and Their Cumulative Memory Complexity
- Scrypt Is Maximally Memory-Hard
- On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions
This page was built for publication: Trapdoor memory-hard functions
