The following pages link to Pebbling and Proofs of Work (Q5451017):
Displayed 19 items.
- How to build time-lock encryption (Q1791669) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- Efficiently Computing Data-Independent Memory-Hard Functions (Q2829217) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols (Q3073713) (← links)
- Proof of Space from Stacked Expanders (Q3179360) (← links)
- PoW-Based Distributed Cryptography with No Trusted Setup (Q3457075) (← links)
- Proofs of Space (Q3457086) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- Proofs of Catalytic Space (Q5090438) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- Depth-Robust Graphs and Their Cumulative Memory Complexity (Q5270356) (← links)
- Scrypt Is Maximally Memory-Hard (Q5270357) (← links)
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) (Q6067351) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- Individual cryptography (Q6145925) (← links)