메뉴 건너뛰기




Volumn 13, Issue 2, 2011, Pages 187-200

SplitScreen: Enabling efficient, distributed malware detection

Author keywords

Anti malware; Bloom filter; Signature matching

Indexed keywords

BANDPASS FILTERS; DATA STRUCTURES; OPEN SOURCE SOFTWARE; OPEN SYSTEMS;

EID: 79956336732     PISSN: 12292370     EISSN: None     Source Type: Journal    
DOI: 10.1109/JCN.2011.6157418     Document Type: Article
Times cited : (39)

References (30)
  • 2
    • 85161649278 scopus 로고    scopus 로고
    • [Online]. Available
    • F-secure: Silent growth of malware accelerates. [Online]. Available: http://www.f-secure.com/en-EMEA/security/security-lab/latest-threats/se curity-threat-summaries/2008-2.html
    • Silent Growth of Malware Accelerates.
  • 3
    • 52149092178 scopus 로고    scopus 로고
    • The evolution of commercial malware development kits and colour-by-numbers custom malware
    • G. Ollmann, "The evolution of commercial malware development kits and colour-by-numbers custom malware," Computer Fraud & Security, vol. 9, 2008.
    • (2008) Computer Fraud & Security , vol.9
    • Ollmann, G.1
  • 4
    • 85038523591 scopus 로고    scopus 로고
    • [Online]. Available
    • T. Kojm. (2008). Introduction to ClamAV. [Online]. Available: http:// www.clamav.net/doc/webinars/Webinar-TK-2008-06-11 .pdf
    • (2008) Introduction to ClamAV.
    • Kojm, T.1
  • 5
    • 74049111426 scopus 로고    scopus 로고
    • Hash-AV: Fast virus signature scanning by cacheresident filters
    • O. Erdogan and P. Cao, "Hash-AV: Fast virus signature scanning by cacheresident filters," Int. J. Security Netw., vol. 50, no. 2, 2007.
    • (2007) Int. J. Security Netw. , vol.50 , Issue.2
    • Erdogan, O.1    Cao, P.2
  • 6
    • 84875615876 scopus 로고    scopus 로고
    • Exact pattern matching with feed-forward bloom filters
    • I. Moraru and D. G. Andersen, "Exact pattern matching with feed-forward bloom filters," in Proc. ALENEX, 2011.
    • (2011) Proc. ALENEX
    • Moraru, I.1    Andersen, D.G.2
  • 7
    • 85077723796 scopus 로고    scopus 로고
    • CloudAV: N-version antivirus in the network cloud
    • J. Oberheide, E. Cooke, and F. Jahanian. "CloudAV: N-version antivirus in the network cloud," in Proc. USENIX, 2008.
    • (2008) Proc. USENIX
    • Oberheide, J.1    Cooke, E.2    Jahanian, F.3
  • 9
    • 85161665971 scopus 로고    scopus 로고
    • [Online]. Available
    • T. Kojm. Clamav. [Online]. Available: http://www.clamav.net
    • Kojm, T.1
  • 10
    • 77955099121 scopus 로고    scopus 로고
    • Profiling and accelerating string matching algorithms in three network content security applications
    • Apr.
    • P.-C. Lin, Z.-X. Li, Y.-D. Lin, Y.-C. Lai, and F. Lin, "Profiling and accelerating string matching algorithms in three network content security applications," IEEE Commun. Surveys Tuts., vol. 8, pp. 24-37, Apr. 2006.
    • (2006) IEEE Commun. Surveys Tuts., Vol. , vol.8 , pp. 24-37
    • Lin, P.-C.1    Li, Z.-X.2    Lin, Y.-D.3    Lai, Y.-C.4    Lin, F.5
  • 11
    • 0016518897 scopus 로고
    • Efficient string matching: An aid to bibliographic search
    • A. V. Aho and M. J. Corasick, "Efficient string matching: An aid to bibliographic search," Commun., of the ACM, vol. 18, pp. 333-340, 1975.
    • (1975) Commun., of the ACM , vol.18 , pp. 333-340
    • Aho, A.V.1    Corasick, M.J.2
  • 13
    • 0017547820 scopus 로고
    • A fast string searching algorithm
    • R. S. Boyer and J. S. Moore, "A fast string searching algorithm," Commun. of the ACM, vol. 20, pp. 762-772, 1977.
    • (1977) Commun. of the ACM , vol.20 , pp. 762-772
    • Boyer, R.S.1    Moore, J.S.2
  • 14
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors," Commun, of the ACM, vol. 13, pp. 422-426, 1970.
    • (1970) Commun, of the ACM , vol.13 , pp. 422-426
    • Bloom, B.H.1
  • 15
  • 16
    • 0022030599 scopus 로고
    • Efficient randomized pattern-matching algorithms
    • R. M. Karp and M. O. Rabin, "Efficient randomized pattern-matching algorithms," IBM J. Research and Development, vol. 31, no. 2, pp. 249-260, 1987.
    • (1987) IBM J. Research and Development , vol.31 , Issue.2 , pp. 249-260
    • Karp, R.M.1    Rabin, M.O.2
  • 17
    • 85161666874 scopus 로고    scopus 로고
    • [Online]. Available
    • S. Ballmer. (2007). [Online]. Available: http://www.microsoft.com/msft/ speech/FY07/BallmerFAM2007.mspx
    • (2007)
    • Ballmer, S.1
  • 21
    • 0031177375 scopus 로고    scopus 로고
    • Recursive hashing functions for n-grams
    • J. D. Cohen, "Recursive hashing functions for n-grams," ACM Trans. Inf. Syst., vol. 15, no. 3, pp. 291-320, 1997.
    • (1997) ACM Trans. Inf. Syst. , vol.15 , Issue.3 , pp. 291-320
    • Cohen, J.D.1
  • 22
    • 52349121903 scopus 로고    scopus 로고
    • Less hashing, same performance: Building a better Bloom filter
    • A. Kirsch and M. Mitzenmacher, "Less hashing, same performance: Building a better Bloom filter," Random Structures & Algorithms, vol. 33, no. 2, pp. 187-218, 2008.
    • (2008) Random Structures & Algorithms , vol.33 , Issue.2 , pp. 187-218
    • Kirsch, A.1    Mitzenmacher, M.2
  • 25
    • 77952924818 scopus 로고    scopus 로고
    • Efficient signature based malware detection on mobile devices
    • D. Venugopal and G. Hu, "Efficient signature based malware detection on mobile devices," Mobile Inf. Syst., vol. 4, no. 1, pp. 33-49, 2008.
    • (2008) Mobile Inf. Syst. , vol.4 , Issue.1 , pp. 33-49
    • Venugopal, D.1    Hu, G.2


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