Data-independent memory hard functions: new attacks and stronger constructions

DOI10.1007/978-3-030-26951-7_20MaRDI QIDQ2304996zbMATH OpenOpenAlexFDO

Authors Jeremiah Blocki, Ben Harsha, Siteng Kang, Seunghoon Lee, Lu Xing, Samson Zhou

Publication date 9 March 2020

Full work available at URL https://doi.org/10.1007/978-3-030-26951-7_20

zbMATH Keywords

key cryptographic primitivepassword-hashing algorithms

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 7650384
• Memory-hard functions from cryptographic primitives
• Tradeoff Cryptanalysis of Memory-Hard Functions
• Efficiently computing data-independent memory-hard functions
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• New attacks on Feistel structures with improved memory complexities
• Time-Memory Trade-Off Attacks on Multiplications and T-Functions
• scientific article; zbMATH DE number 1088242
• Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries

Cited in

(18)

• Static-memory-hard functions, and modeling the cost of space vs. time
• Sustained space complexity
• On the depth-robustness and cumulative pebbling cost of Argon2i
• Memory-hard functions from cryptographic primitives
• Study on massive-scale slow-hash recovery using unified probabilistic context-free grammar and symmetrical collaborative prioritization with parallel machines
• On the computational complexity of minimal cumulative cost graph pebbling
• Tradeoff Cryptanalysis of Memory-Hard Functions
• Efficiently computing data-independent memory-hard functions
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• Depth-robust graphs and their cumulative memory complexity
• 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
• Bandwidth-Hard Functions: Reductions and Lower Bounds
• Trapdoor memory-hard functions
• The impact of reversibility on parallel pebbling
• A new connection between node and edge depth robust graphs
• Provably memory-hard proofs of work with memory-easy verification

This page was built for publication: Data-independent memory hard functions: new attacks and stronger constructions

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