Efficiently computing data-independent memory-hard functions

DOI10.1007/978-3-662-53008-5_9zbMATH Open1390.94826OpenAlexW2484106744MaRDI QIDQ2829217FDOQ2829217

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

Recommendations

• Data-independent memory hard functions: new attacks and stronger constructions
• Sustained space complexity
• Depth-robust graphs and their cumulative memory complexity
• Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions
• Scrypt is maximally memory-hard

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Non-uniform Cracks in the Concrete: The Power of Free Precomputation
• Tradeoff Cryptanalysis of Memory-Hard Functions
• Efficiently Computing Data-Independent Memory-Hard Functions
• High Parallel Complexity Graphs and Memory-Hard Functions
• On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
• Publicly verifiable proofs of sequential work
• Pebbling and Proofs of Work
• Cache Based Remote Timing Attack on the AES
• Advances in Cryptology - CRYPTO 2003
• Mitigating Dictionary Attacks on Password-Protected Local Storage

Cited In (20)

• Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions
• Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
• Cost-asymmetric memory hard password hashing
• The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs
• Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
• PURED: a unified framework for resource-hard functions
• Proof of Space from Stacked Expanders
• Title not available (Why is that?)
• Efficiently Computing Data-Independent Memory-Hard Functions
• Cost-asymmetric memory hard password hashing
• Rifflescrambler -- a memory-hard password storing function
• Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
• Bandwidth-Hard Functions: Reductions and Lower Bounds
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
• On sequential functions and fine-grained cryptography
• Data-independent memory hard functions: new attacks and stronger constructions
• Cumulative Space in Black-White Pebbling and Resolution
• Static-memory-hard functions, and modeling the cost of space vs. time
• Depth-Robust Graphs and Their Cumulative Memory Complexity
• Scrypt Is Maximally Memory-Hard

This page was built for publication: Efficiently computing data-independent memory-hard functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829217)