Memory-hard functions from cryptographic primitives

DOI10.1007/978-3-030-26951-7_19MaRDI QIDQ2304993zbMATH OpenOpenAlexFDO

Authors Binyi Chen, Stefano Tessaro

Publication date 9 March 2020

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

zbMATH Keywords

provable securityideal modelsmemory-hard functions

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

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

Cited in

(9)

• Symmetrically and asymmetrically hard cryptography
• Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
• Moderately hard functions: definition, instantiations, and applications
• Scrypt is maximally memory-hard
• Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
• Tradeoff Cryptanalysis of Memory-Hard Functions
• Trapdoor memory-hard functions
• 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: Memory-hard functions from cryptographic primitives

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