The following pages link to Scrypt Is Maximally Memory-Hard (Q5270357):
Displaying 14 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)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- Rifflescrambler -- a memory-hard password storing function (Q2167756) (← links)
- Proofs of Catalytic Space (Q5090438) (← links)
- Scrypt Is Maximally Memory-Hard (Q5270357) (← links)
- Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks (Q6057196) (← 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)
- Cost-asymmetric memory hard password hashing (Q6204165) (← links)
- Bandwidth-Hard Functions: Reductions and Lower Bounds (Q6489332) (← links)
- PURED: a unified framework for resource-hard functions (Q6623350) (← links)
- Trapdoor memory-hard functions (Q6637334) (← links)
