Friends of an enemy: identifying local members of peer-to-peer botnets using mutual contacts

In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same network even before they exhibit any overtly malicious behavior. Detection is based on an analysis of connections made by the hosts in the network. It turns out that if bots select their peers randomly and independently (i.e. unstructured topology), any given pair of P2P bots in a network communicate with at least one mutual peer outside the network with a surprisingly high probability. This, along with the low probability of any other host communicating with this mutual peer, allows us to link local nodes within a P2P botnet together. We propose a simple method to identify potential members of an unstructured P2P botnet in a network starting from a known peer. We formulate the problem as a graph problem and mathematically analyze a solution using an iterative algorithm. The proposed scheme is simple and requir...

• Type: Journal
• Year: 2010
• Where: ACSAC
• Authors: Baris Coskun, Sven Dietrich, Nasir D. Memon
• Keywords: ACSAC 2010, Computer Communication Networks, Graph Problem, Iterative Algorithm, Security Privacy