Efficiently computing data-independent memory-hard functions

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

Authors: 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 \textsf{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 (25)

• 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
• Proof of space from stacked expanders
• Sustained space complexity
• Bandwidth hard functions for ASIC resistance
• On the depth-robustness and cumulative pebbling cost of Argon2i
• Efficiently computing data-independent memory-hard functions
• Depth-robust graphs and their cumulative memory complexity
• Scrypt is maximally memory-hard
• Cumulative space in black-white pebbling and resolution
• Cost-asymmetric memory hard password hashing
• The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• 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
• Title not available (Why is that?)
• Cost-asymmetric memory hard password hashing
• Rifflescrambler -- a memory-hard password storing function
• Trapdoor memory-hard functions
• 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
• Static-memory-hard functions, and modeling the cost of space vs. time
• Symmetrically and asymmetrically hard cryptography

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)