loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Paulo Shakarian 1 ; Damon Paulo 2 ; Massimiliano Albanese 3 and Sushil Jajodia 4

Affiliations: 1 Arizona State University, United States ; 2 U.S. Military Academy, United States ; 3 George Mason University, United States ; 4 George Mason University and The MITRE Corporation, United States

ISBN: 978-989-758-045-1

Keyword(s): Moving Target Defense, Adversarial Modeling, Graph Theory.

Related Ontology Subjects/Areas/Topics: Information and Systems Security ; Insider Threats and Countermeasures ; Network Security ; Wireless Network Security

Abstract: It is well known that not all intrusions can be prevented and additional lines of defense are needed to deal with intruders. However, most current approaches use honeynets relying on the assumption that simply attracting intruders into honeypots would thwart the attack. In this paper, we propose a different and more realistic approach, which aims at delaying intrusions, so as to control the probability that an intruder will reach a certain goal within a specified amount of time. Our method relies on analyzing a graphical representation of the computer network’s logical layout and an associated probabilistic model of the adversary’s behavior. We then artificially modify this representation by adding “distraction clusters” – collections of interconnected virtual machines – at key points of the network in order to increase complexity for the intruders and delay the intrusion. We study this problem formally, showing it to be NP-hard and then provide an approximation algo- rithm that exhib its several useful properties. Finally, we present experimental results obtained on a prototypal implementation of the proposed framework. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.227.233.78

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Shakarian, P.; Paulo, D.; Albanese, M. and Jajodia, S. (2014). Keeping Intruders at Large - A Graph-theoretic Approach to Reducing the Probability of Successful Network Intrusions.In Proceedings of the 11th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2014) ISBN 978-989-758-045-1, pages 19-30. DOI: 10.5220/0005013800190030

@conference{secrypt14,
author={Paulo Shakarian. and Damon Paulo. and Massimiliano Albanese. and Sushil Jajodia.},
title={Keeping Intruders at Large - A Graph-theoretic Approach to Reducing the Probability of Successful Network Intrusions},
booktitle={Proceedings of the 11th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2014)},
year={2014},
pages={19-30},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005013800190030},
isbn={978-989-758-045-1},
}

TY - CONF

JO - Proceedings of the 11th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2014)
TI - Keeping Intruders at Large - A Graph-theoretic Approach to Reducing the Probability of Successful Network Intrusions
SN - 978-989-758-045-1
AU - Shakarian, P.
AU - Paulo, D.
AU - Albanese, M.
AU - Jajodia, S.
PY - 2014
SP - 19
EP - 30
DO - 10.5220/0005013800190030

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.