Towards collaborative security and P2P intrusion detection

被引:48
作者
Locasto, ME [1 ]
Parekh, JJ [1 ]
Keromytis, AD [1 ]
Stolfo, SJ [1 ]
机构
[1] Columbia Univ, New York, NY 10027 USA
来源
Proceedings from the Sixth Annual IEEE Systems, Man and Cybernetics Information Assurance Workshop | 2005年
关键词
D O I
10.1109/IAW.2005.1495971
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The increasing array of Internet-scale threats is a pressing problem for every organization that utilizes the network. Organizations have limited resources to detect and respond to these threats. The end-to-end (E2E) sharing of information related to probes and attacks is a facet of an emerging trend toward "collaborative security." The key benefit of a collaborative approach to intrusion detection is a better view of global network attack activity. Augmenting the information obtained at a single site with information gathered from across the network can provide a more precise model of an attacker's behavior and intent. While many organizations see value in adopting such a collaborative approach, some challenges must be addressed before intrusion detection can be performed on an inter-organizational scale. We report on our experience developing and deploying a decentralized system for efficiently distributing alerts to collaborating peers. Our system, Worminator, extracts relevant information from alert streams and encodes it in Bloom Filters. This information forms the basis of a distributed watchlist. The watchlist can be distributed via a choice of mechanisms ranging from a centralized trusted third party to a decentralized P2P-style overlay network.
引用
收藏
页码:333 / 339
页数:7
相关论文
共 22 条
[1]  
[Anonymous], 1982, 23 ANN S FDN COMPUTE, DOI DOI 10.1109/SFCS.1982.45
[2]  
Ben-Or M., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P1, DOI 10.1145/62212.62213
[3]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[4]  
CHAUM, 1988, P 29 ANN ACM S THEOR, P11
[5]  
CUPPENS F, 2002, IEEE SECURITY PRIVAC
[6]  
CUPPENS F, 2000, P 3 INT WORKSH REC A
[7]  
Du W., 2001, P 2001 WORKSH NEW SE
[8]  
Goldreich O., P 19 ANN ACM S THEOR, P218, DOI [10.1145/28395.28420, DOI 10.1145/28395.28420]
[9]  
HUANG MY, 1998, P REC ADV INTR DET R
[10]  
KRUGEL C, 2001, INT C INF SEC CRYPT