메뉴 건너뛰기




Volumn , Issue , 2009, Pages 891-898

Measuring similarity of malware behavior

Author keywords

[No Author keywords available]

Indexed keywords

ANTI-MALWARE; APPROPRIATE DISTANCES; BEHAVIORAL FEATURES; DISTANCE MEASURE; MALICIOUS SOFTWARE; MALWARES; MORPHING; SIMILARITY MEASURE; SYNTACTIC REPRESENTATION;

EID: 77951289154     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LCN.2009.5355037     Document Type: Conference Paper
Times cited : (41)

References (41)
  • 1
    • 84994705481 scopus 로고    scopus 로고
    • [Online]. Available
    • "Admmutate." [Online]. Available: http://www.securitylab.ru/- tools/ADMmutate-0.8.4.tar.gz
    • Admmutate
  • 3
    • 85066822149 scopus 로고    scopus 로고
    • Structural comparison of executable objects
    • Proc. of Dimva 2004, ser. GI
    • H. Flake, "Structural comparison of executable objects," in Proc. of Dimva 2004, ser. LNI, vol. 46. GI, 2004, pp. 161-173.
    • (2004) LNI , vol.46 , pp. 161-173
    • Flake, H.1
  • 5
    • 33745670395 scopus 로고    scopus 로고
    • Polymorphic worm detection using structural information of executables
    • Proc. of RAID2005, ser.
    • C. Kruegel, E. Kirda, D. Mutz, W. Robertson, and G. Vigna, "Polymorphic worm detection using structural information of executables," in Proc. of RAID2005, ser. LNCS, vol. 3858, 2005, pp. 207-226.
    • (2005) LNCS , vol.3858 , pp. 207-226
    • Kruegel, C.1    Kirda, E.2    Mutz, D.3    Robertson, W.4    Vigna, G.5
  • 6
    • 33746406796 scopus 로고    scopus 로고
    • Detecting self-mutating malware using control-flow graph matching
    • Proc. of Dimva 2006, ser. Springer
    • D. Bruschi, L. Martignoni, and M. Monga, "Detecting self-mutating malware using control-flow graph matching," in Proc. of Dimva 2006, ser. LNCS, vol. 4064. Springer, 2006, pp. 129-143.
    • (2006) LNCS , vol.4064 , pp. 129-143
    • Bruschi, D.1    Martignoni, L.2    Monga, M.3
  • 7
    • 33750376598 scopus 로고    scopus 로고
    • The Nepenthes platform: An efficient approach to collect malware
    • RAID, ser. Springer
    • P. Baecher, M. Koetter, T. Holz, M. Dornseif, and F. Freiling, "The Nepenthes platform: An efficient approach to collect malware," in RAID, ser. LNCS, no. 4219. Springer, 2006, pp. 165-184.
    • (2006) LNCS , Issue.4219 , pp. 165-184
    • Baecher, P.1    Koetter, M.2    Holz, T.3    Dornseif, M.4    Freiling, F.5
  • 8
    • 77951284396 scopus 로고    scopus 로고
    • [Online]. Available
    • "Amun: Python honeypot." [Online]. Available: http://amunhoney.sourceforge.net/
    • Amun: Python Honeypot
  • 10
    • 34047110218 scopus 로고    scopus 로고
    • Toward automated dynamic malware analysis using CWSandbox
    • C. Willems, T. Holz, and F. Freiling, "Toward automated dynamic malware analysis using CWSandbox," IEEE Security & Privacy, vol. 5, no. 2, pp. 32-39, 2007.
    • (2007) IEEE Security & Privacy , vol.5 , Issue.2 , pp. 32-39
    • Willems, C.1    Holz, T.2    Freiling, F.3
  • 12
    • 33746882464 scopus 로고    scopus 로고
    • Malware phylogeny generation using permutations of code
    • DOI 10.1007/s11416-005-0002-9
    • M. Karim, A. Walenstein, A. Lakhotia, and L. Parida, "Malware phylogeny generation using permutations of code," Journal in Computer Virology, vol.1, no.1-2, pp. 13-23, 2005. (Pubitemid 44195063)
    • (2005) Journal in Computer Virology , vol.1 , Issue.1-2 , pp. 13-23
    • Karim, Md.E.1    Walenstein, A.2    Lakhotia, A.3    Parida, L.4
  • 13
    • 77951268956 scopus 로고    scopus 로고
    • Analyzing worms and network traffic using compression
    • vol. abs/cs/0504045
    • S. Wehner, "Analyzing worms and network traffic using compression," CoRR, vol. abs/cs/0504045, 2005.
    • (2005) CoRR
    • Wehner, S.1
  • 16
    • 48649087530 scopus 로고    scopus 로고
    • Limits of static analysis for malware detection
    • IEEE Computer Society
    • A. Moser, C. Kruegel, and E. Kirda, "Limits of static analysis for malware detection," in Proc. of ACSAC 2007. IEEE Computer Society, 2007, pp. 421-430.
    • (2007) Proc. of ACSAC 2007 , pp. 421-430
    • Moser, A.1    Kruegel, C.2    Kirda, E.3
  • 18
    • 35348872682 scopus 로고    scopus 로고
    • The Daikon system for dynamic detection of likely invariants
    • DOI 10.1016/j.scico.2007.01.015, PII S016764230700161X, Experimental Software and Toolkits
    • M. D. Ernst, J. H. Perkins, P. J. Guo, S. McCamant, C. Pacheco, M. S. Tschantz, and C. Xiao, "The daikon system for dynamic detection of likely invariants," Science of Computer Programming, vol.69, no.1-3, pp. 35-45, 2007. (Pubitemid 350087239)
    • (2007) Science of Computer Programming , vol.69 , Issue.1-3 , pp. 35-45
    • Ernst, M.D.1    Perkins, J.H.2    Guo, P.J.3    McCamant, S.4    Pacheco, C.5    Tschantz, M.S.6    Xiao, C.7
  • 23
    • 77951264969 scopus 로고    scopus 로고
    • [Online]. Available
    • "Amsel project." [Online]. Available: http://ls6-www.cs. tudortmund.de/meier/AMSEL/
    • Amsel Project
  • 24
    • 0016518550 scopus 로고
    • A linear space algorithm for computing maximal common subsequences
    • D. S. Hirschberg, "A linear space algorithm for computing maximal common subsequences," Communications of the ACM, vol. 18, no. 6, pp. 341-343, 1975.
    • (1975) Communications of the ACM , vol.18 , Issue.6 , pp. 341-343
    • Hirschberg, D.S.1
  • 25
    • 84976825385 scopus 로고
    • Algorithms for the longest common subsequence problem
    • -, "Algorithms for the longest common subsequence problem," Journal of the ACM, vol. 24, no. 4, pp. 664-675, 1977.
    • (1977) Journal of the ACM , vol.24 , Issue.4 , pp. 664-675
  • 26
    • 33746191665 scopus 로고    scopus 로고
    • Identifying almost identical files using context triggered piecewise hashing
    • J. D. Kornblum, "Identifying almost identical files using context triggered piecewise hashing," Digital Investigation, vol. 3, no. Supplement-1, pp. 91-97, 2006.
    • (2006) Digital Investigation , vol.3 , Issue.SUPPL. 1 , pp. 91-97
    • Kornblum, J.D.1
  • 27
    • 84855816346 scopus 로고    scopus 로고
    • [Online]. Available
    • "Fuzzy hashing and ssdeep." [Online]. Available: http://ssdeep.sourceforge.net/
    • Fuzzy Hashing and Ssdeep
  • 33
    • 38049020011 scopus 로고    scopus 로고
    • Feature-based and feature-free textual cbr: A comparison in spam filtering
    • S. J. Delany and D. Bridge, "Feature-based and feature-free textual cbr: A comparison in spam filtering," in Proc. of AICS'06, 2006, pp. 244-253.
    • Proc. of AICS'06, 2006 , pp. 244-253
    • Delany, S.J.1    Bridge, D.2
  • 34
    • 84873559624 scopus 로고    scopus 로고
    • R.: Genre classification via an lz78-based string kernel
    • M. Li and R. Sleep, "R.: Genre classification via an lz78-based string kernel," in Proc. of ISMIR 2005, 2005, pp. 252-259.
    • Proc. of ISMIR 2005, 2005 , pp. 252-259
    • Li, M.1    Sleep, R.2
  • 37
    • 51849162587 scopus 로고    scopus 로고
    • Common pitfalls using the normalized compression distance: What to watch out for in a compressor
    • M. Cebrián, M. Alfonseca, and A. Ortega, "Common pitfalls using the normalized compression distance: what to watch out for in a compressor," Communications in Information and Systems, vol. 5, no. 4, pp. 367-384, 2005.
    • (2005) Communications in Information and Systems , vol.5 , Issue.4 , pp. 367-384
    • Cebrián, M.1    Alfonseca, M.2    Ortega, A.3
  • 38
    • 38949156579 scopus 로고    scopus 로고
    • Linear-time computation of similarity measures for sequential data
    • K. Rieck and P. Laskov, "Linear-time computation of similarity measures for sequential data." Journal of Machine Learning Research (JMLR), vol. 9, pp. 23-48, 2008.
    • (2008) Journal of Machine Learning Research (JMLR) , vol.9 , pp. 23-48
    • Rieck, K.1    Laskov, P.2
  • 40
    • 0001704377 scopus 로고
    • On-line construction of suffix trees
    • E. Ukkonen, "On-line construction of suffix trees," Algorithmica, vol. 14, no. 3, pp. 249-260, 1995.
    • (1995) Algorithmica , vol.14 , Issue.3 , pp. 249-260
    • Ukkonen, E.1
  • 41
    • 0014976008 scopus 로고
    • Graph-theoretical methods for detecting and describing gestalt clusters
    • C. T. Zahn, "Graph-theoretical methods for detecting and describing gestalt clusters," Transactions on Computers, vol. C-20, no.1, pp. 68-86, 1971.
    • (1971) Transactions on Computers , vol.C-20 , Issue.1 , pp. 68-86
    • Zahn, C.T.1


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