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

DOI10.1007/978-3-030-03807-6_2zbMath1443.94055OpenAlexW2898652484MaRDI QIDQ1629397

Sunoo Park, Quanquan C. Liu, Thaddeus Dryja

Publication date: 11 December 2018

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Parallelizable delegation from LWE

Cites Work

• Corrigendum to ``Time-space tradeoffs for computing functions, using connectivity properties of their circuits
• 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
• Inapproximability of the standard pebble game and hard to pebble graphs
• 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
• One-Time Computable Self-erasing Functions
• Proofs of Space
• Public-Key Encryption in the Bounded-Retrieval Model
• Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
• Time/Space Trade-Offs for Reversible Computation
• The Pebbling Problem is Complete in Polynomial Space
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Complete Register Allocation Problems
• On Time Versus Space
• Cumulative Space in Black-White Pebbling and Resolution
• Bounds on Monotone Switching Networks for Directed Connectivity
• Survey: Leakage Resilience and the Bounded Retrieval Model
• Depth-Robust Graphs and Their Cumulative Memory Complexity
• Scrypt Is Maximally Memory-Hard
• On the Indifferentiability of the Sponge Construction
• On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
• Theory of Cryptography
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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