MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Investigating coevolutionary algorithms for finding Nash equilibria in cybersecurity problems

Author(s)
Zhang, Linda(Linda E.)
Thumbnail
Download1127291730-MIT.pdf (2.403Mb)
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Una-May O'Reilly and Erik Hemberg.
Terms of use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
Distributed Denial of Service (DDoS) cyberattacks continue to increase and cause disruptions in both industry and politics. As more critical information and services are provided through networks, it becomes more important to keep these networks available. However, since cyber-adversaries continuously change and adapt, stationary defense strategies do not effectively secure networks against attacks. We modeled attacker-defender interactions using competitive coevolutionary algorithms and investigated Nash equilibria within these cybersecurity problems. In particular, we examined and presented variations on two existing algorithms that look for Nash equilibria: NashSolve and HybridCoev. To compare these algorithms' performances against other existing heuristics, we considered multiple evaluation methods: the first calculates average fitness scores, the second creates a compendium of MEU, MinMax, and inverse Pareto front ratio scores, and the third utilizes Nash averaging. Although NashSolve and HybridCoev do not perform significantly better on average for either attacker or defender populations relative to other heuristics in these evaluations, they are able to produce strong individual strategies.
Description
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
 
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
 
Cataloged from student-submitted PDF version of thesis.
 
Includes bibliographical references (pages 55-57).
 
Date issued
2019
URI
https://hdl.handle.net/1721.1/122992
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.