The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Static Analysis of Executables to Detect Malicious Patterns
Abstract
Abstract Malicious code detection is a crucial component of any defense mechanism. In this paper, we present a uniqueviewpoint on malicious code detection. We regard malicious code detection as an obfuscation-deobfuscation game between malicious code writers and researchers working on malicious code detection. Malicious code writers attemptto obfuscate the malicious code to subvert the malicious code detectors, such as anti-virus software. We tested the resilience of three commercial virus scanners against code obfuscation attacks. The results were surprising: the threecommercial virus scanners could be subverted by very simple obfuscation transformations! We present an architecture for detecting malicious patterns in executables that is resilient to common obfuscation transformations. Experimentalresults demonstrate the efficacy of our prototype tool, SAFE (a static analyzer for executables). 1 Introduction In the interconnected world of computers, malicious code has become an omnipresent and dangerous threat. Maliciouscode can infiltrate hosts using a variety of methods such as attacks against known software flaws, hidden functionality in regular programs, and social engineering. Given the devastating effect malicious code has on our cyber infrastruc-ture, identifying malicious programs is an important goal. Detecting the presence of malicious code on a given host is a crucial component of any defense mechanism. Malicious code is usually classified [28] according to its propagation method and goal into the following categories:*
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Advanced Compiler Design and Implementation
Muchnick, S. S. (1997) · Cited by 2,312
Automatic discovery of linear restraints among variables of a program
Cousot, P., & Halbwachs, N. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512770 · Cited by 1,614
Precise interprocedural dataflow analysis via graph reachability
Reps, T., Horwitz, S., & Sagiv, M. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199462 · Cited by 1,170
How to Own the Internet in Your Spare Time
Staniford, S., Paxson, V., & Weaver, N. C. (2002) · USENIX Security Symposium · Cited by 1,169
Bandera: extracting finite-state models from Java source code
Corbett, J. C., Dwyer, M. B., Hatcliff, J., Laubach, S., Păsăreanu, C. S., Robby, & Zheng, H. (2000) · Proceedings of the 22nd international conference on Software engineering - ICSE '00 · doi:10.1145/337180.337234 · Cited by 1,059
First-Order Logic and Automated Theorem Proving
Fitting, M. (1996) · Springer eBooks · doi:10.1007/978-1-4612-2360-3 · Cited by 950
A Taxonomy of Obfuscating Transformations
Collberg, C. S., Thomborson, C. D., & Low, D. (1997) · Cited by 852
Cohen, F. (1987) · Computers & Security · doi:10.1016/0167-4048(87)90122-2 · Cited by 754
Intrusion detection via static analysis
Wagner, D., & Dean, R. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924296 · Cited by 647
Cited by
Crowdroid: behavior-based malware detection system for Android
Burguera, I., Zurutuza, U., & Nadjm-Tehrani, S. (2011) · Proceedings of the 1st ACM workshop on Security and privacy in smartphones and mobile devices · doi:10.1145/2046614.2046619 · Cited by 910
Limits of Static Analysis for Malware Detection
Moser, A., Kruegel, C., & Kirda, E. (2007) · Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007) · doi:10.1109/acsac.2007.21 · Cited by 813
Automatic analysis of malware behavior using machine learning
Rieck, K., Trinius, P., Willems, C., & Holz, T. (2011) · Journal of Computer Security · doi:10.3233/jcs-2010-0410 · Cited by 729
A Survey on Malware Detection Using Data Mining Techniques
Ye, Y., Li, T., Adjeroh, D., & Iyengar, S. S. (2018) · ACM Computing Surveys · doi:10.1145/3073559 · Cited by 623
Malware Obfuscation Techniques: A Brief Survey
You, I., & Yim, K. (2010) · 2010 International Conference on Broadband, Wireless Computing, Communication and Applications · doi:10.1109/bwcca.2010.85 · Cited by 607
Learning and Classification of Malware Behavior
Rieck, K., Holz, T., Willems, C., Düssel, P., & Laskov, P. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70542-0_6 · Cited by 589
Learning to Detect and Classify Malicious Executables in the Wild
Kolter, J. Z., & Maloof, M. A. (2006) · doi:10.5555/1248547.1248646 · Cited by 562
Exploring Multiple Execution Paths for Malware Analysis
Moser, A., Kruegel, C., & Kirda, E. (2007) · 2007 IEEE Symposium on Security and Privacy (SP '07) · doi:10.1109/sp.2007.17 · Cited by 488
Learning to detect malicious executables in the wild
Kolter, J. Z., & Maloof, M. A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014105 · Cited by 475
A comparison of static, dynamic, and hybrid analysis for malware detection
Damodaran, A., Troia, F. D., Visaggio, C. A., Austin, T. H., & Stamp, M. (2017) · Journal of Computer Virology and Hacking Techniques · doi:10.1007/s11416-015-0261-z · Cited by 475
Opcode sequences as representation of executables for data-mining-based unknown malware detection
Santos, I., Brezo, F., Ugarte-Pedrero, X., & Bringas, P. G. (2013) · Information Sciences · doi:10.1016/j.ins.2011.08.020 · Cited by 442
Machine Learning for Android Malware Detection Using Permission and API Calls
Peiravian, N., & Zhu, X. (2013) · 2013 IEEE 25th International Conference on Tools with Artificial Intelligence · doi:10.1109/ictai.2013.53 · Cited by 379
Novel Feature Extraction, Selection and Fusion for Effective Malware Family Classification
Ahmadi, M., Ulyanov, D., Semenov, S., Trofimov, M., & Giacinto, G. (2016) · Proceedings of the Sixth ACM Conference on Data and Application Security and Privacy · doi:10.1145/2857705.2857713 · Cited by 359
A Machine Learning Approach to Android Malware Detection
Sahs, J., & Khan, L. (2012) · 2012 European Intelligence and Security Informatics Conference · doi:10.1109/eisic.2012.34 · Cited by 346
Anagram: A Content Anomaly Detector Resistant to Mimicry Attack
Wang, K., Parekh, J. J., & Stolfo, S. J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11856214_12 · Cited by 310
Opcodes as predictor for malware
Bilar, D. (2007) · International Journal of Electronic Security and Digital Forensics · doi:10.1504/ijesdf.2007.016865 · Cited by 302
Graph-based malware detection using dynamic analysis
Anderson, B., Quist, D., Neil, J., Storlie, C., & Lane, T. (2011) · Journal in Computer Virology · doi:10.1007/s11416-011-0152-x · Cited by 296
Dynamic Analysis of Malicious Code
Bayer, U., Moser, A., Kruegel, C., & Kirda, E. (2006) · Journal in Computer Virology · doi:10.1007/s11416-006-0012-2 · Cited by 295
Metadata
- Authors
- Christodorescu, M., & Jha, S.
- Publisher
- Defense Technical Information Center
- Published
- 2006-01-01
- OpenAlex
- W1544837488
- Cited by
- 600
- References
- 31
- Type
- report
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.