Tradeoff Cryptanalysis of Memory-Hard Functions

No abstract is available for this paper.

• Publication year

  2015

• Venue

  International Conference on the Theory and Application of Cryptology and Information Security

• Publication date

  2015-11-29

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-662-48800-3_26
• 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 scrypt Password-Based Key Derivation Function

  2016cited by this paper
• yescrypt - a Password Hashing Competition submission

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

  2015cited by this paper
• Proof-of-Work as Anonymous Micropayment: Rewarding a Tor Relay

  2015cited by this paper
• Proofs of Space

  2015cited by this paper
• Memory-Demanding Password Scrambling

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

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

  2013influential reference
• BLAKE2: Simpler, Smaller, Fast as MD5

  2013influential reference
• Exploring DRAM organizations for energy-efficient and resilient exascale memories

  2013cited by this paper
• Changes in Federal Information Processing Standard (FIPS) 180-4, Secure Hash Standard

  2013cited by this paper
• Non-uniform cracks in the concrete: the power of free precomputation

  2013cited by this paper
• Speeding up GPU-based password cracking

  2012cited by this paper
• Lessons Learned from Designing a 65 nm ASIC for Evaluating Third Round SHA-3 Candidates

  2012influential reference
• Duplexing the sponge: single-pass authenticated encryption and other applications

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

  2009influential reference
• Hey, you, get off of my cloud: exploring information leakage in third-party compute clouds

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

  2008cited by this paper
• On the Effectiveness of TMTO and Exhaustive Search Attacks

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

  2005cited by this paper
• Pebbling and Proofs of Work

  2005influential reference
• On Memory-Bound Functions for Fighting Spam

  2003cited by this paper
• Area-time complexity for VLSI

  1979cited by this paper
• Time-space trade-offs in a pebble game

  1977cited by this paper
• On Time Versus Space

  1977cited by this paper
• Space bounds for a game on graphs

  1976cited by this paper

• Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation

  2023cites this paper
• Superword: A honeyword system for achieving higher security goals

  2021cites this paper
• Argon2 Memory-Hard Function for Password Hashing and Proof-of-Work Applications

  2021cites this paper
• Generation of Symmetric Key Using Randomness of Hash Function

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

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

  2019cites this paper
• Cryptanalytic time–memory trade-off for password hashing schemes

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

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

  2018cites this paper
• Egalitarian computing (MTP 1.2)

  2018influential citation
• Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time

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

  2018cites this paper
• Just In Time Hashing

  2018influential citation
• Bandwidth Hard Functions for ASIC Resistance

  2017influential citation
• Asymmetric proof-of-work based on the Generalized Birthday problem

  2017cites this paper
• Design and analysis of password based authentication systems

  2017influential citation
• Towards Practical Attacks on Argon2i and Balloon Hashing

  2017cites this paper
• Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions

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

  2017cites this paper
• Depth-Robust Graphs and Their Cumulative Memory Complexity

  2017cites this paper
• Design and Analysis of Cryptographic Algorithms for Authentication

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

  2016cites this paper
• Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem

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

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

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

  2016cites this paper
• Open Sesame: The Password Hashing Competition and Argon2

  2016cites this paper
• On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model

  2016cites this paper
• Egalitarian Computing

  2016influential citation
• Balloon Hashing: Provably Space-Hard Hash Functions with Data-Independent Access Patterns

  2016cites this paper
• Proof of Space from Stacked Expanders

  2016cites this paper
• Argon 2 : the memory-hard function for password hashing and other applications

  2015cites this paper
• Selecting a New Key Derivation Function for Disk Encryption

  2015cites this paper
• Performance Analysis of Some Password Hashing Schemes

  2015cites this paper
• Fast and Tradeoff-Resilient Memory-Hard Functions for Cryptocurrencies and Password Hashing

  2015influential citation