Efficiently computing data-independent memory-hard functions

DOI10.1007/978-3-662-53008-5_9MaRDI QIDQ2829217zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

• scientific article; zbMATH DE number 3597878 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Cache Based Remote Timing Attack on the AES
• Efficiently computing data-independent memory-hard functions
• High Parallel Complexity Graphs and Memory-Hard Functions
• Mitigating Dictionary Attacks on Password-Protected Local Storage
• Non-uniform cracks in the concrete: the power of free precomputation
• On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model
• Pebbling and Proofs of Work
• Publicly verifiable proofs of sequential work
• Tradeoff Cryptanalysis of Memory-Hard Functions

Cited in

(31)

• Symmetrically and asymmetrically hard cryptography
• Space-lock puzzles and verifiable space-hard functions from root-finding in sparse polynomials
• A note on low-communication secure multiparty computation via circuit depth-reduction
• 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
• Cumulative space in black-white pebbling and resolution
• Depth-robust graphs and their cumulative memory complexity
• Scrypt is maximally memory-hard
• 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
• A new connection between node and edge depth robust graphs
• Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
• Provably memory-hard proofs of work with memory-easy verification
• PURED: a unified framework for resource-hard functions
• scientific article; zbMATH DE number 4179292 (Why is no real title available?)
• Rifflescrambler -- a memory-hard password storing function
• Cost-asymmetric memory hard password hashing
• Cumulative memory lower bounds for randomized and quantum computation
• 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
• The impact of reversibility on parallel pebbling
• Data-independent memory hard functions: new attacks and stronger constructions
• Static-memory-hard functions, and modeling the cost of space vs. time

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)