{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T14:43:14Z","timestamp":1573137794299},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319140384","type":"print"},{"value":"9783319140391","type":"electronic"}],"license":[{"URL":"http:\/\/www.springer.com\/tdm","start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"delay-in-days":0,"content-version":"tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14039-1_5","type":"book-chapter","created":{"date-parts":[[2015,4,9]],"date-time":"2015-04-09T10:58:09Z","timestamp":1428577089000},"page":"81-101","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Game-Theoretic Foundations for the Strategic Use of Honeypots in Network Security"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Kiekintveld","sequence":"first","affiliation":[]},{"given":"Viliam","family":"Lis\u00fd","sequence":"additional","affiliation":[]},{"given":"Radek","family":"P\u00edbil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,10]]},"reference":[{"key":"5_CR1","unstructured":"B. Bosansky, C. Kiekintveld, V. Lisy, J. Cermak, and M. Pechoucek. Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games. InProceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2013), 2013"},{"key":"5_CR2","unstructured":"A. Buldas and R. Stepanenko. Upper bounds for adversaries\u2019 utility in attack trees. In J. Grossklags and J. Walrand, editors,Decision and Game Theory for Security, volume 7638 of Lecture Notes in Computer Science, pages\u00a098\u2013117. Springer Berlin Heidelberg, 2012.","DOI":"10.1007\/978-3-642-34266-0_6","doi-asserted-by":"crossref"},{"key":"5_CR3","unstructured":"C. F. Camerer.Behavioral Game Theory: Experiments in Strategic Interaction. Princeton University Press, 2003."},{"key":"5_CR4","unstructured":"F. Cohen. A mathematical structure of simple defensive network deception.Computers & Security, 19(6):520\u2013528, 2000.","DOI":"10.1016\/S0167-4048(00)06026-0","doi-asserted-by":"crossref"},{"key":"5_CR5","unstructured":"M. Dornseif and T. Holz. Nosebreak-attacking honeynets. In2004 IEEE Workshop on Information Assurance and Security, 2004."},{"key":"5_CR6","unstructured":"K. Durkota and V. Lisy. Computing optimal policies for attack graphs with action failures and costs. InSTAIRS 2014: Proceedings of the Seventh Starting Ai Researchers\u2019 Symposium, page (to appear). IOS Press, 2014."},{"key":"5_CR7","unstructured":"D. Fudenberg and D. K. Levine.The Theory of Learning in Games. MIT Press, 1998."},{"key":"5_CR8","unstructured":"K. Ingols, R. Lippmann, and K. Piwowarski. Practical attack graph generation for network defense. InComputer Security Applications Conference, 2006. ACSAC'06. 22nd Annual, pages\u00a0121\u2013130. IEEE, 2006.","DOI":"10.1109\/ACSAC.2006.39","doi-asserted-by":"crossref"},{"key":"5_CR9","unstructured":"M. Jain, D. Korzhyk, O. Vanek, V. Conitzer, M. Pechoucek, and M. Tambe. A double oracle algorithm for zero-sum security games on graphs. InInternational Conference on Autonomous Agents and Multiagent Systems, 2011."},{"key":"5_CR10","unstructured":"G. S. Kc, A. D. Keromytis, and V. Prevelakis. Countering code-injection attacks with instruction-set randomization. InProceedings of the 10th ACM Conference on Computer and Communications Security, CCS '03, pages\u00a0272\u2013280, New York, NY, USA, 2003. ACM."},{"key":"5_CR11","unstructured":"C. Kiekintveld.Empirical Game-Theoretic Methods for Strategy Design and Analysis in Complex Games. PhD thesis, Universit y of Michigan, 2008."},{"key":"5_CR12","unstructured":"C. Kiekintveld, M. Jain, J. Tsai, J. Pita, F. Ordonez, and M. Tambe. Computing optimal randomized resource allocations for massive security games. InAAMAS-09, 2009."},{"key":"5_CR13","unstructured":"K. Lee. On a deception game with three boxes.International Journal of Game Theory, 22(2):89\u201395, 1993.","DOI":"10.1007\/BF01243643","doi-asserted-by":"crossref"},{"key":"5_CR14","unstructured":"V. Lisy and R. Pibil. Computing optimal attack strategies using unconstrained influence diagrams. In G. Wang, X. Zheng, M. Chau, and H. Chen, editors,Intelligence and Security Informatics, volume 8039 of Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013.","DOI":"10.1007\/978-3-642-39693-9_5","doi-asserted-by":"crossref"},{"key":"5_CR15","unstructured":"J. Nash. Non-cooperative games.The Annals of Mathematics, 54(2):286\u2013295, 1951.","DOI":"10.2307\/1969529","doi-asserted-by":"crossref"},{"key":"5_CR16","unstructured":"M. J. Osborne.An Introduction to Game Theory. Oxford University Press, 2004."},{"key":"5_CR17","unstructured":"X. Ou, W. Boyer, and M. McQueen. A scalable approach to attack graph generation. InProceedings of the 13th ACM conference on Computer and communications security, pages\u00a0336\u2013345. ACM, 2006.","DOI":"10.1145\/1180405.1180446","doi-asserted-by":"crossref"},{"key":"5_CR18","unstructured":"R. Pibil, V. Lisy, C. Kiekintveld, B. Bosansky, and M. Pechoucek. Game theoretic model of strategic honeypot selection in computer networks. In J. Grossklags and J. Walrand, editors,Decision and Game Theory for Security, volume 7638 ofLecture Notes in Computer Science. Springer Berlin Heidelberg, 2012.","DOI":"10.1007\/978-3-642-34266-0_12","doi-asserted-by":"crossref"},{"key":"5_CR19","unstructured":"J. Pita, M. Jain, C. Western, C. Portway, M. Tambe, F. Ordonez, S. Kraus, and P. Parachuri. Depoloyed ARMOR protection: The application of a game-theoretic model for security at the Los Angeles International Airport. InAAMAS-08 (Industry Track), 2008."},{"key":"5_CR20","unstructured":"J. Pita, M. Tambe, C. Kiekintveld, S. Cullen, and E. Steigerwald. GUARDS\u2014game theoretic security allocation on a national scale. InAAMAS-11 (Industry Track), 2011."},{"key":"5_CR21","unstructured":"N. C. Rowe, E. J. Custy, and B. T. Duong. Defending Cyberspace with Fake Honeypots.Journal of Computers, 2(2):25\u201336, Apr. 2007.","DOI":"10.4304\/jcp.2.2.25-36","doi-asserted-by":"crossref"},{"key":"5_CR22","unstructured":"T. Sandholm. The state of solving large incomplete-information games, and application to poker.AI Magazine, Special Issue on Algorithmic Game Theory, 2010.","DOI":"10.1609\/aimag.v31i4.2311","doi-asserted-by":"crossref"},{"key":"5_CR23","unstructured":"T. Sandholm and S. Singh. Lossy stochastic game abstraction with bounds. InACM Conference on Electronic Commerce (EC), 2012.","DOI":"10.1145\/2229012.2229079","doi-asserted-by":"crossref"},{"key":"5_CR24","unstructured":"E. Shieh, B. An, R. Yang, M. Tambe, C. Baldwin, J. Direnzo, G. Meyer, C. W. Baldwin, B. J. Maule, and G. R. Meyer. PROTECT: A Deployed Game Theoretic System to Protect the Ports of the United States.AAMAS, 2012."},{"key":"5_CR25","unstructured":"Y. Shoham and K. Leyton-Brown.Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press, 2009.","DOI":"10.1017\/CBO9780511811654","doi-asserted-by":"crossref"},{"key":"5_CR26","unstructured":"J. Spencer. A deception game.American Mathematical Monthly, page 416\u2013417, 1973.","DOI":"10.1080\/00029890.1973.11993302","doi-asserted-by":"crossref"},{"key":"5_CR27","unstructured":"L. Spitzner.Honeypots: tracking hackers. Addison-Wesley Professional, 2003."},{"key":"5_CR28","unstructured":"M. Tambe.Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned. Cambridge University Press, 2011."},{"key":"5_CR29","unstructured":"J. Tsai, Y. Qian, Y. Vorobeychik, C. Kiekintveld, and M. Tambe. Bayesian security games for controlling contagion. InIn Proceedings of the ASE\/IEEE International Conference on Social Computing(SocialCom), 2013.","DOI":"10.1109\/SocialCom.2013.11","doi-asserted-by":"crossref"},{"key":"5_CR30","unstructured":"J. Tsai, S. Rathi, C. Kiekintveld, F. Ord\u00f3 nez, and M. Tambe. IRIS\u2014A tools for strategic security allocation in transportation networks. InAAMAS-09 (Industry Track), 2009."}],"container-title":["Advances in Information Security","Cyber Warfare"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14039-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T19:49:23Z","timestamp":1559159363000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319140384","9783319140391"],"references-count":30,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-319-14039-1_5","relation":{"cites":[]},"ISSN":["1568-2633"],"issn-type":[{"value":"1568-2633","type":"print"}],"assertion":[{"value":"10 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}