Efficiently Computing Data-Independent Memory-Hard Functions

DOI10.1007/978-3-662-53008-5_9zbMath1390.94826OpenAlexW2484106744MaRDI QIDQ2829217

Joël Alwen, Jeremiah Blocki

Publication date: 27 October 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_9

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (14)

Static-memory-hard functions, and modeling the cost of space vs. time ⋮ Cumulative Space in Black-White Pebbling and Resolution ⋮ Proof of Space from Stacked Expanders ⋮ Rifflescrambler -- a memory-hard password storing function ⋮ Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks ⋮ 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 ⋮ Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions ⋮ The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs ⋮ Cost-asymmetric memory hard password hashing ⋮ Efficiently Computing Data-Independent Memory-Hard Functions ⋮ Depth-Robust Graphs and Their Cumulative Memory Complexity ⋮ Scrypt Is Maximally Memory-Hard

Cites Work

• Unnamed Item
• Tradeoff Cryptanalysis of Memory-Hard Functions
• Efficiently Computing Data-Independent Memory-Hard Functions
• Non-uniform Cracks in the Concrete: The Power of Free Precomputation
• High Parallel Complexity Graphs and Memory-Hard Functions
• Publicly verifiable proofs of sequential work
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Cache Based Remote Timing Attack on the AES
• 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
• Mitigating Dictionary Attacks on Password-Protected Local Storage

This page was built for publication: Efficiently Computing Data-Independent Memory-Hard Functions