Proceedings ArticleDOI
Exploit detection techniques for STP using distributed IDS
Ankush Rai,Ferdous A. Barbhuiya,Arijit Sur,Santosh Biswas,Suchetana Chakraborty,Sukumar Nandi +5 more
- pp 939-944
Reads0
Chats0
TLDR
A coverage based distributed intrusion detection system (DIDS) has been introduced, for the detection of attacks on STP and results show that the proposed DIDS approach can detect all the STP based attacks.Abstract:
Spanning tree protocol (STP) is a link layer protocol used for link management, prevention of loop formation etc. in the network. Although STP is widely used, it is still prone to many kinds of attacks that exploit the lack of security features both in basic working process and STP packet format. By exploiting STP control packet an attacker can pretend to be the new root in STP domain and perform unauthorized activities that lead to root take-over attack, STP control packet flooding, traffic redirection and so on. In this paper, a coverage based distributed intrusion detection system (DIDS) has been introduced, for the detection of attacks on STP. The proposed scheme computes a set of switches in the network that can cover the STP network completely; where every switch belongs to that set is installed with a small module of IDS. This set of IDSs logically divides the STP network into a set of local zones. All the switches in a zone is directly connected to one switch installed with IDS and thus covered by at least one IDS in STP domain. Each IDS can detect and verify any exploit inside its local zone. Additionally IDSs communicate with each other so that any exploit outside the local zone of a particular IDS can also be detected and verified. The results show that the proposed DIDS approach can detect all the STP based attacks.read more
Citations
More filters
Journal ArticleDOI
Study on Cloud Security Based on Trust Spanning Tree Protocol
TL;DR: Experiment shows that the trusted protocol can achieve security goals and effectively avoid STP attacks with a lower computation overhead and good convergence performance.
Proceedings ArticleDOI
Trust-Based Security for the Spanning Tree Protocol
TL;DR: Experiment shows that the trusted protocol can achieve security goals and effectively avoid STP attacks with a lower computation overhead and good convergence performance.
TopologyAdaptiveComputationof DistributedIDSSet forDetectingAttacksonSTP
Suchetana Chakraborty,Ferdous A. Barbhuiya,Ankush Rai,Arijit Sur,Santosh Biswas,Sukumar Nandi +5 more
TL;DR: A Connected Dominat- ing Set (CDS) based scheme has been introduced to find out a set of IDSs, sufficient to cover the whole STP network, and experimental results show that the proposed scheme is able to detect all the STP based attacks.
References
More filters
Journal ArticleDOI
On the hardness of approximating minimum vertex cover
Irit Dinur,Samuel Safra +1 more
TL;DR: The Minimum Vertex Cover problem is proved to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP and hardness of approximation technique.
Journal ArticleDOI
The minimum generalized vertex cover problem
Refael Hassin,Asaf Levin +1 more
TL;DR: The minimum generalized vertex cover problem is to compute a minimum cost set of vertices by studying the complexity of the problem with the costs of α and β, and provides 2-approximation algorithms for the general case.
Proceedings ArticleDOI
Improving Network Infrastructure Security by Partitioning Networks Running Spanning Tree Protocol
Kai-Hau Yeung,F. Yan,C. Leung +2 more
TL;DR: The paper proposes a novel solution that partitions a STP network into two tier of switching networks and shows that the boundary switches were fully functional and could successfully stop STP attacks launched from the lower tier network.
Book
Network Infrastructure Security
Angus Wong,Alan Yeung +1 more
TL;DR: Network Infrastructure Security by Angus Wong and Alan Yeung addresses the emerging concern with better detecting and preventing routers and other network devices from being attacked or compromised.