HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
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 metadata

Cited literature [16 references]  Display  Hide  Download

Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, June 1, 2017 - 11:35:11 AM
Last modification on : Thursday, May 27, 2021 - 1:54:06 PM
Long-term archiving on: : Wednesday, September 6, 2017 - 6:30:17 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads