Obfuscation of executable code to improve resistance to static disassembly
The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
A great deal of software is distributed in the form of executable code. The ability to reverse engineer such executables can create opportunities for theft of intellectual property via software piracy, as well as security breaches by allowing attackers to discover vulnerabilities in an application. The process of reverse engineering an executable program typically begins with disassembly, which translates machine code to assembly code. This is then followed by various decompilation steps that aim to recover higher-level abstractions from the assembly code. Most of the work to date on code obfuscation has focused on disrupting or confusing the decompilation phase. This paper, by contrast, focuses on the initial disassembly phase. Our goal is to disrupt the static disassembly process so as to make programs harder to disassemble correctly. We describe two widely used static disassembly algorithms, and discuss techniques to thwart each of them. Experimental results indicate that significant portions of executables that have been obfuscated using our techniques are disassembled incorrectly, thereby showing the efficacy of our methods.
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
Handbook of theoretical computer science
Leeuwen, J. V. (1990) · Medical Entomology and Zoology · Cited by 4,259
Storing a Sparse Table with 0 (1) Worst Case Access Time
Fredman, M. L., Komlós, J., & Szemerédi, E. (1984) · Journal of the ACM · doi:10.1145/828.1884 · Cited by 748
Watermarking, tamper-proofing, and obfuscation - tools for software protection
Collberg, C. S., & Thomborson, C. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2002.1027797 · Cited by 735
Architectural support for copy and tamper resistant software
Thekkath, D. L. C., Mitchell, M., Lincoln, P., Boneh, D., Mitchell, J., & Horowitz, M. (2000) · ACM SIGARCH Computer Architecture News · doi:10.1145/378995.379237 · Cited by 597
Manufacturing cheap, resilient, and stealthy opaque constructs
Collberg, C., Thomborson, C., & Low, D. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268962 · Cited by 535
Software watermarking: models and dynamic embeddings
Collberg, C., & Thomborson, C. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292569 · Cited by 342
Operating system protection through program evolution
Cohen, F. B. (1993) · Computers & Security · doi:10.1016/0167-4048(93)90054-9 · Cited by 290
Tamper resistant software: an implementation
Aucsmith, D. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61996-8_49 · Cited by 285
Vlahakos, D., Foster, M. H., Ucci, A. A., Barrett, K. J., Datta, S. K., & Madaio, M. P. (1992) · Journal of the American Society of Nephrology · doi:10.1681/asn.v281345 · Cited by 241
Mehlhorn, K., & Tsakalidis, A. (1991) · Cited by 209
Cited by
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
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
SQLrand: Preventing SQL Injection Attacks
Boyd, S. W., & Keromytis, A. D. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24852-1_21 · Cited by 429
SoK: Automated Software Diversity
Larsen, P., Homescu, A., Brunthaler, S., & Franz, M. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.25 · Cited by 321
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
Renovo: a hidden code extractor for packed executables
Kang, M. G., Poosankam, P., & Yin, H. (2007) · Proceedings of the 2007 ACM workshop on Recurring malcode · doi:10.1145/1314389.1314399 · Cited by 272
Detecting unknown malicious code by applying classification techniques on OpCode patterns
Shabtai, A., Moskovitch, R., Feher, C., Dolev, S., & Elovici, Y. (2012) · Security Informatics · doi:10.1186/2190-8532-1-1 · Cited by 266
BinHunt: Automatically Finding Semantic Differences in Binary Programs
Gao, D., Reiter, M. K., & Song, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88625-9_16 · Cited by 255
Luo, L., Ming, J., Wu, D., Liu, P., & Zhu, S. (2017) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2017.2655046 · Cited by 144
Android Root and its Providers: A Double-Edged Sword
Zhang, H., She, D., & Qian, Z. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813714 · Cited by 64
Program Characterization Using Runtime Values and Its Application to Software Plagiarism Detection
Jhi, Y.-C., Jia, X., Wang, X., Zhu, S., Liu, P., & Wu, D. (2015) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2015.2418777 · Cited by 35
“Linn and Debray [52] proposed”
Metadata
- Authors
- Linn, C., & Debray, S.
- Venue
- Proceedings of the 10th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2003-10-27
- Pages
- 290-299
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2166462894
- Cited by
- 602
- References
- 15
- FWCI
- 16.69
- Type
- conference paper
- 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.