{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:43:24Z","timestamp":1769924604963,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["NI210100139"],"award-info":[{"award-number":["NI210100139"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,10]]},"DOI":"10.1145\/3579856.3590343","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:52:13Z","timestamp":1688568733000},"page":"993-1003","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["A Scalable Double Oracle Algorithm for Hardening Large Active Directory Systems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8602-0277","authenticated-orcid":false,"given":"Yumeng","family":"Zhang","sequence":"first","affiliation":[{"name":"The University of Adelaide, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9114-7339","authenticated-orcid":false,"given":"Max","family":"Ward","sequence":"additional","affiliation":[{"name":"University of Western Australia, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3478-9201","authenticated-orcid":false,"given":"Mingyu","family":"Guo","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1028-920X","authenticated-orcid":false,"given":"Hung","family":"Nguyen","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Australia"}]}],"member":"320","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2020.2988007"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2019.06.004"},{"key":"e_1_3_2_1_4_1","unstructured":"Lucas Bouillot and Emmanuel Gras. 2014. Chemins de contr\u00f4le en environnement Active Directory. (2014). https:\/\/www.sstic.org\/2014\/presentation\/chemins_de_controle_active_directory\/  Lucas Bouillot and Emmanuel Gras. 2014. Chemins de contr\u00f4le en environnement Active Directory. (2014). https:\/\/www.sstic.org\/2014\/presentation\/chemins_de_controle_active_directory\/"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315272"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629605"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2019.101578"},{"key":"e_1_3_2_1_8_1","volume-title":"Evolving Reinforcement Learning Environment to Minimize Learner\u2019s Achievable Reward: An Application on Hardening Active Directory Systems. arXiv preprint arXiv:2304.03998","author":"Goel Diksha","year":"2023","unstructured":"Diksha Goel , Aneta Neumann , Frank Neumann , Hung Nguyen , and Mingyu Guo . 2023. Evolving Reinforcement Learning Environment to Minimize Learner\u2019s Achievable Reward: An Application on Hardening Active Directory Systems. arXiv preprint arXiv:2304.03998 ( 2023 ). Diksha Goel, Aneta Neumann, Frank Neumann, Hung Nguyen, and Mingyu Guo. 2023. Evolving Reinforcement Learning Environment to Minimize Learner\u2019s Achievable Reward: An Application on Hardening Active Directory Systems. arXiv preprint arXiv:2304.03998 (2023)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528729"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21167"},{"key":"e_1_3_2_1_11_1","volume-title":"Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. arXiv preprint arXiv:2212.04326","author":"Guo Mingyu","year":"2022","unstructured":"Mingyu Guo , Max Ward , Aneta Neumann , Frank Neumann , and Hung Nguyen . 2022. Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. arXiv preprint arXiv:2212.04326 ( 2022 ). Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, and Hung Nguyen. 2022. Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. arXiv preprint arXiv:2212.04326 (2022)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2030470.2030518"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2019.100219"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 20th International Conference on Machine Learning (ICML-03)","author":"McMahan H\u00a0Brendan","year":"2003","unstructured":"H\u00a0Brendan McMahan , Geoffrey\u00a0 J Gordon , and Avrim Blum . 2003 . Planning in the presence of cost functions controlled by an adversary . In Proceedings of the 20th International Conference on Machine Learning (ICML-03) . 536\u2013543. H\u00a0Brendan McMahan, Geoffrey\u00a0J Gordon, and Avrim Blum. 2003. Planning in the presence of cost functions controlled by an adversary. In Proceedings of the 20th International Conference on Machine Learning (ICML-03). 536\u2013543."},{"key":"e_1_3_2_1_15_1","unstructured":"Andi Morris. [n. d.]. GoodHound. https:\/\/github.com\/idnahacks\/GoodHound. Accessed: 2022-12-14.  Andi Morris. [n. d.]. GoodHound. https:\/\/github.com\/idnahacks\/GoodHound. Accessed: 2022-12-14."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140549.3140562"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2602087.2602117"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIOT.2019.00038"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2011.34"},{"key":"e_1_3_2_1_20_1","unstructured":"Andy Robbins. [n. d.]. The Attack Path Management Manifesto. https:\/\/posts.specterops.io\/the-attack-path-management-manifesto-3a3b117f5e5. Accessed: 2022-12-14.  Andy Robbins. [n. d.]. The Attack Path Management Manifesto. https:\/\/posts.specterops.io\/the-attack-path-management-manifesto-3a3b117f5e5. Accessed: 2022-12-14."},{"key":"e_1_3_2_1_21_1","unstructured":"Andy Robbins. 2021. BloodHound versus Ransomware: A Defenders Guide. https:\/\/posts.specterops.io\/bloodhound-versus-ransomware-a-defenders-guide-28147dedb73b  Andy Robbins. 2021. BloodHound versus Ransomware: A Defenders Guide. https:\/\/posts.specterops.io\/bloodhound-versus-ransomware-a-defenders-guide-28147dedb73b"},{"key":"e_1_3_2_1_22_1","unstructured":"Andy Robbins Rohan Vazarkar and Will Schroeder. [n. d.]. BloodHound: Six Degrees of Domain Admin. https:\/\/bloodhound.readthedocs.io\/en\/latest\/index.html. Accessed: 2022-12-14.  Andy Robbins Rohan Vazarkar and Will Schroeder. [n. d.]. BloodHound: Six Degrees of Domain Admin. https:\/\/bloodhound.readthedocs.io\/en\/latest\/index.html. Accessed: 2022-12-14."},{"key":"e_1_3_2_1_23_1","volume-title":"Sawilla and Xinming Ou","author":"E.","year":"2008","unstructured":"Reginald\u00a0 E. Sawilla and Xinming Ou . 2008 . Identifying Critical Attack Assets in Dependency Attack Graphs. In Computer Security - ESORICS 2008, Sushil Jajodia and Javier Lopez (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg, 18\u201334. Reginald\u00a0E. Sawilla and Xinming Ou. 2008. Identifying Critical Attack Assets in Dependency Attack Graphs. In Computer Security - ESORICS 2008, Sushil Jajodia and Javier Lopez (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 18\u201334."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2002.1004377"},{"key":"e_1_3_2_1_25_1","volume-title":"Finding the k shortest loopless paths in a network. management Science 17, 11","author":"Yen Y","year":"1971","unstructured":"Jin\u00a0 Y Yen . 1971. Finding the k shortest loopless paths in a network. management Science 17, 11 ( 1971 ), 712\u2013716. Jin\u00a0Y Yen. 1971. Finding the k shortest loopless paths in a network. management Science 17, 11 (1971), 712\u2013716."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-022-00586-7"}],"event":{"name":"ASIA CCS '23: ACM ASIA Conference on Computer and Communications Security","location":"Melbourne VIC Australia","acronym":"ASIA CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3590343","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:16Z","timestamp":1750183696000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3590343"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":25,"alternative-id":["10.1145\/3579856.3590343","10.1145\/3579856"],"URL":"https:\/\/doi.org\/10.1145\/3579856.3590343","relation":{},"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"2023-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}