{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/31008"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/31008","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"A generalized adversary decision algorithm and analytic solution methods for advise models","abstract":"Quantitative security metrics are becoming increasingly important to system administrators. ADVISE generates quantitative security metrics by combining a system vulnerability graph with an adversary profile through an adversary decision algorithm. Previously, the decision algorithm placed restrictive assumptions on the adversary profile, and simulation was the sole solution method for ADVISE models. In this thesis, the decision algorithm is generalized while simultaneously improving its performance by incorporating theory from discrete-time Markov games. Furthermore, by exploring the state-space and generating the transition probability matrix, numerical solution methods may be applied to solve ADVISE models. Identifying key properties allows the models to be tested for compatibility with alternative solution methods from the literature, enabling additional metrics for ADVISE models. Finally, the performance of simulation is improved significantly by introducing decision caching. Together these accomplishments expand the number of quantitative security metrics and solution methods available to ADVISE models while lifting restrictions on the adversary profile and improving performance.","abstract_html":"Quantitative security metrics are becoming increasingly important to system administrators. ADVISE generates quantitative security metrics by combining a system vulnerability graph with an adversary profile through an adversary decision algorithm. Previously, the decision algorithm placed restrictive assumptions on the adversary profile, and simulation was the sole solution method for ADVISE models. In this thesis, the decision algorithm is generalized while simultaneously improving its performance by incorporating theory from discrete-time Markov games. Furthermore, by exploring the state-space and generating the transition probability matrix, numerical solution methods may be applied to solve ADVISE models. Identifying key properties allows the models to be tested for compatibility with alternative solution methods from the literature, enabling additional metrics for ADVISE models. Finally, the performance of simulation is improved significantly by introducing decision caching. Together these accomplishments expand the number of quantitative security metrics and solution methods available to ADVISE models while lifting restrictions on the adversary profile and improving performance.","abstract_has_math":false,"creators":["Ford, Michael"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Sanders, William H."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-05-22T00:21:15Z","date_published":"2012-05-22T00:21:15Z","updated_at":"2026-07-22T22:25:29Z","subjects":["Security models","quantitative metrics","state space exploration","numerical techniques"],"languages":["en"],"rights":["Copyright 2012 MICHAEL D. FORD"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/31008","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Sanders, William H."]},{"key":"dc:creator","label":"Author","values":["Ford, Michael"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012-05-22T00:21:15Z","2012-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Security models","quantitative metrics","state space exploration","numerical techniques"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2012 MICHAEL D. FORD"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/31008"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Quantitative security metrics are becoming increasingly important to system administrators. ADVISE generates quantitative security metrics by combining a system vulnerability graph with an adversary profile through an adversary decision algorithm. Previously, the decision algorithm placed restrictive assumptions on the adversary profile, and simulation was the sole solution method for ADVISE models. In this thesis, the decision algorithm is generalized while simultaneously improving its performance by incorporating theory from discrete-time Markov games. Furthermore, by exploring the state-space and generating the transition probability matrix, numerical solution methods may be applied to solve ADVISE models. Identifying key properties allows the models to be tested for compatibility with alternative solution methods from the literature, enabling additional metrics for ADVISE models. Finally, the performance of simulation is improved significantly by introducing decision caching. Together these accomplishments expand the number of quantitative security metrics and solution methods available to ADVISE models while lifting restrictions on the adversary profile and improving performance.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-04-27T14:44:54Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Ford_Michael.pdf: 406767 bytes, checksum: c18dbcf8e831fddfb2b4bf0a7b9e52c7 (MD5)","Made available in DSpace on 2012-05-22T00:21:15Z (GMT). No. of bitstreams: 2 Ford_Michael.pdf: 406767 bytes, checksum: c18dbcf8e831fddfb2b4bf0a7b9e52c7 (MD5) license.txt: 4061 bytes, checksum: 401d3c3e634be4c036551e1df639757f (MD5)"]},{"key":"dc:title","label":"Title","values":["A generalized adversary decision algorithm and analytic solution methods for advise models"]}]}],"canonical_facts":{"dc:contributor":["Sanders, William H."],"dc:creator":["Ford, Michael"],"dc:date":["2012-05-22T00:21:15Z","2012-05"],"dc:description":["Quantitative security metrics are becoming increasingly important to system administrators. ADVISE generates quantitative security metrics by combining a system vulnerability graph with an adversary profile through an adversary decision algorithm. Previously, the decision algorithm placed restrictive assumptions on the adversary profile, and simulation was the sole solution method for ADVISE models. In this thesis, the decision algorithm is generalized while simultaneously improving its performance by incorporating theory from discrete-time Markov games. Furthermore, by exploring the state-space and generating the transition probability matrix, numerical solution methods may be applied to solve ADVISE models. Identifying key properties allows the models to be tested for compatibility with alternative solution methods from the literature, enabling additional metrics for ADVISE models. Finally, the performance of simulation is improved significantly by introducing decision caching. Together these accomplishments expand the number of quantitative security metrics and solution methods available to ADVISE models while lifting restrictions on the adversary profile and improving performance.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-04-27T14:44:54Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Ford_Michael.pdf: 406767 bytes, checksum: c18dbcf8e831fddfb2b4bf0a7b9e52c7 (MD5)","Made available in DSpace on 2012-05-22T00:21:15Z (GMT). No. of bitstreams: 2 Ford_Michael.pdf: 406767 bytes, checksum: c18dbcf8e831fddfb2b4bf0a7b9e52c7 (MD5) license.txt: 4061 bytes, checksum: 401d3c3e634be4c036551e1df639757f (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/31008"],"dc:language":["en"],"dc:rights":["Copyright 2012 MICHAEL D. FORD"],"dc:subject":["Security models","quantitative metrics","state space exploration","numerical techniques"],"dc:title":["A generalized adversary decision algorithm and analytic solution methods for advise models"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:29Z"}