Moderately hard, memory-bound functions

No abstract is available for this paper.

• Publication year

  2005

• Venue

  TOIT

• Publication date

  2005-05-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/1064340.1064341
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Handbook of Applied Cryptography

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

  2003cited by this paper
• Bankable Postage for Network Services

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

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

  2003cited by this paper
• A Cryptanalytic Time-Memory Tradeoff: First FPGA Implementation

  2002cited by this paper
• A Time-Memory Tradeoff Using Distinguished Points: New Analysis & FPGA Results

  2002cited by this paper
• Client puzzles: A cryptographic defense against connection depletion

  1999cited by this paper
• Private communication

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

  1999cited by this paper
• Rigorous Time/Space Trade-offs for Inverting Functions

  1999cited by this paper
• Curbing Junk E-Mail via Secure Classification

  1998cited by this paper
• Strengthening Passwords

  1997cited by this paper
• Refereed paper: A simple scheme to make passwords based on one-way functions much harder to crack

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

  1996influential reference
• Pricing via Processing or Combatting Junk Mail

  1992cited by this paper
• Random Mapping Statistics

  1990cited by this paper
• A model for hierarchical memory

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

  1980cited by this paper
• Secure communications over insecure channels

  1978cited by this paper

• EnergyBench: Holistic Benchmark for Correct and Energy-Efficient LLM-Generated Code

  2025cites this paper
• Throttling Web Agents Using Reasoning Gates

  2025cites this paper
• Improve Parallel Resistance of Hashcash Tree

  2024cites this paper
• Defending hash tables from algorithmic complexity attacks with resource burning

  2024cites this paper
• Defending Hash Tables from Subterfuge with Depth Charge

  2023cites this paper
• The Memory-Bounded Speedup Model and Its Impacts in Computing

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

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

  2023cites this paper
• What is the Cryptocurrency? Is it a Threat to Our National Security, Domestically and Globally?

  2022cites this paper
• DoS Attacks on Blockchain Ecosystem

  2022cites this paper
• Bankrupting DoS Attackers Despite Uncertainty

  2022cites this paper
• Bankrupting DoS Attackers

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

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

  2021influential citation
• A Systematic Survey on Security Concerns in Cryptocurrencies: State-of-the-Art and Perspectives

  2021cites this paper
• Formalizing swarm security

  2021cites this paper
• Client Puzzle Protocols as Countermeasure Against Automated Threats to Web Applications

  2021cites this paper
• Non-Interactive VDF Client Puzzle for DoS Mitigation

  2021cites this paper
• Proof-of-Learning: Definitions and Practice

  2021cites this paper
• ASIC-Resistant Proof of Work Based on Power Analysis of Low-End Microcontrollers

  2020cites this paper
• Resource Burning for Permissionless Systems (Invited Paper)

  2020cites this paper
• Pixy: A Privacy-Increasing Group Creation Scheme

  2020influential citation
• Bobtail: Improved Blockchain Security with Low-Variance Mining

  2020cites this paper
• Network Security Final Report Memory Bound Client Puzzles

  2020influential citation
• Distributed Random Number Generator on Hedera Hashgraph

  2020cites this paper
• Fair and Sound Secret Sharing from Homomorphic Time-Lock Puzzles

  2020cites this paper
• Multi-Party Timed Commitments

  2020cites this paper
• ArchiveSafe: Mass-Leakage-Resistant Storage from Proof-of-Work

  2020cites this paper
• Resource Burning for Permissionless Systems

  2020cites this paper
• IoT Expunge: Implementing Verifiable Retention of IoT Data

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

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

  2019influential citation
• Factors that Impact Blockchain Scalability

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

  2019cites this paper
• Deconstructing Blockchains: A Comprehensive Survey on Consensus, Membership and Structure

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

  2019cites this paper
• Toward Bounds on Parallel Execution Times of Task Graphs on Multicores With Memory Constraints

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

  2019cites this paper
• Blokzincir Teknolojisi: Uzlaşma Protokolleri

  2019cites this paper
• Constructing an Adversary Solver for Equihash

  2019cites this paper
• An (Almost) Constant-E ort Solution-Veri cation Proof-of-Work Protocol based on Merkle Trees

  2018cites this paper
• Revisiting Client Puzzles for State Exhaustion Attacks Resilience

  2018cites this paper
• Blockchain and CSCW - Shall we care?

  2018cites this paper
• Exonum: Byzantine fault tolerant protocol for blockchains

  2018cites this paper
• How to end password reuse on the web

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

  2018cites this paper
• Egalitarian computing (MTP 1.2)

  2018cites this paper
• Bobtail: A Proof-of-Work Target that Minimizes Blockchain Mining Variance (Draft)

  2017cites this paper
• Bandwidth Hard Functions for ASIC Resistance

  2017cites this paper
• Adaptive Counteraction Against Denial of Service Attack

  2017cites this paper
• A Ringer-Based Throttling Approach to Mitigate DDoS Attacks

  2017cites this paper
• Blockchains: Distributed Consensus Protocols

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

  2017influential citation
• Itsuku: a Memory-Hardened Proof-of-Work Scheme

  2017cites this paper
• Economic Levers for Mitigating Interest Flooding Attack in Named Data Networking

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

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

  2017cites this paper
• Using MinMax-Memory Claims to Improve In-Memory Workflow Computations in the Cloud

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

  2017cites this paper
• Sustained Space Complexity

  2017cites this paper
• Scrypt Is Maximally Memory-Hard

  2017cites this paper
• Reducing distributed denial of service (DDoS) attacks using client puzzle mechanism

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

  2017cites this paper
• Advances in public-key cryptology and computer exploitation. (Avancées en cryptologie à clé publique et exploitation informatique)

  2017cites this paper
• Remote data integrity checking with server-side repair

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

  2017cites this paper
• Egalitarian Computing

  2016cites this paper
• Denial-of-Service Prevention for Software-Defined Network Controllers

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

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

  2016cites this paper
• Bitcoin and Beyond: A Technical Survey on Decentralized Digital Currencies

  2016cites this paper
• Advances in Cryptology – CRYPTO 2016

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

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

  2016cites this paper
• A survey on resource inflated Denial of Service attack defense mechanisms

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

  2016cites this paper
• Protecting Controllers against Denial-of-Service Attacks in Software-Defined Networks

  2016influential citation
• Balloon Hashing : a Provably Memory-Hard Function with a Data-Independent Access Pattern

  2016cites this paper
• Towards trustworthy social computing systems

  2016cites this paper
• Proof of Space from Stacked Expanders

  2016cites this paper
• New Integrated Approach for Mitigating DDOS Attacks

  2016cites this paper
• SENTRY: A Novel Approach for Mitigating Application Layer DDoS Threats

  2016cites this paper
• The Catena Password-Scrambling Framework

  2015cites this paper
• Slow Motion Zero Knowledge Identifying with Colliding Commitments

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

  2015cites this paper
• An Enhancement on Request Rate-Time-Bandwidth for Limiting Replay Attack in MANET

  2015cites this paper
• Proofs of Space

  2015cites this paper
• Tradeoff Cryptanalysis of Memory-Hard Functions

  2015cites this paper
• Defeating DDoS using Productive Puzzles

  2015cites this paper
• A novel puzzle-based framework for mitigating distributed denial of service attacks against internet applications

  2015influential citation
• The Catena Password-Scrambling Framework 2 nd Round of the Password Hashing Competition ( PHC )

  2015cites this paper
• Improving Dependability of Networks with Penalty and Revocation Mechanisms

  2014cites this paper
• The Catena Password-Scrambling Framework Submission to the Password Hashing Competition ( PHC )

  2014cites this paper
• The Catena Password Scrambler Submission to the Password Hashing Competition ( PHC )

  2014cites this paper
• New directions for remote data integrity checking of cloud storage

  2014cites this paper
• Using Spammers' Computing Resources for Volunteer Computing

  2014cites this paper
• A Survey of DDOS Attacks in TCP/IP Stack

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

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

  2014influential citation
• Thesis for the Degree of Doctor of Philosophy Improving Community Detection Methods for Network Data Analysis

  2014cites this paper