%0 Conference Proceedings
%T On the Vulnerability of Hardware Hash Tables to Sophisticated Attacks
%+ Computer Engineering and Networks Laboratory (TIK)
%+ Computer Science department [Herzliya]
%+ School of Computer Science (TAU-CS)
%A Ben-Porat, Udi
%A Bremler-Barr, Anat
%A Levy, Hanoch
%A Plattner, Bernhard
%Z Part 3: Reliability and Resilience
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th International Networking Conference (NETWORKING)
%C Prague, Czech Republic
%Y Robert Bestak
%Y Lukas Kencl
%Y Li Erran Li
%Y Joerg Widmer
%Y Hao Yin
%I Springer
%3 NETWORKING 2012
%V LNCS-7289
%N Part I
%P 135-148
%8 2012-05-21
%D 2012
%R 10.1007/978-3-642-30045-5_11
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01531139/document
%2 https://inria.hal.science/hal-01531139/file/978-3-642-30045-5_11_Chapter.pdf
%L hal-01531139
%U https://inria.hal.science/hal-01531139
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-LNCS-7289
%~ IFIP-NETWORKING