{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T21:54:12Z","timestamp":1773179652367,"version":"3.50.1"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T00:00:00Z","timestamp":1520380800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Maryland Procurement Office","award":["H98230-14-C-0137"],"award-info":[{"award-number":["H98230-14-C-0137"]}]},{"name":"ARO","award":["W911NF11103, W911NF09102, W911NF-13-1-0421, and W911NF-13-1-0317"],"award-info":[{"award-number":["W911NF11103, W911NF09102, W911NF-13-1-0421, and W911NF-13-1-0317"]}]},{"name":"ONR","award":["N00014-13-1-0703"],"award-info":[{"award-number":["N00014-13-1-0703"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2018,8,31]]},"abstract":"<jats:p>\n            A \u201cnoisy-rich\u201d (NR) cyber-attacker (Lippmann et al. 2012) is one who tries all available vulnerabilities until he or she successfully compromises the targeted network. We develop an adversarial foundation, based on Stackelberg games, for how NR-attackers will explore an enterprise network and how they will attack it, based on the concept of a system vulnerability dependency graph. We develop a mechanism by which the network can be modified by the defender to induce deception by placing honey nodes and apparent vulnerabilities into the network to minimize the expected impact of the NR-attacker\u2019s attacks (according to multiple measures of impact). We also consider the case where the adversary learns from blocked attacks using reinforcement learning. We run detailed experiments with real network data (but with simulated attack data) and show that Stackelberg Honey-based Adversarial Reasoning Engine performs very well, even when the adversary deviates from the initial assumptions made about his or her behavior. We also develop a method for the attacker to use reinforcement learning when his or her activities are stopped by the defender. We propose two stopping policies for the defender:\n            <jats:italic>Stop Upon Detection<\/jats:italic>\n            allows the attacker to learn about the defender\u2019s strategy and (according to our experiments) leads to significant damage in the long run, whereas\n            <jats:italic>Stop After Delay<\/jats:italic>\n            allows the defender to introduce greater uncertainty into the attacker, leading to better defendability in the long run.\n          <\/jats:p>","DOI":"10.1145\/3137571","type":"journal-article","created":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T19:00:36Z","timestamp":1520449236000},"page":"1-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["SHARE"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3210-558X","authenticated-orcid":false,"given":"Sushil","family":"Jajodia","sequence":"first","affiliation":[{"name":"George Mason University, Fairfax, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noseong","family":"Park","sequence":"additional","affiliation":[{"name":"University of North Carolina, Charlotte, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edoardo","family":"Serra","sequence":"additional","affiliation":[{"name":"Boise State University, Boise, ID, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. S.","family":"Subrahmanian","sequence":"additional","affiliation":[{"name":"Dartmouth College, Hanover, NH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,3,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"L. Ablon M. C. Libicki and A. Golay. 2014. Markets for Cybercrime Tools and Stole Data: Hackers Bazaar. Technical Report. Retrieved from http:\/\/www.rand.org\/pubs\/research_reports\/RR610.html.  L. Ablon M. C. Libicki and A. Golay. 2014. Markets for Cybercrime Tools and Stole Data: Hackers Bazaar. Technical Report. Retrieved from http:\/\/www.rand.org\/pubs\/research_reports\/RR610.html.","DOI":"10.7249\/RR610"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CyberSA.2015.7166127"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1951874"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the Association for the Advancement of Artificial Intelligence Conference on Artificial Intelligence (AAAI\u201912)","author":"An Bo","year":"2012","unstructured":"Bo An , David Kempe , Christopher Kiekintveld , Eric Shieh , Satinder Singh , Milind Tambe , and Yevgeniy Vorobeychik . 2012 . Security games with limited surveillance . In Proceedings of the Association for the Advancement of Artificial Intelligence Conference on Artificial Intelligence (AAAI\u201912) . 1241--1248. Bo An, David Kempe, Christopher Kiekintveld, Eric Shieh, Satinder Singh, Milind Tambe, and Yevgeniy Vorobeychik. 2012. Security games with limited surveillance. In Proceedings of the Association for the Advancement of Artificial Intelligence Conference on Artificial Intelligence (AAAI\u201912). 1241--1248."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1793974.1794083"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Tamer Ba\u015far and Geert Jan Olsder. 1998. Dynamic Noncooperative Game Theory. SIAM.  Tamer Ba\u015far and Geert Jan Olsder. 1998. Dynamic Noncooperative Game Theory. SIAM.","DOI":"10.1137\/1.9781611971132"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the Large Installation System Administration Conference (LISA\u201902)","volume":"2","author":"Beattie Steve","year":"2002","unstructured":"Steve Beattie , Seth Arnold , Crispin Cowan , Perry Wagle , Chris Wright , and Adam Shostack . 2002 . Timing the application of security patches for optimal uptime . In Proceedings of the Large Installation System Administration Conference (LISA\u201902) , Vol. 2 . 233--242. Steve Beattie, Seth Arnold, Crispin Cowan, Perry Wagle, Chris Wright, and Adam Shostack. 2002. Timing the application of security patches for optimal uptime. In Proceedings of the Large Installation System Administration Conference (LISA\u201902), Vol. 2. 233--242."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISI.2011.5984063"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1980022.1980327"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02882-3_2"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 2015 10th International Conference for Internet Technology and Secured Transactions (ICITST\u201915)","author":"Campbell R. M.","unstructured":"R. M. Campbell , K. Padayachee , and T. Masombuka . 2015. A survey of honeypot research: Trends and opportunities . In Proceedings of the 2015 10th International Conference for Internet Technology and Secured Transactions (ICITST\u201915) . 208--212. R. M. Campbell, K. Padayachee, and T. Masombuka. 2015. A survey of honeypot research: Trends and opportunities. In Proceedings of the 2015 10th International Conference for Internet Technology and Secured Transactions (ICITST\u201915). 208--212."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the Workshop on the Economics of Information Security (WEIS\u201906)","author":"Cavusoglu Huseyin","year":"2006","unstructured":"Huseyin Cavusoglu , Hasan Cavusoglu , and Jun Zhang . 2006 . Economics of security patch management . In Proceedings of the Workshop on the Economics of Information Security (WEIS\u201906) . Huseyin Cavusoglu, Hasan Cavusoglu, and Jun Zhang. 2006. Economics of security patch management. In Proceedings of the Workshop on the Economics of Information Security (WEIS\u201906)."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1070.0794"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315272"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0160-y"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the International Conference on Information Systems (ICIS\u201901)","author":"Dhillon Gurpreet","year":"2001","unstructured":"Gurpreet Dhillon and Gholamreza Torkzadeh . 2001 . Value-focused assessment of information system security in organizations . In Proceedings of the International Conference on Information Systems (ICIS\u201901) , Veda C. Storey, Sumit Sarkar, and Janice I. DeGross (Eds.). Association for Information Systems, 561--566. Gurpreet Dhillon and Gholamreza Torkzadeh. 2001. Value-focused assessment of information system security in organizations. In Proceedings of the International Conference on Information Systems (ICIS\u201901), Veda C. Storey, Sumit Sarkar, and Janice I. DeGross (Eds.). Association for Information Systems, 561--566."},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201910)","volume":"1","author":"Dickerson John P.","year":"2010","unstructured":"John P. Dickerson , Gerardo I. Simari , V. S. Subrahmanian , and Sarit Kraus . 2010 . A graph-theoretic approach to protect static and moving targets from adversaries . In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201910) , Vol. 1 . IFAAMAS, 299--306. John P. Dickerson, Gerardo I. Simari, V. S. Subrahmanian, and Sarit Kraus. 2010. A graph-theoretic approach to protect static and moving targets from adversaries. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201910), Vol. 1. IFAAMAS, 299--306."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832249.2832322"},{"key":"e_1_2_1_20_1","volume-title":"Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms","author":"Friedrich Tobias","unstructured":"Tobias Friedrich and Frank Neumann . 2014. Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms . Springer , 922--931. Tobias Friedrich and Frank Neumann. 2014. Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms. Springer, 922--931."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0029-7"},{"key":"e_1_2_1_22_1","volume-title":"Handbook of Game Theory with Economic Applications (1 ed.)","author":"Hart Sergiu","unstructured":"Sergiu Hart . 1992. Games in extensive and strategic forms . In Handbook of Game Theory with Economic Applications (1 ed.) , R. J. Aumann and S. Hart (Eds.). Vol. 1 . Elsevier , 19--40. Sergiu Hart. 1992. Games in extensive and strategic forms. In Handbook of Game Theory with Economic Applications (1 ed.), R. J. Aumann and S. Hart (Eds.). Vol. 1. Elsevier, 19--40."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 6th Annual International Conference on Information Warfare and Security 1","author":"Hutchins Eric M.","year":"2011","unstructured":"Eric M. Hutchins , Michael J. Cloppert , and Rohan M. Amin . 2011. Intelligence-driven computer network defense informed by analysis of adversary campaigns and intrusion kill chains . In Proceedings of the 6th Annual International Conference on Information Warfare and Security 1 ( 2011 ), 80. Eric M. Hutchins, Michael J. Cloppert, and Rohan M. Amin. 2011. Intelligence-driven computer network defense informed by analysis of adversary campaigns and intrusion kill chains. In Proceedings of the 6th Annual International Conference on Information Warfare and Security 1 (2011), 80."},{"key":"e_1_2_1_24_1","volume-title":"Advances in Information Security","author":"Jajodia Sushil","unstructured":"Sushil Jajodia and Steven Noel . 2010. Topological vulnerability analysis . In Cyber Situational Awareness, Sushil Jajodia, Peng Liu, Vipin Swarup, and Cliff Wang (Eds.). Advances in Information Security , Vol. 46 . Springer , 139--154. Sushil Jajodia and Steven Noel. 2010. Topological vulnerability analysis. In Cyber Situational Awareness, Sushil Jajodia, Peng Liu, Vipin Swarup, and Cliff Wang (Eds.). Advances in Information Security, Vol. 46. Springer, 139--154."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2011.6127490"},{"key":"e_1_2_1_26_1","volume-title":"Advances in Information Security","volume":"56","author":"Jajodia Sushil","year":"2015","unstructured":"Sushil Jajodia , Paulo Shakarian , V. S. Subrahmanian , Vipin Swarup , and Cliff Wang ( Eds .). 2015 . Cyber Warfare\u2014Building the Scientific Foundation . Advances in Information Security , Vol. 56 . Springer. Sushil Jajodia, Paulo Shakarian, V. S. Subrahmanian, Vipin Swarup, and Cliff Wang (Eds.). 2015. Cyber Warfare\u2014Building the Scientific Foundation. Advances in Information Security, Vol. 56. Springer."},{"key":"e_1_2_1_27_1","volume-title":"Value-Focused Thinking: A Path to Creative Decisionmaking\/Ralph L. Keeney","author":"Keeney Ralph L.","unstructured":"Ralph L. Keeney . 1992. Value-Focused Thinking: A Path to Creative Decisionmaking\/Ralph L. Keeney . Harvard University Press , Cambridge, MA , xvi, 416. Ralph L. Keeney. 1992. Value-Focused Thinking: A Path to Creative Decisionmaking\/Ralph L. Keeney. Harvard University Press, Cambridge, MA, xvi, 416."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(96)00004-5"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201909)","author":"Kiekintveld Christopher","year":"2009","unstructured":"Christopher Kiekintveld , Manish Jain , Jason Tsai , James Pita , Fernando Ord\u00f3\u00f1ez , and Milind Tambe . 2009 a. Computing optimal randomized resource allocations for massive security games . In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201909) . 689--696. http:\/\/dl.acm.org\/citation.cfm?id&equals;1558013.1558108. Christopher Kiekintveld, Manish Jain, Jason Tsai, James Pita, Fernando Ord\u00f3\u00f1ez, and Milind Tambe. 2009a. Computing optimal randomized resource allocations for massive security games. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201909). 689--696. http:\/\/dl.acm.org\/citation.cfm?id&equals;1558013.1558108."},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201909)","author":"Kiekintveld Christopher","year":"2009","unstructured":"Christopher Kiekintveld , Manish Jain , Jason Tsai , James Pita , Fernando Ord\u00f3\u00f1ez , and Milind Tambe . 2009 b. Computing optimal randomized resource allocations for massive security games . In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201909) . 689--696. Christopher Kiekintveld, Manish Jain, Jason Tsai, James Pita, Fernando Ord\u00f3\u00f1ez, and Milind Tambe. 2009b. Computing optimal randomized resource allocations for massive security games. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201909). 689--696."},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Christopher Kiekintveld Viliam Lis\u00fd and Radek P\u00edbil. 2015. Game-theoretic foundations for the strategic use of honeypots in network security. In Cyber Warfare\u2014Building the Scientific Foundation. 81--101.  Christopher Kiekintveld Viliam Lis\u00fd and Radek P\u00edbil. 2015. Game-theoretic foundations for the strategic use of honeypots in network security. In Cyber Warfare\u2014Building the Scientific Foundation. 81--101.","DOI":"10.1007\/978-3-319-14039-1_5"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"A. Kim and M. H. Kang. 2011. Determining Asset Criticality for Cyber Defense. Retrieved from www.dtic.mil\/cgi-bin\/GetTRDoc?AD&equals;ADA550373.  A. Kim and M. H. Kang. 2011. Determining Asset Criticality for Cyber Defense. Retrieved from www.dtic.mil\/cgi-bin\/GetTRDoc?AD&equals;ADA550373.","DOI":"10.21236\/ADA550373"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3269"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321910"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201913)","author":"Letchford Joshua","year":"2013","unstructured":"Joshua Letchford and Yevgeniy Vorobeychik . 2013 . Optimal interdiction of attack plans . In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201913) . 199--206. http:\/\/dl.acm.org\/citation.cfm?id&equals;2484920.2484955. Joshua Letchford and Yevgeniy Vorobeychik. 2013. Optimal interdiction of attack plans. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201913). 199--206. http:\/\/dl.acm.org\/citation.cfm?id&equals;2484920.2484955."},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","unstructured":"R. P. Lippmann J. F. Riordan T. H. Yu and K. K. Watson. 2012. Continuous Security Metrics for Prevalent Network Threats: Introduction and First Four Metrics. Technical Report. DTIC Document.  R. P. Lippmann J. F. Riordan T. H. Yu and K. K. Watson. 2012. Continuous Security Metrics for Prevalent Network Threats: Introduction and First Four Metrics. Technical Report. DTIC Document.","DOI":"10.21236\/ADA565825"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2017.11"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-004-0060-x"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/777313.777327"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/997150.997156"},{"key":"e_1_2_1_42_1","unstructured":"NIST. 2017. National Vulnerability Database. Retrieved from http:\/\/nvd.nist.gov.  NIST. 2017. National Vulnerability Database. Retrieved from http:\/\/nvd.nist.gov."},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201908)","author":"Paruchuri Praveen","year":"2008","unstructured":"Praveen Paruchuri , Jonathan P. Pearce , Janusz Marecki , Milind Tambe , Fernando Ordonez , and Sarit Kraus . 2008 . Playing games for security: An efficient exact algorithm for solving bayesian stackelberg games . In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201908) . 895--902. Praveen Paruchuri, Jonathan P. Pearce, Janusz Marecki, Milind Tambe, Fernando Ordonez, and Sarit Kraus. 2008. Playing games for security: An efficient exact algorithm for solving bayesian stackelberg games. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201908). 895--902."},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201908)","author":"Pita James","year":"2008","unstructured":"James Pita , Manish Jain , Janusz Marecki , Fernando Ord\u00f3\u00f1ez , Christopher Portway , Milind Tambe , Craig Western , Praveen Paruchuri , and Sarit Kraus . 2008 . Deployed ARMOR protection: The application of a game theoretic model for security at the los angeles international airport . In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201908) . 125--132. James Pita, Manish Jain, Janusz Marecki, Fernando Ord\u00f3\u00f1ez, Christopher Portway, Milind Tambe, Craig Western, Praveen Paruchuri, and Sarit Kraus. 2008. Deployed ARMOR protection: The application of a game theoretic model for security at the los angeles international airport. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201908). 125--132."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2011.34"},{"key":"e_1_2_1_46_1","volume-title":"honeynet: A comparative survey","author":"Pouget Fabien","unstructured":"Fabien Pouget and Marc Dacier . 2003. Honeypot , honeynet: A comparative survey . In Institut Eur\u00c3l\u2019com . Fabien Pouget and Marc Dacier. 2003. Honeypot, honeynet: A comparative survey. In Institut Eur\u00c3l\u2019com."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832249.2832303"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699907"},{"key":"e_1_2_1_49_1","volume-title":"A Survey of Data Leakage Detection and Prevention Solutions","author":"Shabtai Asaf","unstructured":"Asaf Shabtai , Yuval Elovici , and Lior Rokach . 2012. Data leakage detection\/prevention solutions . In A Survey of Data Leakage Detection and Prevention Solutions . Springer , 17--37. Asaf Shabtai, Yuval Elovici, and Lior Rokach. 2012. Data leakage detection\/prevention solutions. In A Survey of Data Leakage Detection and Prevention Solutions. Springer, 17--37."},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the International Conference on Security and Cryptography (SECRYPT\u201914)","author":"Shakarian Paulo","year":"2014","unstructured":"Paulo Shakarian , Damon Paulo , Massimiliano Albanese , and Sushil Jajodia . 2014 . Keeping intrudors at large: A graph-theoretic approach to reducing the probability of successful network intrusions . In Proceedings of the International Conference on Security and Cryptography (SECRYPT\u201914) . 19--30. Paulo Shakarian, Damon Paulo, Massimiliano Albanese, and Sushil Jajodia. 2014. Keeping intrudors at large: A graph-theoretic approach to reducing the probability of successful network intrusions. In Proceedings of the International Conference on Security and Cryptography (SECRYPT\u201914). 19--30."},{"key":"e_1_2_1_51_1","volume-title":"Application of Genetic Algorithms for Detecting Anomaly in Network Intrusion Detection Systems","author":"Srinivasa K. G.","unstructured":"K. G. Srinivasa . 2012. Application of Genetic Algorithms for Detecting Anomaly in Network Intrusion Detection Systems . Springer , Berlin , 582--591. K. G. Srinivasa. 2012. Application of Genetic Algorithms for Detecting Anomaly in Network Intrusion Detection Systems. Springer, Berlin, 582--591."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1353-4858(11)70086-1"},{"key":"e_1_2_1_53_1","unstructured":"The MITRE Corporation. 2011. Common Weakness Scoring System (CWSS\u2122). Retrieved from http:\/\/cwe.mitre.org\/cwss\/.  The MITRE Corporation. 2011. Common Weakness Scoring System (CWSS\u2122). Retrieved from http:\/\/cwe.mitre.org\/cwss\/."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2560839"},{"key":"e_1_2_1_55_1","first-page":"33","article-title":"The island model genetic algorithm: On separability, population size and convergence","volume":"7","author":"Whitley Darrell","year":"1998","unstructured":"Darrell Whitley , Soraya Rana , and Robert B. Heckendorn . 1998 . The island model genetic algorithm: On separability, population size and convergence . J. Comput. Inf. Technol. 7 (1998), 33 -- 47 . Darrell Whitley, Soraya Rana, and Robert B. Heckendorn. 1998. The island model genetic algorithm: On separability, population size and convergence. J. Comput. Inf. Technol. 7 (1998), 33--47.","journal-title":"J. Comput. Inf. Technol."}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3137571","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3137571","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3137571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:10Z","timestamp":1750212670000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3137571"}},"subtitle":["A Stackelberg Honey-Based Adversarial Reasoning Engine"],"short-title":[],"issued":{"date-parts":[[2018,3,7]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,8,31]]}},"alternative-id":["10.1145\/3137571"],"URL":"https:\/\/doi.org\/10.1145\/3137571","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,7]]},"assertion":[{"value":"2016-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-03-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}