loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Noa Bar-Yosef 1 and Avishai Wool 2

Affiliations: 1 School of Computer Science, Tel Aviv University, Israel ; 2 School of Electrical Engineering, Tel Aviv University, Israel

ISBN: 978-989-8111-12-8

Keyword(s): Algorithmic complexity attack, denial of service, packet filter.

Abstract: Many network devices, such as routers, firewalls, and intrusion detection systems, usually maintain perconnection state in a hash table. However, hash tables are susceptible to algorithmic complexity attacks, in which the attacker degenerates the hash into a simple linked list. A common counter-measure is to randomize the hash table by adding a secret value, known only to the device, as a parameter to the hash function. Our goal is to demonstrate how the attacker can defeat this protection: we demonstrate how to discover this secret value, and to do so remotely, using network traffic. We show that if the secret value is small enough, such an attack is possible. Our attack does not rely on any weakness of a particular hash function and can work against any hash — although a poorly chosen hash function, that produces many collisions, can make the attack more efficient. We present a mathematical modeling of the attack, simulate the attack on different network topologies and finally descr ibe a real-life attack against a weakened version of the Linux Netfilter. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.227.249.234

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Bar-Yosef N.; Wool A. and (2007). REMOTE ALGORITHMIC COMPLEXITY ATTACKS AGAINST RANDOMIZED HASH TABLES.In Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007) ISBN 978-989-8111-12-8, pages 117-124. DOI: 10.5220/0002118101170124

@conference{secrypt07,
author={Noa Bar{-}Yosef and Avishai Wool},
title={REMOTE ALGORITHMIC COMPLEXITY ATTACKS AGAINST RANDOMIZED HASH TABLES},
booktitle={Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007)},
year={2007},
pages={117-124},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002118101170124},
isbn={978-989-8111-12-8},
}

TY - CONF

JO - Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007)
TI - REMOTE ALGORITHMIC COMPLEXITY ATTACKS AGAINST RANDOMIZED HASH TABLES
SN - 978-989-8111-12-8
AU - Bar-Yosef, N.
AU - Wool, A.
PY - 2007
SP - 117
EP - 124
DO - 10.5220/0002118101170124

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.