Keeping denial-of-service attackers in the dark

被引:10
作者
Badishi, Gal [1 ]
Herzberg, Amir
Keidar, Idit
机构
[1] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel
[2] Bar Ilan Univ, Dept Comp Sci, IL-52900 Ramat Gan, Israel
关键词
protocols; reliability; availability; serviceability;
D O I
10.1109/TDSC.2007.70209
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the problem of overcoming ( distributed) denial-of-service (DoS) attacks by realistic adversaries that have knowledge of their attack's successfulness, for example, by observing service performance degradation or by eavesdropping on messages or parts thereof. A solution for this problem in a high-speed network environment necessitates lightweight mechanisms for differentiating between valid traffic and the attacker's packets. The main challenge in presenting such a solution is to exploit existing packet-filtering mechanisms in a way that allows fast processing of packets but is complex enough so that the attacker cannot efficiently craft packets that pass the filters. We show a protocol that mitigates DoS attacks by adversaries that can eavesdrop and ( with some delay) adapt their attacks accordingly. The protocol uses only available efficient packet-filtering mechanisms based mainly on addresses and port numbers. Our protocol avoids the use of fixed ports and instead performs "pseudorandom port hopping." We model the underlying packet-filtering services and define measures for the capabilities of the adversary and for the success rate of the protocol. Using these, we provide a novel rigorous analysis of the impact of DoS on an end-to-end protocol and show that our protocol provides effective DoS prevention for realistic attack and deployment scenarios.
引用
收藏
页码:191 / 204
页数:14
相关论文
共 20 条
[1]  
ANDERSEN DG, 2003, P 4 US S INT TECHN S
[2]  
[Anonymous], 2003, CCS 03
[3]  
[Anonymous], P WWW HON HI US MAY
[4]  
ARGYRAKI K, 2005, P US ANN TECHN C APR
[5]  
ATKINSON R, 1998, 2401 IETF RFC
[6]  
Badishi G, 2004, 2004 INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, P223
[7]  
CHWARTZ SM, 2001, FREQUENCY HOPPING SP
[8]  
Collins M, 2004, P IEEE S SECUR PRIV, P103
[9]  
GLIGOR VD, 2003, P 11 INT WORKHS SEC
[10]   HOW TO CONSTRUCT RANDOM FUNCTIONS [J].
GOLDREICH, O ;
GOLDWASSER, S ;
MICALI, S .
JOURNAL OF THE ACM, 1986, 33 (04) :792-807