Denial of Service via Algorithmic Complexity Attacks (2003)

by Scott A. Crosby , Dan S. Wallach
Citations:111 - 2 self

Active Bibliography

USENIX Association Proceedings of the – Scott A. Crosby, Dan S. Wallach - 2003
Finger Search on Balanced Search Trees – Maverick Woo - 2006
2 Exploring the Duality Between Skip Lists and Binary Search Trees – Brian C. Dean, et al. - 2007
8 Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost – Tony W. Lai, Derick Wood - 1995
10 Space-efficient finger search on degree-balanced search trees – Guy E. Blelloch, Bruce M. Maggs, Shan Leung, Maverick Woo - 2003
134 Cache-oblivious B-trees – Michael A. Bender, Erik D. Demaine, Martin Farach-colton - 2000
Dynamic Connectivity in Graphs -- Theory and Practice – David Alberts - 1995
1 Hash Tables for Efficient Flow Monitoring: Vulnerabilities and Countermeasures – David Eckhoff, Tobias Limmer, Falko Dressler - 2009
1 Variationally Universal Hashing – Ted Krovetz, Phillip Rogaway - 2006
8 Fast universal hashing with small keys and no preprocessing: the PolyR construction – Ted Krovetz, Phillip Rogaway - 2000
28 Distributed quota enforcement for spam control – Michael Walfish, J. D. Zamfirescu, Hari Balakrishnan, David Karger, Scott Shenker - 2006
3 On the Performance and Analysis of DNS Security Extensions – Reza Curtmola, Aniello Del Sorbo, Giuseppe Ateniese, Aniello Del - 2005
5 Security Issues in the Diffie-Hellman Key Agreement Protocol – Jean-françois Raymond, Anton Stiglic - 2000
7 On the Number of Descendants and Ascendants in Random Search Trees – Conrado Martínez, Helmut Prodinger - 1997
Potentials and Limitations of Visual Methods for the Exploration of Complex Data Structures – Tobias Lauer - 2007
22 Randomized Binary Search Trees – Conrado Martínez, Salvador Roura - 1997
5 Halting Password Puzzles -- Hard-to-break Encryption from Human-memorable Keys – Xavier Boyen - 2007
An Efficient Compression Scheme for Data Communication Which Uses a New Family of Self-Organizing Binary Search Trees – Luis Rueda, B. John Oommen
Data Structures with Unpredictable Timing – Darrell Bethea, Michael K. Reiter