Skip to Main content Skip to Navigation
Conference papers

On the Vulnerability of Hardware Hash Tables to Sophisticated Attacks

Abstract : Peacock and Cuckoo hashing schemes are currently the most studied hash implementations for hardware network systems (such as NIDS, Firewalls, etc.). In this work we evaluate their vulnerability to sophisticated complexity Denial of Service (DoS) attacks. We show that an attacker can use insertion of carefully selected keys to hit the Peacock and Cuckoo hashing schemes at their weakest points. For the Peacock Hashing, we show that after the attacker fills up only a fraction (typically 5% − 10%) of the buckets, the table completely loses its ability to handle collisions, causing the discard rate (of new keys) to increase dramatically (100 − 1,800 times higher). For the Cuckoo Hashing, we show an attack that can impose on the system an excessive number of memory accesses and degrade its performance. We analyze the vulnerability of the system as a function of the critical parameters and provide simulations results as well.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01531139
Contributor : Hal Ifip <>
Submitted on : Thursday, June 1, 2017 - 11:35:11 AM
Last modification on : Tuesday, March 5, 2019 - 9:32:53 AM
Long-term archiving on: : Wednesday, September 6, 2017 - 6:30:17 PM

File

978-3-642-30045-5_11_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy, Bernhard Plattner. On the Vulnerability of Hardware Hash Tables to Sophisticated Attacks. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.135-148, ⟨10.1007/978-3-642-30045-5_11⟩. ⟨hal-01531139⟩

Share

Metrics

Record views

385

Files downloads

297