{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T03:04:32Z","timestamp":1768619072800,"version":"3.49.0"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000183","name":"ARO","doi-asserted-by":"publisher","award":["W911NF1410358"],"award-info":[{"award-number":["W911NF1410358"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"ARO","doi-asserted-by":"publisher","award":["W911NF1310421"],"award-info":[{"award-number":["W911NF1310421"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"ARO","doi-asserted-by":"publisher","award":["W911NF1510576"],"award-info":[{"award-number":["W911NF1510576"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N000141512742"],"award-info":[{"award-number":["N000141512742"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N000141512007"],"award-info":[{"award-number":["N000141512007"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N000141612896"],"award-info":[{"award-number":["N000141612896"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"MIUR","doi-asserted-by":"crossref","award":["PON03PE_00032_2"],"award-info":[{"award-number":["PON03PE_00032_2"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"crossref"}]},{"name":"EU H2020 Research and Innovation Program through the Marie Sklodowska-Curie","award":["N690974"],"award-info":[{"award-number":["N690974"]}]},{"DOI":"10.13039\/501100002923","name":"CONICET, Agencia Nacional de Promoci\u00f3n Cient\u00edfica y Tecnol\u00f3gica","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005740","name":"Universidad Nacional del Sur, Argentina","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005740","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/tifs.2017.2710945","type":"journal-article","created":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T14:06:38Z","timestamp":1496325998000},"page":"2532-2544","source":"Crossref","is-referenced-by-count":35,"title":["A Probabilistic Logic of Cyber Deception"],"prefix":"10.1109","volume":"12","author":[{"given":"Sushil","family":"Jajodia","sequence":"first","affiliation":[]},{"given":"Noseong","family":"Park","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Pierazzi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4385-958X","authenticated-orcid":false,"given":"Andrea","family":"Pugliese","sequence":"additional","affiliation":[]},{"given":"Edoardo","family":"Serra","sequence":"additional","affiliation":[]},{"given":"Gerardo I.","family":"Simari","sequence":"additional","affiliation":[]},{"given":"V. S.","family":"Subrahmanian","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-14039-1","author":"jajodia","year":"2015","journal-title":"Cyber Warfare—Building the Scientific Foundation"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14039-1_5"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0160-y"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315272"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2699907"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1128817.1128850"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-004-0060-x"},{"key":"ref36","first-page":"1","article-title":"Honeypot, honeynet: A comparative survey","author":"pouget","year":"2003","journal-title":"Proc Inst Eurcom"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.05.018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2011.34"},{"key":"ref10","first-page":"295","article-title":"Computing most probable worlds of action probabilistic logic programs: Scalable estimation for 10 30,000 worlds","volume":"51","author":"khuller","year":"2007","journal-title":"Proceedings of AMAI"},{"key":"ref40","first-page":"1","article-title":"Keeping intrudors at large: A graph-theoretic approach to reducing the probability of successful network intrusions","author":"shakarian","year":"2014","journal-title":"Proc SECRYPT"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9236(88)90128-5"},{"key":"ref12","author":"hooker","year":"2011","journal-title":"Logic-Based Methods for Optimization Combining Optimization and Constraint Satisfaction"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0098-1354(93)E0010-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/137097.137892"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/195613.195637"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/41625.41635"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36388-2_6"},{"key":"ref18","first-page":"1","article-title":"An expert system for analyzing Firewall rules","author":"eronen","year":"2001","journal-title":"Proc NordSec"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45789-5_24"},{"key":"ref28","first-page":"137","article-title":"Access control: Policies, models, and mechanisms","author":"samarati","year":"2000","journal-title":"Proc of FOSAD"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2011.6127490"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/383891.383894"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013500812258"},{"key":"ref6","author":"devore","year":"2015","journal-title":"Probability and Statistics for Engineering and the Sciences"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1380564.1380569"},{"key":"ref5","author":"issariyakul","year":"2008","journal-title":"Introduction to Network Simulator NS2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1877714.1877720"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177730491"},{"key":"ref2","first-page":"2","article-title":"MIMIC: Finding optima by estimating probability densities","author":"bonet","year":"1996","journal-title":"Proc NIPS"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2159531.2159535"},{"key":"ref1","year":"2016","journal-title":"NIST National vulnerability database Website"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CNS.2015.7346842"},{"key":"ref20","article-title":"Expression of confidentiality policies with deontic logic","author":"bieber","year":"1992","journal-title":"Deontic Logic in Computer Science"},{"key":"ref45","first-page":"472","article-title":"Manipulating the attacker’s view of a system’s attack surface","author":"albanese","year":"2014","journal-title":"Proc CNSR"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56039-4_55"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/146937.146940"},{"key":"ref42","author":"alpcan","year":"2010","journal-title":"Network Security A Decision and Game-Theoretic Approach"},{"key":"ref24","first-page":"409","article-title":"Data privacy for knowledge bases","author":"stouppa","year":"2009","journal-title":"Proc LFCS"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02882-3_2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/195664.195675"},{"key":"ref44","first-page":"199","article-title":"Optimal interdiction of attack plans","author":"letchford","year":"2013","journal-title":"Proc AAMAS"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304192"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394923"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-023X(01)00024-6"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/7990663\/07937934.pdf?arnumber=7937934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:35Z","timestamp":1641987575000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7937934\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":46,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tifs.2017.2710945","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}