Static-memory-hard functions, and modeling the cost of space vs. time

DOI10.1007/978-3-030-03807-6_2zbMATH Open1443.94055OpenAlexW2898652484MaRDI QIDQ1629397FDOQ1629397

Authors: Thaddeus Dryja, Quanquan C. Liu, Sunoo Park 

Publication date: 11 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_2

Recommendations

• Tradeoff Cryptanalysis of Memory-Hard Functions
• Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions
• Sustained space complexity
• Data-independent memory hard functions: new attacks and stronger constructions
• Memory-hard functions from cryptographic primitives

zbMATH Keywords

hash functionsgraph pebblinglarge-scale password-cracking attacksmemory-hardness in cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• On the Indifferentiability of the Sponge Construction
• Survey: leakage resilience and the bounded retrieval model
• Title not available (Why is that?)
• Public-key encryption in the bounded-retrieval model
• Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
• Theory of Cryptography
• Theory of Cryptography
• On Time Versus Space
• Title not available (Why is that?)
• Complete Register Allocation Problems
• One-time computable self-erasing functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Proofs of space
• Time/Space Trade-Offs for Reversible Computation
• Inapproximability of the standard pebble game and hard to pebble graphs
• The Pebbling Problem is Complete in Polynomial Space
• Title not available (Why is that?)
• Corrigendum to ``Time-space tradeoffs for computing functions, using connectivity properties of their circuits
• Title not available (Why is that?)
• Sustained space complexity
• On the depth-robustness and cumulative pebbling cost of Argon2i
• Bandwidth hard functions for ASIC resistance
• Moderately hard functions: definition, instantiations, and applications
• Beyond Hellman's time-memory trade-offs with applications to proofs of space
• Theory of cryptography. Third theory of cryptography conference, TCC 2006, New York, NY, USA, March 4--7, 2006. Proceedings.
• On the computational complexity of minimal cumulative cost graph pebbling
• Tradeoff Cryptanalysis of Memory-Hard Functions
• Efficiently computing data-independent memory-hard functions
• Big-key symmetric encryption: resisting key exfiltration
• High Parallel Complexity Graphs and Memory-Hard Functions
• On the Relative Strength of Pebbling and Resolution
• Title not available (Why is that?)
• Cumulative space in black-white pebbling and resolution
• Bounds on Monotone Switching Networks for Directed Connectivity
• Depth-robust graphs and their cumulative memory complexity
• Scrypt is maximally memory-hard
• On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model

Cited In (12)

• 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
• Denseness of volatile and nonvolatile sequences of functions
• Parallelizable delegation from LWE
• Bandwidth hard functions for ASIC resistance
• Beyond Hellman's time-memory trade-offs with applications to proofs of space
• Cost-asymmetric memory hard password hashing
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• Memory-demanding password scrambling
• Space-time trade-offs for stack-based algorithms
• Memory-hard functions from cryptographic primitives
• Symmetrically and asymmetrically hard cryptography

This page was built for publication: Static-memory-hard functions, and modeling the cost of space vs. time

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