skip to main content
10.1145/3377929.3390034acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
poster

Moving target defense through evolutionary algorithms

Published:08 July 2020Publication History

ABSTRACT

Moving target defense is a technique for protecting internet-facing systems via the creation of a variable attack surface, that is, a changing profile that, however, is able to provide the same service to legitimate users. In the case of internet servers, it can be achieved via the generation of different configurations that change the service profile, and that can be included in a policy of restarting services with new configurations after a random time and with a random frequency. In this paper we will present a method based on evolutionary algorithms that uses industry-standard practices to score the vulnerability of a server and is designed to generate multiple configurations with optimized score in every run of the algorithm. We make improvements over a previous version of the method by tuning the evolutionary algorithm with the challenge of the very costly fitness evaluation that only allows for a very limited evaluation budget.

References

  1. David J. John, Robert W. Smith, William H. Turkett, Daniel A. Canas, and Errin W. Fulp. 2014. Evolutionary Based Moving Target Cyber Defense. In Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation (GECCO Comp '14). ACM, New York, NY, USA, 1261--1268. event-place: Vancouver, BC, Canada. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. NITRD. 2009. NITRD CSIA IWG Cybersecurity Game-Change Research and Development Recommendations. https://bit.ly/2peOnfd. (May 2009).Google ScholarGoogle Scholar
  3. Ernesto Serrano, Pedro A. Castillo, and Juan J. Merelo. 2020. Using evolutionary algorithms for server hardening via the moving target defense technique. In EvoApplications 2020 proceedings, to be published. Springer, Cham, Article 114, 16 pages.Google ScholarGoogle Scholar

Index Terms

  1. Moving target defense through evolutionary algorithms

      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
        GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion
        July 2020
        1982 pages
        ISBN:9781450371278
        DOI:10.1145/3377929

        Copyright © 2020 Owner/Author

        Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 8 July 2020

        Check for updates

        Qualifiers

        • poster

        Acceptance Rates

        Overall Acceptance Rate1,669of4,410submissions,38%

        Upcoming Conference

        GECCO '24
        Genetic and Evolutionary Computation Conference
        July 14 - 18, 2024
        Melbourne , VIC , Australia

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader