Balloon Hashing: Provably Space-Hard Hash Functions with Data-Independent Access Patterns

No abstract is available for this paper.

• Publication year

  2016

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• SpaceMint: A Cryptocurrency Based on Proofs of Space

  2018cited by this paper
• Handbook of Applied Cryptography

  2018cited by this paper
• New Wine into Old Wineskins: A Survey of Some Pebbling Classics with Supplemental Results

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

  2015cited by this paper
• SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies

  2015cited by this paper
• Proofs of Space

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

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

  2015cited by this paper
• Block Ciphers - Focus on the Linear Layer (feat. PRIDE)

  2014cited by this paper
• The M AKWA Password Hashing Function Specifications v1.0

  2014cited by this paper
• Cuckoo Cycle: a memory-hard proof-of-work system

  2014cited by this paper
• Lyra: password-based key derivation with tunable memory and processing costs

  2014cited by this paper
• Are Your Passwords Safe: Energy-Efficient Bcrypt Cracking with Low-Cost Parallel Hardware

  2014cited by this paper
• Proofs of Space: When Space Is of the Essence

  2014cited by this paper
• Catena : A Memory-Consuming Password-Scrambling Framework

  2014influential reference
• Near-linear time, Leakage-resilient Key Evolution Schemes from Expander Graphs

  2013cited by this paper
• BLAKE2: Simpler, Smaller, Fast as MD5

  2013cited by this paper
• Just a Pebble Game

  2013cited by this paper
• Does my password go up to eleven?: the impact of password meters on password selection

  2013cited by this paper
• Useful password hashing: how to waste computing cycles with style

  2013cited by this paper
• Multi-instance Security and Its Application to Password-Based Cryptography

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

  2012cited by this paper
• Guessing human-chosen secrets

  2012cited by this paper
• Candidate One-Way Functions Based on Expander Graphs

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

  2011cited by this paper
• Of passwords and people: measuring the effect of password-composition policies

  2011cited by this paper
• Models of Computation

  2011cited by this paper
• Efficient Cache Attacks on AES, and Countermeasures

  2010cited by this paper
• Popularity Is Everything: A New Approach to Protecting Passwords from Statistical-Guessing Attacks

  2010cited 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
• The Salsa20 Family of Stream Ciphers

  2008cited by this paper
• SHA-3 Proposal: ECHO

  2008cited by this paper
• Cache-Collision Timing Attacks Against AES

  2006cited by this paper
• Cache Attacks and Countermeasures: The Case of AES

  2006influential reference
• Mitigating Dictionary Attacks on Password-Protected Local Storage

  2006cited by this paper
• Perfectly Secure Password Protocols in the Bounded Retrieval Model

  2006cited by this paper
• Merkle-Damgård Revisited: How to Construct a Hash Function

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

  2005cited by this paper
• Pebbling and Proofs of Work

  2005cited by this paper
• Systematic MDS erasure codes based on Vandermonde matrices

  2004cited by this paper
• An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem

  2004cited by this paper
• Making a Faster Cryptanalytic Time-Memory Trade-Off

  2003cited by this paper
• On the (In)security of the Fiat-Shamir paradigm

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

  2003cited by this paper
• Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case

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

  2002cited by this paper
• Proofs of Security for the Unix Password Hashing Algorithm

  2000cited by this paper
• The random oracle methodology, revisited

  2000cited by this paper
• PKCS #5: Password-Based Cryptography Specification Version 2.0

  2000cited by this paper
• Models of Computation: Exploring the Power of Computing

  1998cited by this paper
• A Remark on Matrix Rigidity

  1997cited by this paper
• Secure Applications of Low-Entropy Keys

  1997cited by this paper
• An XOR-based erasure-resilient coding scheme

  1995cited by this paper
• Improving system security via proactive password checking

  1995cited by this paper
• Complexity of multiplication with vectors for structured matrices

  1994cited by this paper
• Random oracles are practical: a paradigm for designing efficient protocols

  1993cited by this paper
• Foiling the cracker: A survey of, and improvements to, password security

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

  1992cited by this paper
• UNIX Password Encryption Considered Insecure

  1991cited by this paper
• UNIX Password Security - Ten Years Later

  1989cited by this paper
• One Way Hash Functions and DES

  1989cited by this paper
• A Design Principle for Hash Functions

  1989cited by this paper
• Time/Space Trade-Offs for Reversible Computation

  1989cited by this paper
• Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform on any General Sequential Random-Access Computer

  1984cited by this paper
• A cryptanalytic time-memory trade-off

  1980cited by this paper
• Password security: a case history

  1979cited by this paper
• Relations Among Complexity Measures

  1979cited by this paper
• Time-space tradeoffs for computing functions, using connectivity properties of their circuits

  1978cited by this paper
• A Time-Space Trade-Off

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

  1977influential reference
• Graph-Theoretic Arguments in Low-Level Complexity

  1977cited by this paper
• On Time Versus Space

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

  1976cited by this paper
• On non-linear lower bounds in computational complexity

  1975cited by this paper
• A user authentication scheme not requiring secrecy in the computer

  1974cited by this paper
• Complete register allocation problems

  1973cited by this paper
• On the complexity of a concentrator

  1973cited by this paper
• Theory of Error-correcting Codes

  year unknowncited by this paper
• The Advanced Computing Systems Association a Future-adaptable Password Scheme a Future-adaptable Password Scheme

  year unknowncited by this paper

• Wrangling Entropy: Next-Generation Multi-Factor Key Derivation, Credential Hashing, and Credential Generation Functions

  2025cites this paper
• Tight Proofs of Space and Replication

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

  2018influential citation
• Just In Time Hashing

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

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

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

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

  2017cites this paper
• Per-session security: Password-based cryptography revisited

  2017cites this paper
• Quantum Operating Systems

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

  2017influential citation
• Efficiently Computing Data-Independent Memory-Hard Functions

  2016cites this paper
• Securing Bitcoin-like Backbone Protocols against a Malicious Majority of Computing Power

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

  2016cites this paper
• Proof of Space from Stacked Expanders

  2016influential citation
• 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
• Argon 2 : the memory-hard function for password hashing and other applications

  2015cites this paper