Static-memory-hard functions, and modeling the cost of space vs. time
type: Item
instance of: scholarly article
title: Static-memory-hard functions, and modeling the cost of space vs. time
zbMATH Open document ID: 1443.94055
DOI: 10.1007/978-3-030-03807-6_2
author: Thaddeus Dryja
author: Quanquan C. Liu
author: Sunoo Park
publication date: 2018-12-11T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6992086
zbMATH Keywords: memory-hardness in cryptography
zbMATH Keywords: hash functions
zbMATH Keywords: large-scale password-cracking attacks
zbMATH Keywords: graph pebbling
MaRDI profile type: Publication
full work available at URL: 978-3-030-03807-6 2
OpenAlex ID: W2898652484
cites work: Beyond Hellman's time-memory trade-offs with applications to proofs of space
cites work: Efficiently Computing Data-Independent Memory-Hard Functions
cites work: Depth-Robust Graphs and Their Cumulative Memory Complexity
cites work: Sustained space complexity
cites work: On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
cites work: Scrypt Is Maximally Memory-Hard
cites work: Public-Key Encryption in the Bounded-Retrieval Model
cites work: Cumulative Space in Black-White Pebbling and Resolution
cites work: Survey: Leakage Resilience and the Bounded Retrieval Model
cites work: High Parallel Complexity Graphs and Memory-Hard Functions
cites work: Moderately hard functions: definition, instantiations, and applications
cites work: On the Indifferentiability of the Sponge Construction
cites work: Time/Space Trade-Offs for Reversible Computation
cites work: Tradeoff Cryptanalysis of Memory-Hard Functions
cites work: Big-Key Symmetric Encryption: Resisting Key Exfiltration
cites work: On the computational complexity of minimal cumulative cost graph pebbling
cites work: On the depth-robustness and cumulative pebbling cost of Argon2i
cites work: Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
cites work: Theory of Cryptography
cites work: Q4061993
cites work: Q4199563
cites work: Proofs of Space
cites work: One-Time Computable Self-erasing Functions
cites work: Inapproximability of the standard pebble game and hard to pebble graphs
cites work: Q3285941
cites work: The Pebbling Problem is Complete in Polynomial Space
cites work: On Time Versus Space
cites work: Theory of cryptography. Third theory of cryptography conference, TCC 2006, New York, NY, USA, March 4--7, 2006. Proceedings.
cites work: Asymptotically tight bounds on time-space trade-offs in a pebble game
cites work: Q3342347
cites work: On the Relative Strength of Pebbling and Resolution
cites work: Q4185781
cites work: Q3947137
cites work: Bounds on Monotone Switching Networks for Directed Connectivity
cites work: Bandwidth hard functions for ASIC resistance
cites work: Complete Register Allocation Problems
cites work: Q4190139
cites work: Corrigendum to ``Time-space tradeoffs for computing functions, using connectivity properties of their circuits''
cites work: Q4164821
description: scientific article; zbMATH DE number 6992086