Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions

DOI10.1007/978-3-031-15982-4_8MaRDI QIDQ6163949zbMATH OpenOpenAlexFDO

Authors Jeremiah Blocki, Blake Holman

Publication date 30 June 2023

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

Full work available at URL https://doi.org/10.1007/978-3-031-15982-4_8

zbMATH Keywords

cumulative memory complexitydata-dependent memory hard functiondynamic pebbling gamesustained space complexity

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Sustained space complexity
• Data-independent memory hard functions: new attacks and stronger constructions
• Efficiently computing data-independent memory-hard functions
• Scrypt is maximally memory-hard
• Static-memory-hard functions, and modeling the cost of space vs. time

Cites work

• Data-independent memory hard functions: new attacks and stronger constructions
• Depth-robust graphs and their cumulative memory complexity
• Efficiently computing data-independent memory-hard functions
• High Parallel Complexity Graphs and Memory-Hard Functions
• scientific article; zbMATH DE number 7650384 (Why is no real title available?)
• On sparse graphs with dense long paths
• On the depth-robustness and cumulative pebbling cost of Argon2i
• On Time Versus Space
• Scrypt is maximally memory-hard
• Sustained space complexity

Cited in

(16)

• Denseness of volatile and nonvolatile sequences of functions
• Static-memory-hard functions, and modeling the cost of space vs. time
• Sustained space complexity
• Time-memory tradeoff attacks on the MTP proof-of-work scheme
• On the depth-robustness and cumulative pebbling cost of Argon2i
• Moderately hard functions: definition, instantiations, and applications
• Disproving the conjectures from ``On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model
• Memory-hard functions from cryptographic primitives
• Efficiently computing data-independent memory-hard functions
• Scrypt is maximally memory-hard
• On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model
• Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
• Lower bounds for the number of decryption updates in registration-based encryption
• Bandwidth-Hard Functions: Reductions and Lower Bounds
• Trapdoor memory-hard functions
• A tight lower bound on the \textsc{TdScrypt} trapdoor memory-hard function

This page was built for publication: Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions

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