Adaptive use of network-centric mechanisms in cyber-defense

Atighetchi, Michael; Pal, Partha; Webber, Franklin; Jones, C.

doi:10.1109/isorc.2003.1199253

Cited by 33 publications

(15 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sifalakis et al [4] obscured the data exchange between two peers by shuffling the communication participants that define the sequence for address hopping and determine data spreading. Atighetchi et al [5] created a system that allows hosts to use tunnels to disguise on-going communication, which requires Copyright c 2017 The Institute of Electronics, Information and Communication Engineers participation from both end-points. Badishi et al [6] proposed a random port-hopping scheme to defend against DDoS attacks by changing the communication ports.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Defense Mechanism of Random Routing Mutation in SDN

Liu

Zhang

Guo³

2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYFocused on network reconnaissance, eavesdropping, and DoS attacks caused by static routing policies, this paper designs a random routing mutation architecture based on the OpenFlow protocol, which takes advantages of the global network view and centralized control in a software-defined network. An entropy matrix of network traffic characteristics is constructed by using volume measurements and characteristic measurements of network traffic. Random routing mutation is triggered according to the result of network anomaly detection, which using a wavelet transform and principal component analysis to handle the above entropy matrix for both spatial and temporal correlations. The generation of a random routing path is specified as a 0-1 knapsack problem, which is calculated using an improved ant colony algorithm. Theoretical analysis and simulation results show that the proposed method not only increases the difficulty of network reconnaissance and eavesdropping but also reduces the impact of DoS attacks on the normal communication in an SDN network.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Equation (5) ensures that there are no cycles in the routing path. Equation (6) ensures that the maximum routing path length is L. Equation (7) considers the current available bandwidth of every link in the entire network to ensure load balancing of the total network.…”

Section: Definition 4 (Path) For Nodementioning

confidence: 99%

A Defense Mechanism of Random Routing Mutation in SDN

Liu

Zhang

Guo³

2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…Several port hopping implementations have been proposed before: Michael Atighetchi et al [11] develop a port and address hopping mechanism based on time synchronization and random number generation, where ho pping delegate and network address translation (NAT) gateway perform mapping between fake ( address : port) and real (address : port) pairs. Henry C.J.…”

Section: Motivation and Related Workmentioning

confidence: 99%

“…Although several MTD mechanisms [9][10] have been proposed, this paper examines the effectiveness of port hopping [11][12][13][14][15]. These existed works show that port hopping is a promising technique that transforms port number used for communication with random one so as to improve the ability of thwarting cyber attacks.…”

Section: Introductionmentioning

confidence: 99%

Analysis of Port Hopping for Proactive Cyber Defense

Luo¹,

Wang²,

Cai³

2015

IJSIA

View full text Add to dashboard Cite

show abstract

“…Their objective of accelerating hitlist decay is somewhat similar to ours; however, both their basic approach (in terms of considering hitlists of live systems) and suggested mechanisms for random address shuffling (primarily DHCP) differ from ours. Similar methods for changing network configurations in order to attempt to thwart malicious activity have been proposed in [5], [14], [19], [15]. We differ from these efforts by focusing on protecting honeynets and demonstrate a simple, scalable, and extensible system for address space randomization that implements several shuffling policies.…”

Section: Background and Related Workmentioning

confidence: 99%

Camouflaging Honeynets

Yegneswaran

Alfeld²,

Barford³

et al. 2007

2007 IEEE Global Internet Symposium

View full text Add to dashboard Cite

Abstract-Over the past several years, honeynets have proven invaluable for understanding the characteristics of unwanted Internet traffic from misconfigurations and malicious attacks. In this paper, we address the problem of defending honeynets against systematic mapping by malicious parties, so we can ensure that honeynets remain viable in the long term. Our approach is based on two ideas: (i) counting the number of probes received in the honeynet, and (ii) shuffling the location of live systems with those that comprise the honeynet in a larger address space after the probe count has exceeded a threshold. We describe four different strategies for randomizing the location of the honeynet. Each strategy is defined in terms of the degree of defense that it provides and its associated computational and state requirements. We implement a prototype middlebox that we call Kaleidoscope to gain practical insight on the feasibility of these strategies. Through a series of tests we show that the system is capable of effectively defending honeynets in large networks with limited impact on normal traffic, and that it continues to respond well in the face of large resource attacks.

show abstract

Adaptive use of network-centric mechanisms in cyber-defense

Cited by 33 publications

References 9 publications

A Defense Mechanism of Random Routing Mutation in SDN

A Defense Mechanism of Random Routing Mutation in SDN

Analysis of Port Hopping for Proactive Cyber Defense

Camouflaging Honeynets

Contact Info

Product

Resources

About