{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:43:45Z","timestamp":1764996225550,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T00:00:00Z","timestamp":1566777600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Bundesministerium f\u00fcr Wirtschaft und Energie","award":["20X1719E"],"award-info":[{"award-number":["20X1719E"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,26]]},"DOI":"10.1145\/3339252.3339254","type":"proceedings-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T12:21:03Z","timestamp":1565353263000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Towards Efficient Reconstruction of Attacker Lateral Movement"],"prefix":"10.1145","author":[{"given":"Florian","family":"Wilkens","sequence":"first","affiliation":[{"name":"Universit\u00e4t Hamburg, Germany"}]},{"given":"Steffen","family":"Haas","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Hamburg, Germany"}]},{"given":"Dominik","family":"Kaaser","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Hamburg, Germany"}]},{"given":"Peter","family":"Kling","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Hamburg, Germany"}]},{"given":"Mathias","family":"Fischer","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Hamburg, Germany"}]}],"member":"320","published-online":{"date-parts":[[2019,8,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"R\u00e9ka Albert and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2002. Statistical mechanics of complex networks. Reviews of Modern Physics.  R\u00e9ka Albert and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2002. Statistical mechanics of complex networks. Reviews of Modern Physics.","DOI":"10.1103\/RevModPhys.74.47"},{"volume-title":"University of Konstanz","year":"2009","author":"Algorithmics Group","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSAC.2005.6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Ping Chen Lieven Desmet and Christophe Huygens. 2014. A Study on Advanced Persistent Threats. Communications and Multimedia Security.  Ping Chen Lieven Desmet and Christophe Huygens. 2014. A Study on Advanced Persistent Threats. Communications and Multimedia Security.","DOI":"10.1007\/978-3-662-44885-4_5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3167132.3167239"},{"volume-title":"A formal basis for the heuristic determination of minimum cost paths","author":"Hart Peter E","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","unstructured":"NIST. 2011. Managing Information Security Risk: Organization Mission and Information System View. Nist Special Publication.  NIST. 2011. Managing Information Security Risk: Organization Mission and Information System View. Nist Special Publication."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/310889.310919"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2012.10.022"},{"volume-title":"IEEE Symposium on Security and Privacy (S&P).","author":"Sheyner O.","key":"e_1_3_2_1_13_1"},{"volume-title":"DARPA Information Survivability Conference and Exposition DISCEX.","author":"Swiler L. P.","key":"e_1_3_2_1_14_1"},{"volume-title":"Threat Report","year":"2016","key":"e_1_3_2_1_15_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2016.7460498"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2006.04.001"},{"key":"e_1_3_2_1_18_1","unstructured":"Jin Y. Yen. 1971. Finding the K Shortest Loopless Paths in a Network. Management Science.  Jin Y. Yen. 1971. Finding the K Shortest Loopless Paths in a Network. Management Science."}],"event":{"name":"ARES '19: 14th International Conference on Availability, Reliability and Security","acronym":"ARES '19","location":"Canterbury CA United Kingdom"},"container-title":["Proceedings of the 14th International Conference on Availability, Reliability and Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3339252.3339254","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3339252.3339254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:17Z","timestamp":1750203857000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3339252.3339254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,26]]},"references-count":18,"alternative-id":["10.1145\/3339252.3339254","10.1145\/3339252"],"URL":"https:\/\/doi.org\/10.1145\/3339252.3339254","relation":{},"subject":[],"published":{"date-parts":[[2019,8,26]]},"assertion":[{"value":"2019-08-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}