Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions

No abstract is available for this paper.

• Publication year

  2017

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  2017-10-30

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/3133956.3134031
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the Memory-Hardness of Data-Independent Password-Hashing Functions

  2018cited by this paper
• On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i

  2017influential reference
• Bandwidth Hard Functions for ASIC Resistance

  2017cited by this paper
• Cumulative Space in Black-White Pebbling and Resolution

  2017cited by this paper
• Scrypt Is Maximally Memory-Hard

  2017cited by this paper
• Towards Practical Attacks on Argon2i and Balloon Hashing

  2017influential reference
• Depth-Robust Graphs and Their Cumulative Memory Complexity

  2017influential reference
• Sustained Space Complexity

  2017cited by this paper
• Moderately Hard Functions: Definition, Instantiations, and Applications

  2017cited by this paper
• Proof of Space from Stacked Expanders

  2016cited by this paper
• Balloon Hashing: Provably Space-Hard Hash Functions with Data-Independent Access Patterns

  2016cited by this paper
• On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling

  2016cited by this paper
• Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks

  2016cited by this paper
• Efficiently Computing Data-Independent Memory-Hard Functions

  2016influential reference
• Argon2: New Generation of Memory-Hard Functions for Password Hashing and Other Applications

  2016cited by this paper
• Tradeoff Cryptanalysis of Memory-Hard Functions

  2015cited by this paper
• Proofs of Space

  2015cited by this paper
• High Parallel Complexity Graphs and Memory-Hard Functions

  2015influential reference
• Lyra: password-based key derivation with tunable memory and processing costs

  2014cited by this paper
• Rig: A simple, secure and flexible design for Password Hashing

  2014cited by this paper
• Publicly verifiable proofs of sequential work

  2013influential reference
• Catena: A Memory-Consuming Password Scrambler

  2013cited by this paper
• One-Time Computable Self-erasing Functions

  2011cited by this paper
• STRONGER KEY DERIVATION VIA SEQUENTIAL MEMORY-HARD FUNCTIONS

  2009cited by this paper
• Moderately hard, memory-bound functions

  2005cited by this paper
• Pebbling and Proofs of Work

  2005cited by this paper
• Cache-timing attacks on AES

  2005cited by this paper
• On Memory-Bound Functions for Fighting Spam

  2003cited by this paper
• On depth-reduction and grates

  1983cited by this paper
• A Family of Graphs with Expensive Depth Reduction

  1981cited by this paper
• Graph-Theoretic Arguments in Low-Level Complexity

  1977influential reference
• Space bounds for a game on graphs

  1976cited by this paper
• On sparse graphs with dense long paths.

  1975influential reference
• An observation on time-storage trade off

  1973cited by this paper
• Record of the Project MAC conference on concurrent systems and parallel computation

  1970cited by this paper

• A Tight Lower Bound on the TdScrypt Trapdoor Memory-Hard Function

  2025cites this paper
• Towards Practical Data-Dependent Memory-Hard Functions with Optimal Sustained Space Trade-offs in the Parallel Random Oracle Model

  2025influential citation
• Software-Based Memory Erasure with Relaxed Isolation Requirements

  2024cites this paper
• A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction

  2024cites this paper
• The Impact of Reversibility on Parallel Pebbling

  2024cites this paper
• Trapdoor Memory-Hard Functions

  2024cites this paper
• Computationally Relaxed Locally Decodable Codes, Revisited

  2023cites this paper
• Blockchain technology in healthcare: A systematic review

  2022cites this paper
• Bandwidth-Hard Functions from Random Permutations

  2022cites this paper
• Cost-Asymmetric Memory Hard Password Hashing

  2022cites this paper
• Sustained Space and Cumulative Complexity Trade-offs for Data-Dependent Memory-Hard Functions

  2022influential citation
• Towards a Rigorous Statistical Analysis of Empirical Password Datasets

  2021influential citation
• The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs

  2021cites this paper
• Verifiable Capacity-bound Functions: A New Primitive from Kolmogorov Complexity

  2021cites this paper
• DAHash: Distribution Aware Tuning of Password Hashing Costs

  2021cites this paper
• On Explicit Constructions of Extremely Depth Robust Graphs

  2021cites this paper
• Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of iMHFs

  2021cites this paper
• The Impact of Blockchain on the Healthcare Environment

  2021cites this paper
• Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes

  2021cites this paper
• Locally Decodable/Correctable Codes for Insertions and Deletions

  2020cites this paper
• A Survey of Blockchain-Based Strategies for Healthcare

  2020cites this paper
• On Locally Decodable Codes in Resource Bounded Channels

  2019cites this paper
• PIEs: Public Incompressible Encodings for Decentralized Storage

  2019influential citation
• Tight Proofs of Space and Replication

  2019cites this paper
• Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions

  2019cites this paper
• Approximating Cumulative Pebbling Cost is Unique Games Hard

  2019cites this paper
• Demystifying Crypto-Mining: Analysis and Optimizations of Memory-Hard PoW Algorithms

  2019cites this paper
• On Explicit Depth Robust Graphs

  2019cites this paper
• Memory-Hard Functions from Cryptographic Primitives

  2019cites this paper
• Relaxed Locally Correctable Codes in Computationally Bounded Channels*

  2019cites this paper
• A New Connection Between Node and Edge Depth Robust Graphs

  2019cites this paper
• Computationally Data-Independent Memory Hard Functions

  2019cites this paper
• Scaling Proof-of-Replication for Filecoin Mining

  2018cites this paper
• On the Economics of Offline Password Cracking

  2018cites this paper
• Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling

  2018cites this paper
• Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time

  2018cites this paper
• PoReps: Proofs of Space on Useful Data

  2018cites this paper
• On the Memory-Hardness of Data-Independent Password-Hashing Functions

  2018influential citation
• Proofs of Catalytic Space

  2018cites this paper
• Relaxed Locally Correctable Codes in Computationally Bounded Channels

  2018cites this paper
• Bandwidth-Hard Functions: Reductions and Lower Bounds

  2018influential citation
• Moderately Hard Functions: Definition, Instantiations, and Applications

  2017cites this paper
• On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i

  2017cites this paper
• Sustained Space Complexity

  2017cites this paper
• On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling

  2016cites this paper
• from Cryptographic Primitives

  year unknowncites this paper