Scrypt Is Maximally Memory-Hard

DOI10.1007/978-3-319-56617-7_2zbMath1394.94925OpenAlexW2612601170MaRDI QIDQ5270357

Krzysztof Pietrzak, Binyi Chen, Joël Alwen, Stefano Tessaro, Leonid Reyzin

Publication date: 23 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_2

zbMATH Keywords

scryptpassword hashingmemory-hard functions

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items (13)

Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries ⋮ Static-memory-hard functions, and modeling the cost of space vs. time ⋮ Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks ⋮ Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Quantum-resistant password-based threshold single-sign-on authentication with updatable server private key ⋮ Cost-asymmetric memory hard password hashing ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Individual cryptography ⋮ Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions ⋮ Cost-asymmetric memory hard password hashing ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications ⋮ Proofs of Catalytic Space ⋮ Scrypt Is Maximally Memory-Hard

Cites Work

• Efficiently Computing Data-Independent Memory-Hard Functions
• High Parallel Complexity Graphs and Memory-Hard Functions
• Proofs of Space
• Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
• Depth-Robust Graphs and Their Cumulative Memory Complexity
• Scrypt Is Maximally Memory-Hard
• Probability Inequalities for Sums of Bounded Random Variables
• Advances in Cryptology - CRYPTO 2003
• Pebbling and Proofs of Work
• On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
• Unnamed Item
• Unnamed Item

This page was built for publication: Scrypt Is Maximally Memory-Hard