Scrypt Is Maximally Memory-Hard

No abstract is available for this paper.

• Publication year

  2017

• Venue

  International Conference on the Theory and Application of Cryptographic Techniques

• Publication date

  2017-04-30

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-56617-7_2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited

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

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

  2016influential reference
• On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model

  2016cited by this paper
• The scrypt Password-Based Key Derivation Function

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

  2015influential reference
• Proofs of Space

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

  2009influential reference
• Moderately hard, memory-bound functions

  2005cited by this paper
• Pebbling and Proofs of Work

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

  2003cited by this paper
• CAPTCHA: Using Hard AI Problems for Security

  2003cited by this paper
• PROOFS OF WORK AND BREAD PUDDING PROTOCOLS (EXTENDED ABSTRACT)

  1999cited by this paper
• Proofs of Work and Bread Pudding Protocols

  1999cited by this paper
• Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks

  1999cited by this paper
• Auditable metering with lightweight security

  1997cited by this paper
• Time-lock Puzzles and Timed-release Crypto

  1996cited by this paper
• Probability Inequalities for Sums of Bounded Random Variables

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

  1992cited by this paper

• Review of covert communication technology based on digital cryptocurrency

  2026cites this paper
• Multi-Instance Unrecoverability of iMHF-Based Password Hashing

  2026cites this paper
• Structural Rule-Driven Password Recovery with Multi-GPU Parallelization Techniques

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

  2025influential citation
• A Systematic Literature Review of Secure Instant Messaging Applications from a Digital Forensics Perspective

  2025cites this paper
• A Tight Lower Bound on the TdScrypt Trapdoor Memory-Hard Function

  2025cites this paper
• Trapdoor Memory-Hard Functions

  2024cites this paper
• Secure Account Recovery for a Privacy-Preserving Web Service

  2024cites this paper
• Software-Based Memory Erasure with Relaxed Isolation Requirements

  2024cites this paper
• Individual Cryptography

  2023cites this paper
• Instant Function Calls Using Synchronized Cross-Blockchain Smart Contracts

  2023cites this paper
• Cumulative Memory Lower Bounds for Randomized and Quantum Computation

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

  2023cites this paper
• Quantum-resistant Blockchain Cryptography-based Smart City Transactions

  2023influential citation
• Checking Passwords on Leaky Computers: A Side Channel Analysis of Chrome's Password Leak Detect Protocol

  2023cites this paper
• DuckyZip: Provably Honest Global Linking Service

  2023cites this paper
• Flexible Password-Based Encryption: Securing Cloud Storage and Provably Resisting Partitioning-Oracle Attacks

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

  2022cites this paper
• CUSTOMIZATION SOLUTION FOR SCRYPT KEY DERIVATION TO IMPROVE THE SECURITY OF STORED DATA

  2022cites this paper
• Protecting User Credentials against SQL Injection through Cryptography and Image Steganography

  2022influential citation
• A Secure Two-Factor Authentication Scheme From Password-Protected Hardware Tokens

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

  2022influential citation
• Analysis on Blockchain Consensus Mechanism Based on Proof of Work and Proof of Stake

  2022cites this paper
• Quantum-Resistant Password-Based Threshold Single-Sign-On Authentication with Updatable Server Private Key

  2022cites this paper
• How to Prove Work: With Time or Memory

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

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

  2021cites this paper
• Novel Template Protection Scheme for Multimodal Data

  2021cites this paper
• R AND C HAIN : A Scalable and Fair Decentralised Randomness Beacon

  2021cites this paper
• Characterizing Ethereum’s Mining Power Decentralization at a Deeper Level

  2021cites this paper
• Quantum Advantage on Proof of Work

  2021cites this paper
• On the Hardness of Massively Parallel Computation

  2020influential citation
• A flexible method to defend against computationally resourceful miners in blockchain proof of work

  2020cites this paper
• Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications

  2020cites this paper
• Evaluating memory-hard proof-of-work algorithms on three processors

  2020cites this paper
• zkRelay: Facilitating Sidechains using zkSNARK-based Chain-Relays

  2020cites this paper
• SPARKs: Succinct Parallelizable Arguments of Knowledge

  2020cites this paper
• New Techniques in Replica Encodings with Client Setup

  2020cites this paper
• RandChain: Decentralised Randomness Beacon from Sequential Proof-of-Work

  2020cites this paper
• Information Signaling: A Counter-Intuitive Defense Against Password Cracking

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

  2020cites this paper
• Password Strength Signaling: A Counter-Intuitive Defense Against Password Cracking

  2020cites this paper
• Foundations, Properties, and Security Applications of Puzzles

  2019cites this paper
• Retrofitting a two-way peg between blockchains

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

  2019cites this paper
• Cryptocurrency Egalitarianism: A Quantitative Approach

  2019cites this paper
• AMOGAP: Defending Against Man-in-the-Middle and Offline Guessing Attacks on Passwords

  2019cites this paper
• Blockchain Federation for Complex Distributed Applications

  2019cites this paper
• Practical Password Hardening Based on TLS

  2019cites this paper
• Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space

  2019cites this paper
• Zero-Knowledge Proof-of-Identity: Sybil-Resistant, Anonymous Authentication on Permissionless Blockchains and Incentive Compatible, Strictly Dominant Cryptocurrencies

  2019cites this paper
• Tight Time-Memory Trade-o ↵ s for Symmetric Encryption ‹

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

  2019cites this paper
• Full disk encryption and beyond

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

  2019cites this paper
• Towards Secure Computation with Optimal Complexity

  2019cites this paper
• Enhancing Password Security Using a Hybrid Approach of SCrypt Hashing and AES Encryption

  2019cites this paper
• Attainable Hacks on Keystore Files in Ethereum Wallets - A Systematic Analysis

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

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

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

  2018cites this paper
• Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries

  2018cites this paper
• A Memory-Hard Blockchain Protocol

  2018cites this paper
• Proofs of Catalytic Space

  2018cites this paper
• PASTA: PASsword-based Threshold Authentication

  2018cites this paper
• Just In Time Hashing

  2018cites this paper
• Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash Chains

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

  2018cites this paper
• On Resilient Password-Based Key Derivation Functions

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

  2018influential citation
• Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions

  2017cites this paper
• Bandwidth Hard Functions for ASIC Resistance

  2017influential citation
• Symmetrically and Asymmetrically Hard Cryptography

  2017influential citation
• Symmetrically and Asymmetrically Hard Cryptography ( Full Version ) *

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

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

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

  2017influential citation
• Sustained Space Complexity

  2017cites this paper
• Harden Zero Knowledge Password Proofs Against Offline Dictionary Attacks

  2016cites this paper
• PassPro: A Secure Password-based Authentication Mechanism using SHF

  year unknowncites this paper
• from Cryptographic Primitives

  year unknowncites this paper