Pages that link to "Item:Q5270356"
From MaRDI portal
The following pages link to Depth-Robust Graphs and Their Cumulative Memory Complexity (Q5270356):
Displaying 11 items.
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- Rifflescrambler -- a memory-hard password storing function (Q2167756) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- (Q5002790) (← links)
- Proofs of Catalytic Space (Q5090438) (← links)
- Scrypt Is Maximally Memory-Hard (Q5270357) (← links)
- Cost-asymmetric memory hard password hashing (Q6204165) (← links)
- Bandwidth-Hard Functions: Reductions and Lower Bounds (Q6489332) (← links)
