A feasibility study on defending against ultra-fast topological worms

Proceedings - P2P - 7th IEEE International Conference on Peer-to-Peer Computing

Volumn , Issue , 2007, Pages 61-68

  Xie, Liang ^a   Zhu, Sencun ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED DOMINATING SETS; DATA SERVICES; FEASIBILITY STUDIES; IMMINENT THREATS; OVERLAY GRAPHS; P2P OVERLAYS; PEER TO PEERS; SECURITY PATCHES; TOPOLOGY INFORMATIONS; WORM CONTAINMENTS;

PLANNING; RESOURCE ALLOCATION; TOPOLOGY;

COMPUTER CRIME;

EID: 47949103447     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2007.4343465     Document Type: Conference Paper

References (24)

1. http://www.symantec.com/avcenter/security/Content/7680.html.
2. KaZaA and Fasttrack P2P network client buffer overflow vulnerability. http://secunia.com/advisories/8868/.
3. G. Altekar, I. Bagrak, P. Burstein, and A.Schultz. Opus: Online patches and updates for security. In USENIX Security'05, 2005.
4. B. Anthony and G. Blelloch. http://www.cs.cmu.edu/afs/cs/project/ pscicoguyb/realworld.
5. K. Cai, Y. Kwang, S. Song, and Y. Chen. Collaborative internet worm containment. In IEEE Security and Privacy'05, 2005.
6. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and S. Wallach. Secure routing for structured peer-to-peer overlay networks. In OSDI'02, 2002.
7. Y. Chen and A. Liestman. Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. InACM MOBIHOC'02, 2002.
8. Z. Chen, L. Gao, and K. Kwiat. Modeling the spread of active worms. In IEEE INFOCOMM''03, March 2003.
9. M. Costa, J. Crowcroft, M. Castro, A. Rowstron, L. Zhou, L. Zhang, and P. Barham. Vigilante: End-to-end containment of internet worms. In SOSP, 2005.
10. G. Danezis, C. Lesniewski-Laas, M. Kaashoek, and R. Anderson. Sybil-resistant dht routing. In OSDI'02, 2002.
11. M. Garey and D. Johnson. Computers and intractability: A guide to the theory of np-completeness. Freeman, New York, 1979.
12. S. Guha and S. Khuller. Approximation algorithm for connected dominating sets. In Algorithmica, Apr. 1998.
13. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. In SIAM Journal on Scientific Computing, 1998.
14. J. Kephard and S. White. Directed-graph epidemiological models of computer virus. In Proc. of 1991 Computer Society Symposium on Research in Security and Privacy, May, 1991.
15. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graghs. In Bell Systems Technical Journal, 1970.
16. F. Kuhn, S. Schmid, and R. Wattenhofer. A self-repairing p2p system resilient to dynamic adversarial churn. In OSDI'02, 2002.
17. S. Kutten and D. Peleg. Fast distributed construction of k-dominating sets and applications. In PODC'95, 1995.
18. M.Vojnovic and A. Ganesh. On the effectiveness of automatic patching. In WORM'05, 2005.
19. M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. In IEEE Internet Computing Journal, 2002.
20. D. Stutzbach, R. Rejaie, and S. Sen. Characterizing unstructured overlay topologies in modern p2p file-sharing systems. In Internet Measurement Conference, 2005.
21. H. Wang and et al. Shield: Vulnerability-driven network filters for preventing know vulnerability exploits. InACM SIGCOMM, 2004.
22. N. Weaver, V. Paxson, S. Staniford, and R. Cunninggham. A taxonomy of computer worms. In USENIX Security'04, 2004.
23. E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internetwork. In IEEE INFOCOMM'96, March 1996.
24. L. Zhou and et al. A first look at peer-to-peer worms: threats and denfenses. In IPTPS'05, 2005.