Defending hash tables from algorithmic complexity attacks with resource burning
From MaRDI portal
Publication:6614003
DOI10.1016/J.TCS.2024.114762MaRDI QIDQ6614003
Trisha Chakraborty, Jared Saia, Maxwell Young
Publication date: 7 October 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The random oracle model: a twenty-year retrospective
- In-memory hash tables for accumulating text vocabularies
- Bankrupting Sybil despite churn
- SipHash: A Fast Short-Input PRF
- Making evildoers pay
- Conflict on a communication channel
- Proofs of Space
- On self-organizing sequential search heuristics
- How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
- Algorithms with Predictions
- Resource Burning for Permissionless Systems (Invited Paper)
- Advances in Cryptology - CRYPTO 2003
This page was built for publication: Defending hash tables from algorithmic complexity attacks with resource burning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614003)
