Pages that link to "Item:Q2829217"
From MaRDI portal
The following pages link to Efficiently Computing Data-Independent Memory-Hard Functions (Q2829217):
Displayed 14 items.
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- Rifflescrambler -- a memory-hard password storing function (Q2167756) (← links)
- Efficiently Computing Data-Independent Memory-Hard Functions (Q2829217) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Proof of Space from Stacked Expanders (Q3179360) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← 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)
- Cost-asymmetric memory hard password hashing (Q6134807) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions (Q6163949) (← links)
- The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs (Q6169348) (← links)
- Cost-asymmetric memory hard password hashing (Q6204165) (← links)