메뉴 건너뛰기




Volumn 31, Issue 10, 2008, Pages 1934-1944

Game theoretic models for detecting network intrusions

Author keywords

Intrusion detection system; Network security; Non cooperative game theory

Indexed keywords

GAME THEORY; INTERFACES (COMPUTER); MATHEMATICAL MODELS; PACKET NETWORKS; PROBABILITY; ROUTERS;

EID: 44549084937     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2007.12.028     Document Type: Article
Times cited : (32)

References (18)
  • 3
    • 44549085439 scopus 로고    scopus 로고
    • T. Ptacek, T. Newsham, Insertion, evasion, and denial of service: eluding network intrusion detection. Available from: 7 (1).
    • T. Ptacek, T. Newsham, Insertion, evasion, and denial of service: eluding network intrusion detection. Available from: 7 (1).
  • 4
    • 1542288809 scopus 로고    scopus 로고
    • Game theoretic approach to decision and analysis in network intrusion detection
    • IEEE, Hawaii
    • Alpcan T., and Basar T. Game theoretic approach to decision and analysis in network intrusion detection. Proceedings of the 42nd IEEE CDC (2003), IEEE, Hawaii 2595-2600
    • (2003) Proceedings of the 42nd IEEE CDC , pp. 2595-2600
    • Alpcan, T.1    Basar, T.2
  • 7
    • 16644384919 scopus 로고    scopus 로고
    • Incentive-based modeling and inference of attacker intent, objectives, and strategies
    • Liu P., and Zang W. Incentive-based modeling and inference of attacker intent, objectives, and strategies. ACM Trans. Inf. Syst. Secur. 8 1 (2005) 78-118
    • (2005) ACM Trans. Inf. Syst. Secur. , vol.8 , Issue.1 , pp. 78-118
    • Liu, P.1    Zang, W.2
  • 8
    • 0042474230 scopus 로고    scopus 로고
    • M. Kodialam, T.V. Lakshman, Detecting network intrusions via sampling: a game theoretic approach, in: Proceedings of the 22nd Annual Joint Conference of IEEE Computer and Communication Societies INFOCOM 2003, California, 2003.
    • M. Kodialam, T.V. Lakshman, Detecting network intrusions via sampling: a game theoretic approach, in: Proceedings of the 22nd Annual Joint Conference of IEEE Computer and Communication Societies INFOCOM 2003, California, 2003.
  • 12
    • 9644266731 scopus 로고    scopus 로고
    • V. Conitzer, T. Sandholm, Computing shapley values, manipulating value division schemes, and checking core membership in multi-issue domains, in: Proceedings of the AAAI, 2004, pp. 219-225.
    • V. Conitzer, T. Sandholm, Computing shapley values, manipulating value division schemes, and checking core membership in multi-issue domains, in: Proceedings of the AAAI, 2004, pp. 219-225.
  • 13
    • 0031176702 scopus 로고    scopus 로고
    • A simple min-cut algorithm
    • Stoer M., and Wagner F. A simple min-cut algorithm. J. ACM (JACM) 44 4 (1997) 585-591
    • (1997) J. ACM (JACM) , vol.44 , Issue.4 , pp. 585-591
    • Stoer, M.1    Wagner, F.2
  • 14
    • 44549088060 scopus 로고    scopus 로고
    • V. Sharma, F. Hellstrand, Framework for multi-protocol label switching (MPLS)-based recovery, RFC 3469, 2003.
    • V. Sharma, F. Hellstrand, Framework for multi-protocol label switching (MPLS)-based recovery, RFC 3469, 2003.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.