Bandwidth-Hard Functions: Reductions and Lower Bounds

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Journal of Cryptology

• Publication date

  2018-10-08

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00145-024-09497-3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The memory-hard Argon2 password hash and proof-of-work function

  2020influential reference
• Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions

  2019cited by this paper
• On the Economics of Offline Password Cracking

  2018cited by this paper
• Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions

  2017influential reference
• Red-blue and standard pebble games : complexity and applications in the sequential and parallel models

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

  2017influential reference
• Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs

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

  2017influential reference
• Bandwidth Hard Functions for ASIC Resistance

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

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

  2017influential reference
• Cumulative Space in Black-White Pebbling and Resolution

  2017cited by this paper
• Argon2: New Generation of Memory-Hard Functions for Password Hashing and Other Applications

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

  2016influential reference
• Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks

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

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

  2015influential reference
• Fast and Tradeoff-Resilient Memory-Hard Functions for Cryptocurrencies and Password Hashing

  2015cited by this paper
• Catena: A Memory-Consuming Password Scrambler

  2013influential reference
• Key-Evolution Schemes Resilient to Space-Bounded Leakage

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

  2011cited by this paper
• Bitcoin : A Peer-to-Peer Electronic Cash System

  2009influential reference
• STRONGER KEY DERIVATION VIA SEQUENTIAL MEMORY-HARD FUNCTIONS

  2009influential reference
• Moderately hard, memory-bound functions

  2005cited by this paper
• I Computational Complexity

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

  2005cited by this paper
• Hashcash - A Denial of Service Counter-Measure

  2002cited by this paper
• Pricing via Processing or Combatting Junk Mail

  1992cited by this paper
• A simplified NP-complete satisfiability problem

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

  1983influential reference
• I/O complexity: The red-blue pebble game

  1981cited by this paper
• The pebbling problem is complete in polynomial space

  1979influential reference
• Time-space trade-offs in a pebble game

  1977cited by this paper

• The Impact of Partial Computations on the Red-Blue Pebble Game

  2025cites this paper
• Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions

  2025cites this paper
• Dataflow-Specific Algorithms for Resource-Constrained Scheduling and Memory Design

  2025cites this paper
• Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs

  2024cites this paper
• Trapdoor Memory-Hard Functions

  2024cites this paper
• MagTracer: Detecting GPU Cryptojacking Attacks via Magnetic Leakage Signals

  2023cites this paper
• PURED: A unified framework for resource-hard functions

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

  2022influential citation
• Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications

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

  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
• On the Hardness of Red-Blue Pebble Games

  2020cites this paper
• On the Security of Proofs of Sequential Work in a Post-Quantum World

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

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

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

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

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

  2018cites this paper