OpenFlow random host mutation: Transparent moving target defense using software defined networking

HotSDN'12 - Proceedings of the 1st ACM International Workshop on Hot Topics in Software Defined Networks

Volumn , Issue , 2012, Pages 127-132

  Jafarian, Jafar Haadi ^a   Al Shaer, Ehab ^a   Duan, Qi ^a  

^a University of North Carolina at Charlotte   (United States)

Author keywords

ip mutation; moving target defense; security; software defined networking

Indexed keywords

ACTIVE IP; IP ADDRESSS; IP MUTATION; MOVING TARGETS; NETWORK ASSETS; SECURITY; SOFTWARE-DEFINED NETWORKING; TARGET DOMAIN; WORM PROPAGATION;

INFORMATION SYSTEMS;

COMPUTER NETWORKS;

EID: 84866521295     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2342441.2342467     Document Type: Conference Paper

References (12)

1. N. Bjørner and L. de Moura. z310 : Applications, enablers, challenges and directions. In CFV '09, 2009.
2. N. Gude, T. Koponen, J. Pettit, B. Pfaff, M. Casado, N. McKeown, and S. Shenker. Nox: towards an operating system for networks. SIGCOMM Comput. Commun. Rev., 38(3):105-110, July 2008.
3. N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner. Openflow: enabling innovation in campus networks. SIGCOMM Comput. Commun. Rev., 38.
4. B. Lantz, B. Heller, and N. McKeown. A network in a laptop: rapid prototyping for software-defined networks. In Proceedings of the Ninth ACM SIGCOMM Workshop on Hot Topics in Networks, Hotnets '10, pages 19:1-19:6, New York, NY, USA, 2010. ACM.
5. M. Atighetchi, P. Pal, F. Webber, and C. Jones. Adaptive use of network-centric mechanisms in cyber-defense. In ISORC '03, page 183. IEEE Computer Society, 2003.
6. D. Kewley, R. Fink, J. Lowry, and M. Dean. Dynamic approaches to thwart adversary intelligence gathering. In DARPA Information Survivability Conference Exposition II, 2001. DISCEX '01. Proceedings, volume 1, pages 176-185 vol.1, 2001.
7. S. Antonatos, P. Akritidis, E. P. Markatos, and K. G. Anagnostakis. Defending against hitlist worms using network address space randomization. Comput. Netw., 51(12):3471-3490, 2007.
8. Ellis Horowitz and Sartaj Sahni. Computing partitions with applications to the knapsack problem. J. ACM, 21(2):277-292, april 1974.
9. SRI International. Yices: An SMT Solver, 2012. http://yices.csl.sri.com/.
10. E. Al-Shaer, W. Marrero, A. El-Atawy, and K. ElBadawi. Network configuration in a box: towards end-to-end verification of network reachability and security. In Network Protocols, 2009. ICNP 2009. 17th IEEE International Conference on, pages 123-132, 2009.
11. Ehab Al-Shaer and Qi Duan. Random host IP mutation for moving target defense. Technical Report UNCC-CYBERDNA-0728, CyberDNA Lab, University of North Carolina at Charlotte, Charlotte, NC, July 2011.
12. C. C. Zou, D. Towsley, and W. Gong. On the performance of internet worm scanning strategies. Elsevier Journal of Performance Evaluation, 63:700-723, 2003.