Trapdoor memory-hard functions

DOI10.1007/978-3-031-58734-4_11MaRDI QIDQ6637334zbMATH OpenFDO

Authors Benedikt Auerbach, Christoph U. Günther, Krzysztof Pietrzak

Publication date 13 November 2024

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

zbMATH Keywords

big-key encryptionDiodonmemory hardnesswhite-box cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Scrypt is maximally memory-hard
• Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions
• Memory-hard functions from cryptographic primitives
• Efficiently computing data-independent memory-hard functions
• Tradeoff Cryptanalysis of Memory-Hard Functions

Cites work

• A linear space algorithm for computing the hermite normal form
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• Bandwidth hard functions for ASIC resistance
• Beyond Hellman's time-memory trade-offs with applications to proofs of space
• Data-independent memory hard functions: new attacks and stronger constructions
• Depth-robust graphs and their cumulative memory complexity
• Generating safe primes
• Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
• High Parallel Complexity Graphs and Memory-Hard Functions
• scientific article; zbMATH DE number 683826 (Why is no real title available?)
• scientific article; zbMATH DE number 708802 (Why is no real title available?)
• scientific article; zbMATH DE number 7559874 (Why is no real title available?)
• scientific article; zbMATH DE number 7650384 (Why is no real title available?)
• Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
• On Systems of Linear Diophantine Equations
• On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model
• On the security of time-lock puzzles and timed commitments
• Proof of space from stacked expanders
• Scrypt is maximally memory-hard
• Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions
• Sustained space complexity
• Symmetrically and asymmetrically hard cryptography
• The Discrete Logarithm problem with preprocessing
• Time space tradeoffs for attacks against one-way functions and PRGs
• Variations on the Erdős distinct-sums problem

Cited in

(4)

• Space-lock puzzles and verifiable space-hard functions from root-finding in sparse polynomials
• A public key cryptosystem using matrix over the finite ring
• Space-deniable proofs
• Provably memory-hard proofs of work with memory-easy verification

This page was built for publication: Trapdoor memory-hard functions

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