메뉴 건너뛰기




Volumn 3679 LNCS, Issue , 2005, Pages 267-286

Towards a theory of intrusion detection

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; SECURITY OF DATA;

EID: 33646021971     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11555827_16     Document Type: Conference Paper
Times cited : (11)

References (25)
  • 2
    • 0033281215 scopus 로고    scopus 로고
    • The base-rate fallacy and its implication for the difficulty of intrusion detection
    • S. Axelsson, The Base-Rate Fallacy and its Implication for the Difficulty of Intrusion Detection, in Proc. of ACM CCS, 1999.
    • (1999) Proc. of ACM CCS
    • Axelsson, S.1
  • 3
    • 0003516333 scopus 로고    scopus 로고
    • Intrusion detection systems: A survey and taxonomy
    • Depart, of Computer Engineering, Chalmers University, march
    • S. Axelsson, Intrusion Detection Systems: A Survey and Taxonomy, Technical Report 99-15, Depart, of Computer Engineering, Chalmers University, march 2000.
    • (2000) Technical Report , vol.99 , Issue.15
    • Axelsson, S.1
  • 5
    • 33646060640 scopus 로고    scopus 로고
    • Cisco Flow Collector Overview, http://www.cisco.com//univercdcc/td/doc/ product/rtrmgmt/nfc/nfc_3_0/nfc_ug/nfcover.pdf
    • Cisco Flow Collector Overview
  • 6
    • 84948958135 scopus 로고    scopus 로고
    • How to break a practical mix and design a new one
    • Proc. of Eurocrypt , Springer
    • Y. Desmedt and K. Kurosawa, How to Break a Practical Mix and Design a New One, in Proc. of Eurocrypt 2000, LNCS vol. 1807, Springer.
    • (2000) LNCS , vol.1807
    • Desmedt, Y.1    Kurosawa, K.2
  • 17
    • 33646045812 scopus 로고    scopus 로고
    • Netflow, IETF RFC, ftp://ftp.rfc-editor.org/innotes/rfc3954.txt
    • Netflow, IETF RFC
  • 18
    • 0002022607 scopus 로고
    • Upper bounds for covering designs by simulated annealing
    • K. Nurmela and P. Ostergard, Upper Bounds for Covering Designs by Simulated Annealing, Congressum Numerantium, 96:93-111, 1993.
    • (1993) Congressum Numerantium , vol.96 , pp. 93-111
    • Nurmela, K.1    Ostergard, P.2
  • 19
    • 0039527186 scopus 로고    scopus 로고
    • An application of covering designs: Determining the maximum consistent set of shares in a threshold scheme
    • R. Rees, D. R. Stinson, R. Wei and G. H. J. van Rees, An application of covering designs: Determining the maximum consistent set of shares in a threshold scheme, Ars Combinatoria 531 (1999), 225-237.
    • (1999) Ars Combinatoria , vol.531 , pp. 225-237
    • Rees, R.1    Stinson, D.R.2    Wei, R.3    Van Rees, G.H.J.4
  • 22
    • 33646036948 scopus 로고    scopus 로고
    • http://www.snort.org
  • 24
    • 85037867044 scopus 로고    scopus 로고
    • Theory and application of trapdoor functions
    • A. Yao, Theory and Application of Trapdoor Functions, in Proc. of FOCS 85.
    • Proc. of FOCS 85
    • Yao, A.1


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