skip to main content
10.1145/2742854.2744721acmconferencesArticle/Chapter ViewAbstractPublication PagescfConference Proceedingsconference-collections
research-article

Attention: moving target defense networks, how well are you moving?

Published:06 May 2015Publication History

ABSTRACT

The immense address space available with the new 128-bit addressing scheme enables mechanisms like Moving Target Defense for IPv6 networks. Moving Target IPv6 Defense (MT6D) promises security by letting nodes hop to new addresses that are cryptographically computed between involved nodes without disrupting ongoing conversations. After implementing MT6D as a testbed for previous research project, we asked ourselves if it is worth looking at the old addresses that are being given up by MT6D nodes and purged in the process. We explored the idea if activity on these relinquished addresses holds any vital clues for verifying and reinforcing the security of MT6D networks. During the analysis, we realized the need for a method to ensure the resiliency of the scheme besides uncovering any attacks that are underway. In this paper, we will discuss a novel solution that comprises of learning addresses that are being relinquished by the MT6D nodes, acquiring these addresses, performing traffic enumeration on these addresses and visualizing the same. We can become cognizant of a trailing attacker following a MT6D node along the address changes, besides uncovering any suspicious traffic hitting the MT6D nodes with this solution in place.

References

  1. Matthew D Ford. New internet security and privacy models enabled by ipv6. In SAINT Workshops, pages 2--5, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Matthew Dunlop, Stephen Groat, William Urbanski, Randy Marchany, and Joseph Tront. Mt6d: A moving target ipv6 defense. In Military Communications Conference, 2011-Milcom 2011, pages 1321--1326. IEEE, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  3. S Deering and R Hinden. Rfc 2460-internet protocol, version 6 (ipv6). Internet Engineering Task Force, RFC, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. T Narten, E Nordmark, and W Simpson. H. soliman," neighbor discovery for ip version 6 (ipv6). Technical report, RFC 4861, September, 2007.Google ScholarGoogle Scholar
  5. R Vida and L Costa. Rfc 3810: Multicast listener discovery version 2 (mldv2) for ipv6. Request for Comments, IETF, 2004.Google ScholarGoogle Scholar
  6. Philippe Biondi. Scapy. see http://www.secdev.org/projects/scapy, 2011.Google ScholarGoogle Scholar
  7. Gerald Combs et al. Wireshark. Web page: http://www.wireshark. org/last modified, pages 12--02, 2007.Google ScholarGoogle Scholar
  8. Michael Bostock. D3. js. Data Driven Documents, 2012.Google ScholarGoogle Scholar
  9. Anon Captain. Visualization code base. In http://www.codepen.io/anon, 2014.Google ScholarGoogle Scholar
  10. John Ronan, Matthew Ford, and Jonathan Stevens. Initial results from an ipv6 darknet. 2006.Google ScholarGoogle Scholar
  11. H PROJEC. Know your enemy: Statistics, 2002.Google ScholarGoogle Scholar
  12. David Moore, Colleen Shannon, Geoffrey M Voelker, and Stefan Savage. Network telescopes: Technical report. Department of Computer Science and Engineering, University of California, San Diego, 2004.Google ScholarGoogle Scholar
  13. Barry Irwin. A network telescope perspective of the conficker outbreak. In Information Security for South Africa (ISSA), 2012, pages 1--8. IEEE, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  14. Kazuya Kishimoto, Kenji Ohira, Yukiko Yamaguchi, Hirofumi Yamaki, and Hiroki Takakura. An adaptive honeypot system to capture ipv6 address scans. In Cyber Security (CyberSecurity), 2012 International Conference on, pages 165--172. IEEE, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Attention: moving target defense networks, how well are you moving?

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          CF '15: Proceedings of the 12th ACM International Conference on Computing Frontiers
          May 2015
          413 pages
          ISBN:9781450333580
          DOI:10.1145/2742854

          Copyright © 2015 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 6 May 2015

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          CF '15 Paper Acceptance Rate33of96submissions,34%Overall Acceptance Rate240of680submissions,35%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader