Proofs of Catalytic Space
From MaRDI portal
Publication:5090438
DOI10.4230/LIPIcs.ITCS.2019.59OpenAlexW2794842518MaRDI QIDQ5090438
Publication date: 18 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.ITCS.2019.59
Cites Work
- Unnamed Item
- On sparse graphs with dense long paths
- Sustained space complexity
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Beyond Hellman's time-memory trade-offs with applications to proofs of space
- Disproving the conjectures from ``On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model
- Algorand: a secure and efficient distributed ledger
- Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
- Proof of Space from Stacked Expanders
- Proofs of Space
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Space bounds for a game on graphs
- Computing with a full memory
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
- Depth-Robust Graphs and Their Cumulative Memory Complexity
- Scrypt Is Maximally Memory-Hard
- Pebbling and Proofs of Work
This page was built for publication: Proofs of Catalytic Space
