Static-memory-hard functions, and modeling the cost of space vs. time
From MaRDI portal
Publication:1629397
Recommendations
Cites work
- scientific article; zbMATH DE number 3167451 (Why is no real title available?)
- scientific article; zbMATH DE number 3877077 (Why is no real title available?)
- scientific article; zbMATH DE number 3765164 (Why is no real title available?)
- scientific article; zbMATH DE number 3478425 (Why is no real title available?)
- scientific article; zbMATH DE number 3597878 (Why is no real title available?)
- scientific article; zbMATH DE number 3622921 (Why is no real title available?)
- scientific article; zbMATH DE number 3628386 (Why is no real title available?)
- scientific article; zbMATH DE number 3640911 (Why is no real title available?)
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- Bandwidth hard functions for ASIC resistance
- Beyond Hellman's time-memory trade-offs with applications to proofs of space
- Big-key symmetric encryption: resisting key exfiltration
- Bounds on Monotone Switching Networks for Directed Connectivity
- Complete Register Allocation Problems
- Corrigendum to ``Time-space tradeoffs for computing functions, using connectivity properties of their circuits
- Cumulative space in black-white pebbling and resolution
- Depth-robust graphs and their cumulative memory complexity
- Efficiently computing data-independent memory-hard functions
- High Parallel Complexity Graphs and Memory-Hard Functions
- Inapproximability of the standard pebble game and hard to pebble graphs
- Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
- Moderately hard functions: definition, instantiations, and applications
- On Time Versus Space
- On the Indifferentiability of the Sponge Construction
- On the Relative Strength of Pebbling and Resolution
- On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model
- On the computational complexity of minimal cumulative cost graph pebbling
- On the depth-robustness and cumulative pebbling cost of Argon2i
- One-time computable self-erasing functions
- Proofs of space
- Public-key encryption in the bounded-retrieval model
- Scrypt is maximally memory-hard
- Survey: leakage resilience and the bounded retrieval model
- Sustained space complexity
- The Pebbling Problem is Complete in Polynomial Space
- Theory of Cryptography
- Theory of Cryptography
- Theory of cryptography. Third theory of cryptography conference, TCC 2006, New York, NY, USA, March 4--7, 2006. Proceedings.
- Time/Space Trade-Offs for Reversible Computation
- Tradeoff Cryptanalysis of Memory-Hard Functions
Cited in
(14)- Parallelizable delegation from LWE
- PURED: a unified framework for resource-hard functions
- Memory-hard functions from cryptographic primitives
- Space-time trade-offs for stack-based algorithms
- Memory-demanding password scrambling
- Denseness of volatile and nonvolatile sequences of functions
- Balloon hashing: a memory-hard function providing provable protection against sequential attacks
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- Bandwidth hard functions for ASIC resistance
- Cost-asymmetric memory hard password hashing
- Cost-asymmetric memory hard password hashing
- Beyond Hellman's time-memory trade-offs with applications to proofs of space
- Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions
- 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)
