The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Manufacturing cheap, resilient, and stealthy opaque constructs
Abstract
It has become common to distribute software in forms that are isomorphic to the original source code. An important example is Java bytecode. Since such codes are easy to decompile, they increase the risk of malicious reverse engineering attacks.In this paper we describe the design of a Java code obfuscator, a tool which - through the application of code transformations - converts a Java program into an equivalent one that is more difficult to reverse engineer.We describe a number of transformations which obfuscate control-flow. Transformations are evaluated with respect to potency (To what degree is a human reader confused?), resilience (How well are automatic deobfuscation attacks resisted?), cost (How much time/space overhead is added?), and stealth (How well does obfuscated code blend in with the original code?).The resilience of many control-altering transformations rely on the resilience of opaque predicates. These are boolean valued expressions whose values are known to the obfuscator but difficult to determine for an automatic deobfuscator. We show how to construct resilient, cheap, and stealthy opaque predicates based on the intractability of certain static analysis problems such as alias analysis.
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
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,448
McCabe, T. J. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.233837 · Cited by 6,059
A metrics suite for object oriented design
Chidamber, S. R., & Kemerer, C. F. (1994) · IEEE Transactions on Software Engineering · doi:10.1109/32.295895 · Cited by 5,669
The Java Language Specification
Gosling, J., Joy, B., & Steele, G. L. (1996) · Cited by 3,924
A Taxonomy of Obfuscating Transformations
Collberg, C. S., Thomborson, C. D., & Low, D. (1997) · Cited by 852
Self-citationCompiler transformations for high-performance computing
Bacon, D. F., Graham, S. L., & Sharp, O. J. (1994) · ACM Computing Surveys · doi:10.1145/197405.197406 · Cited by 818
Software Structure Metrics Based on Information Flow
Henry, S., & Kafura, D. (1981) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1981.231113 · Cited by 782
Analysis of pointers and structures
Chase, D., Wegman, M., & Zadeck, F. K. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989429 · Cited by 433
Interprocedural may-alias analysis for pointers: beyond k -limiting
Deutsch, A. (1994) · Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation · doi:10.1145/178243.178263 · Cited by 328
Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C
Ghiya, R., & Hendren, L. J. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237724 · Cited by 287
Parallelizing programs with recursive data structures
Hendren, L. J., & Nicolau, A. (1990) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.80123 · Cited by 219
Decompilation of binary programs
Cifuentes, C., & Gough, K. J. (1995) · Software: Practice and Experience · doi:10.1002/spe.4380250706 · Cited by 194
A complexity measure based on nesting level
Harrison, W. A., & Magel, K. I. (1981) · ACM SIGPLAN Notices · doi:10.1145/947825.947829 · Cited by 151
Parallelism for free: efficient and optimal bitvector analyses for parallel programs
Knoop, J., Steffen, B., & Vollmer, J. (1996) · ACM Transactions on Programming Languages and Systems · doi:10.1145/229542.229545 · Cited by 107
Control flow, data flow and program complexity
Oviedo, E. I. (1984) · Cited by 100
Measurement of data structure complexity
Munson, J. C., & Kohshgoftaar, T. M. (1993) · Journal of Systems and Software · doi:10.1016/0164-1212(93)90065-6 · Cited by 44
Krakatoa: decompilation in java (dose bytecode reveal source?)
Proebsting, T. A., & Watterson, S. A. (1997) · USENIX Conference on Object-Oriented Technologies and Systems · Cited by 36
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
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
Self-citationObfuscation of executable code to improve resistance to static disassembly
Linn, C., & Debray, S. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948149 · Cited by 602
Static Analysis of Executables to Detect Malicious Patterns
Christodorescu, M., & Jha, S. (2006) · doi:10.21236/ada449067 · Cited by 600
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
Self-citation
Metadata
- Authors
- Collberg, C., Thomborson, C., & Low, D.
- Venue
- Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98
- Publisher
- ACM Press
- Published
- 1998
- Pages
- 184-196
- OpenAlex
- W2126851641
- Cited by
- 535
- References
- 17
- FWCI
- 5.72
- 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.