Proof of Space from Stacked Expanders
From MaRDI portal
Publication:3179360
DOI10.1007/978-3-662-53641-4_11zbMath1406.94077OpenAlexW2533275618MaRDI QIDQ3179360
Publication date: 21 December 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53641-4_11
Related Items (3)
Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks ⋮ Proofs of Catalytic Space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smaller superconcentrators of density 28
- Time-space trade-offs in a pebble game
- Tradeoff Cryptanalysis of Memory-Hard Functions
- Efficiently Computing Data-Independent Memory-Hard Functions
- Efficient Proofs of Secure Erasure
- Proofs of Space: When Space Is of the Essence
- High Parallel Complexity Graphs and Memory-Hard Functions
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
- Publicly verifiable proofs of sequential work
- One-Time Computable Self-erasing Functions
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
- A Remark on Stirling's Formula
- Proofs of Space
- Secure Code Update for Embedded Devices via Proofs of Secure Erasure
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- Complete Register Allocation Problems
- Space bounds for a game on graphs
- Key-Evolution Schemes Resilient to Space-Bounded Leakage
- Advances in Cryptology - CRYPTO 2003
- Pebbling and Proofs of Work
- On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
This page was built for publication: Proof of Space from Stacked Expanders
