AntBot: Anti-pollution peer-to-peer botnets
نویسندگان
چکیده
منابع مشابه
AntBot: Anti-pollution peer-to-peer botnets
1389-1286/$ see front matter Published by Elsevie doi:10.1016/j.comnet.2011.02.006 ⇑ Corresponding author. Tel.: +1 505 6670176; fa E-mail address: [email protected] (G. Yan). 1 Los Alamos National Laboratory Publication No. L 2 This work was done when Duc T. Ha was wo National Laboratory. Botnets have emerged as one of the most severe cyber-threats in recent years. To evade detection and improve ...
متن کاملRatBot: Anti-enumeration Peer-to-Peer Botnets
As evidenced by the recent botnet turf war between SpyEye and Zeus, the cyber space has been witnessing an increasing number of battles or wars involving botnets among different groups, organizations, or even countries. One important aspect of a cyber war is accurately estimating the attack capacity of the enemy. Particularly, each party in a botnet war would be interested in knowing how many c...
متن کاملPeer-to-Peer Botnets
“Botnet” is a network of computers that are compromised and controlled by an attacker. Botnets are one of the most serious threats to today’s Internet. Most current botnets have centralized command and control (C&C) architecture. However, peer-to-peer (P2P) structured botnets have gradually emerged as a new advanced form of botnets. Without C&C servers, P2P botnets are more resilient to defense...
متن کاملModeling and Analysis of Peer-to-Peer Botnets
Peer-to-Peer P2P botnets have emerged as one of the most serious threats to Internet security. To effectively eliminate P2P botnets, in this paper, the authors present two novel dynamical models to portray the process of formation of P2P botnets, one of which is called microlevel model, the other is calledmacrolevel model. Also, the stability of equilibria is investigated alongwith the analysis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks
سال: 2011
ISSN: 1389-1286
DOI: 10.1016/j.comnet.2011.02.006