Towards a theory of insider threat assessment

作者: R. Chinchani , A. Iyer , H.Q. Ngo , S. Upadhyaya

DOI: 10.1109/DSN.2005.94

关键词:

摘要: Insider attacks are a well-known problem acknowledged as threat early 1980s. The is attributed to legitimate users who abuse their privileges, and given familiarity proximity the computational environment, can easily cause significant damage or losses. Due lack of tools techniques, security analysts do not correctly perceive threat, hence consider unpreventable. In this paper, we present theory insider assessment. First, describe modeling methodology which captures several aspects subsequently, show assessment methodologies reveal possible attack strategies an insider.

参考文章(17)
Catherine Meadows, R Wright, P Neumann, A representation of protocol attacks for risk assessment. Network Threats. pp. 1- 10 ,(1996)
Shmuel Safra, Irit Dinur, On the Hardness of Approximating Label Cover Electronic Colloquium on Computational Complexity. ,vol. 6, ,(1999)
Janusz Górski, Andrzej Wardziński, Formalising Fault Trees Springer, London. pp. 311- 327 ,(1995) , 10.1007/978-1-4471-3003-1_18
Johan Håstad, Some Recent Strong Inapproximability Results scandinavian workshop on algorithm theory. pp. 205- 209 ,(1998) , 10.1007/BFB0054368
Sanjeev Arora, Shmuel Safra, Probabilistic checking of proofs: a new characterization of NP Journal of the ACM. ,vol. 45, pp. 70- 122 ,(1998) , 10.1145/273865.273901
Ramkumar Chinchani, Duc Ha, Anusha Iyer, Hung Q. Ngo, Shambhu Upadhyaya, On The Hardness of Approximating the Min-Hack Problem Journal of Combinatorial Optimization. ,vol. 9, pp. 295- 311 ,(2005) , 10.1007/S10878-005-1413-8
Christos H. Papadimitriou, Mihalis Yannakakis, Optimization, approximation, and complexity classes Journal of Computer and System Sciences. ,vol. 43, pp. 425- 440 ,(1991) , 10.1016/0022-0000(91)90023-X
Cynthia Phillips, Laura Painton Swiler, None, A graph-based system for network-vulnerability analysis new security paradigms workshop. pp. 71- 79 ,(1998) , 10.1145/310889.310919
Uriel Feige, Shafi Goldwasser, Laszlo Lovász, Shmuel Safra, Mario Szegedy, Interactive proofs and the hardness of approximating cliques Journal of the ACM. ,vol. 43, pp. 268- 292 ,(1996) , 10.1145/226643.226652