Study of Dynamic Defense technique to overcome drawbacks of moving target defense

Attacker typically begin the attack by reconnaissance phase in which they monitor the network and probe it over a period of time. When an attack surface is static, an attacker can monitor the network, identify vulnerabilities and entry points and build efficient and targeted attacks. A Moving Target Defense is a way to disrupt the reconnaissance phase as it provides attack surface which constantly changes. An attacker then trying to probe and identifying vulnerabilities of false system which may required more resources as well as increase the risk of detection. Moving Target Defense technique either alters network configuration to limit the usefulness of an attacker reconnaissance or change computers appearance over time using TCP/IP fingerprint obfuscator but there is a new concept which leaves the defended system at rest and makes the Defense Dynamic. Dynamic Defense is a new defense technique that removes hacker ability to depend on previous information without introducing motion in the network infrastructure. This paper provides a comparative analysis of Moving Target Defense and Moving Defense Technique.

[1]  Mohammad Iftekhar Husain,et al.  Lightweight Reconfigurable Encryption Architecture for Moving Target Defense , 2013, MILCOM 2013 - 2013 IEEE Military Communications Conference.

[2]  D. Kewley,et al.  Dynamic approaches to thwart adversary intelligence gathering , 2001, Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01.

[3]  Michael B. Crouse,et al.  Improving the Diversity Defense of Genetic Algorithm-Based Moving Target Approaches , 2012 .

[4]  Richard Ford,et al.  Moving-Target Defenses for Computer Networks , 2014, IEEE Security & Privacy.

[5]  Radha Poovendran,et al.  Effectiveness of IP address randomization in decoy-based moving target defense , 2013, 52nd IEEE Conference on Decision and Control.

[6]  Evangelos P. Markatos,et al.  Defending against hitlist worms using network address space randomization , 2005, WORM '05.