Behavior based software theft detection
The DOI matches its Crossref record; 28 of the 29 references it cites were found in a registry or an index.
Abstract
Along with the burst of open source projects, software theft (or plagiarism) has become a very serious threat to the healthiness of software industry. Software birthmark, which represents the unique characteristics of a program, can be used for software theft detection. We propose a system call dependence graph based software birthmark called SCDG birthmark, and examine how well it reflects unique behavioral characteristics of a program. To our knowledge, our detection system based on SCDG birthmark is the first one that is capable of detecting software component theft where only partial code is stolen. We demonstrate the strength of our birthmark against various evasion techniques, including those based on different compilers and different compiler optimization levels as well as two state-of-the-art obfuscation tools. Unlike the existing work that were evaluated through small or toy software, we also evaluate our birthmark on a set of large software. Our results show that SCDG birthmark is very practical and effective in detecting software theft that even adopts advanced evasion techniques.
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
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277 · cited 1×
“, Ullmann’s algorithm [30] and VF [14], are suitable with graphs of thousands of nodes.”
MethodValgrind: a framework for heavyweight dynamic binary instrumentation
Nethercote, N., & Seward, J. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250746 · Cited by 2,244
CCFinder: a multilinguistic token-based code clone detection system for large scale source code
Kamiya, T., Kusumoto, S., & Inoue, K. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2002.1019480 · Cited by 1,711 · cited 2×
“Existing techniques for clone detection can be classified as four categories: String-based [5], AST-based [7, 17], Tokenbased [15,24,25] and PDG-based [18,19].”
MethodClone detection using abstract syntax trees
Baxter, I. D., Yahin, A., Moura, L., Sant'Anna, M., & Bier, L. (2002) · Proceedings. International Conference on Software Maintenance (Cat. No. 98CB36272) · doi:10.1109/icsm.1998.738528 · Cited by 1,277 · cited 3×
“Existing techniques for clone detection can be classified as four categories: String-based [5], AST-based [7, 17], Tokenbased [15,24,25] and PDG-based [18,19].”
MethodSchleimer, S., S, W. D., & Aiken, A. (2003) · Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data · doi:10.1145/872757.872770 · Cited by 1,099 · cited 2×
“Existing techniques for clone detection can be classified as four categories: String-based [5], AST-based [7, 17], Tokenbased [15,24,25] and PDG-based [18,19].”
MethodA Taxonomy of Obfuscating Transformations
Collberg, C. S., Thomborson, C. D., & Low, D. (1997) · ResearchSpace (University of Auckland) · Cited by 1,090
On finding duplication and near-duplication in large software systems
Baker, B. S. (2002) · Proceedings of 2nd Working Conference on Reverse Engineering · doi:10.1109/wcre.1995.514697 · Cited by 717 · cited 3×
“String-based schemes are fragile even by simply renaming identi.ers in programs.”
MethodIdentifying similar code with program dependence graphs
Krinke, J. (2002) · Proceedings Eighth Working Conference on Reverse Engineering · doi:10.1109/wcre.2001.957835 · Cited by 616 · cited 4×
“Because PDGs contain semantic information of programs, PDG-based schemes are more robust than the other three types of existing schemes.”
MethodInfluentialGPLAG: detection of software plagiarism by program dependence graph analysis
Liu, C., Chen, C., Han, J., & Yu, P. S. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150522 · Cited by 422 · cited 6×
“Existing techniques for clone detection can be classi.ed as four categories: String-based[5],AST-based[7,17],Tokenbased[15,24,25] andPDG-based[18,19].”
BackgroundMethodInfluentialLinear time algorithm for isomorphism of planar graphs (Preliminary Report)
Hopcroft, J. E., & Wong, J. K. (1974) · Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74 · doi:10.1145/800119.803896 · Cited by 344
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 · cited 1×
“Our results show that SCDG birthmark is very practical and e.ective in detecting software theft that even adopts advanced evasion techniques.”
ResultMining specifications of malicious behavior
Christodorescu, M., Jha, S., & Kruegel, C. (2007) · Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering · doi:10.1145/1287624.1287628 · Cited by 281
Behavior-based spyware detection
Kirda, E., Kruegel, C., Banks, G., Vigna, G., & Kemmerer, R. A. (2006) · Cited by 237
Performance evaluation of the VF graph matching algorithm
Cordella, L. P., Foggia, P., Sansone, C., & Vento, M. (2003) · Proceedings 10th International Conference on Image Analysis and Processing · doi:10.1109/iciap.1999.797762 · Cited by 226
Linear time algorithm for isomorphism of planar graphs.
Hopcroft, J. E., & Wong, J. K. (1974) · Cited by 224
Group-Theoretic Algorithms and Graph Isomorphism
(1982) · Lecture Notes in Computer Science · doi:10.1007/3-540-11493-9 · Cited by 196 · cited 1×
“putationally intractable in a few cases [12,13].”
K-gram based software birthmarks
Myles, G., & Collberg, C. (2005) · Proceedings of the 2005 ACM symposium on Applied computing · doi:10.1145/1066677.1066753 · Cited by 187 · cited 1×
“As one example, in 2005 it wasdeterminedin afederal courttrial thatIBM shouldpay an independent software vendor Compuware $140 million to license its software and $260 million to purchase its services[1]becauseit wasdiscovered that certainIBMproducts contained code from Compuware.”
MethodMining specifications of malicious behavior
Christodorescu, M., Jha, S., & Kruegel, C. (2008) · India Software Engineering Conference · doi:10.1145/1342211.1342215 · Cited by 162 · cited 1×
“Though some initial research has been done on software birthmarks, existing schemes are still limited to meet the following .ve highly desired requirements: (R1) Resiliency to semantics-preserving obfuscation techniques [11]; (R2) Capability to detect theft of components, which may be only a…”
BackgroundDynamic path-based software watermarking
Collberg, C. S., Carter, E., Debray, S., Huntwork, A., Kececioglu, J. D., Linn, C., & Stepp, M. (2004) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/996841.996856 · Cited by 152 · cited 1×
“INTRODUCTION Software theft is an act of reusing someone else s code, in whole or in part, into one s own program in a way violating the terms of original license.”
BackgroundDetecting Software Theft via Whole Program Path Birthmarks
Myles, G., & Collberg, C. S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30144-8_34 · Cited by 144
Design and evaluation of birthmarks for detecting theft of Java programs
Tamada, H., Nakamura, M., & Monden, A. (2004) · Cited by 129
Schuler, D., Dallmeier, V., & Lindig, C. (2007) · Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering · doi:10.1145/1321631.1321672 · Cited by 108 · cited 1×
“To protect software from theft, Collberg and Thoborson [10]proposed software watermark techniques.”
MethodDynamic Software Birthmarks to Detect the Theft of Windows Applications
Tamada, H., Okamoto, K., Nakamura, M., Monden, A., & Matsumoto, K. (2004) · Cited by 107
Dynamic slicing long running programs through execution fast forwarding
Zhang, X., Tallam, S., & Gupta, R. (2006) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/1181775.1181786 · Cited by 77
Finding Plagiarisms among a Set of Programs with JPlag
Malpohl, G., Prechelt, L., & Philippsen, M. (2002) · Verlag der Technischen Universität Graz · doi:10.3217/jucs-008-11-1016 · Cited by 56 · cited 1×
“Existing techniques for clone detection can be classified as four categories: String-based [5], AST-based [7,17], Tokenbased [15, 24 ,25] and PDG-based [18,19].”
MethodLOCO: an interactive code (De)obfuscation tool
Madou, M., Van Put, L., & De Bosschere, K. (2006) · Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation · doi:10.1145/1111542.1111566 · Cited by 43 · cited 1×
“For binary code obfucation, we used control flow flattening implemented in Loco based on Diablo link-time optimizer [20].”
MethodBaker, H. G. (1994) · ACM SIGPLAN Notices · doi:10.1145/185009.185016 · Cited by 32
Design and evaluation of dynamic software birthmarks based on API calls
Tamada, H., Okamoto, K., Nakamura, M., Monden, A., & Matsumoto, K. (2007) · Institutional Repositories DataBase (IRDB) · Cited by 31
Research works printed but not linked: 5
- 10.5555/832303.836911 · doi:10.5555/832303.836911
- 10.5555/850947.853341 · doi:10.5555/850947.853341
- 10.5555/1267336.1267355 · doi:10.5555/1267336.1267355
- K. Kontogiannis , M. Galler , and R. DeMori . Detecting code similarity using patterns . In Working Notes of 3rd Workshop on AI and Software Engineering , 1995 . K. Kontogiannis, M. Galler, and R. DeMori. Detecting code similarity using patterns. In Working Notes of 3rd Workshop on AI and Software Engineering, 1995.
- 10.5555/832308.837142 · doi:10.5555/832308.837142
Cited by
Achieving accuracy and scalability simultaneously in detecting application clones on Android markets
Chen, K., Liu, P., & Zhang, Y. (2014) · Proceedings of the 36th International Conference on Software Engineering · doi:10.1145/2568225.2568286 · Cited by 287
“Dynamic birthmarks are usually as follows: whole program path [33] birthmark, sequence of API function calls/frequency of API function calls birthmark [46, 45], call sequences to Java standard API [41], system calls birthmark [48] and invariant value sequences birthmark [19].”
BackgroundSelf-citationHigh Accuracy Attack Provenance via Binary-based Execution Partition.
Lee, K. H., Zhang, X., & Xu, D. (2013) · Network and Distributed System Security Symposium · Cited by 234
Luo, L., Ming, J., Wu, D., Liu, P., & Zhu, S. (2014) · Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering · doi:10.1145/2635868.2635900 · Cited by 220
“In this paper, we propose a binary-oriented, obfuscation-resilient method named CoP .”
MethodSelf-citationWuKong: a scalable and accurate two-phase approach to Android app clone detection
Wang, H., Guo, Y., Ma, Z., & Chen, X. (2015) · Proceedings of the 2015 International Symposium on Software Testing and Analysis · doi:10.1145/2771783.2771795 · Cited by 195
“Dynamic software birthmarks include dynamic API based birthmarks [53, 52, 49], whole program path birthmark [46], system call based birthmark [56, 57] and core value based birthmark [30].”
MethodNeural Machine Translation Inspired Binary Code Similarity Comparison beyond Function Pairs
Zuo, F., Li, X., Young, P., Luo, L., Zeng, Q., & Zhang, Z. (2019) · Proceedings 2019 Network and Distributed System Security Symposium · doi:10.14722/ndss.2019.23492 · Cited by 175
“A variant of Problem II is well studied under the context of a single architecture [32], [29], [2], [59], [67], [28], [52], [51], [20], [37], [56], [53], [60], [27]; but they can only handle code of the same architecture.”
BackgroundMethodInfluential
Metadata
- Authors
- Wang, X., Jhi, Y.-C., Zhu, S., & Liu, P.
- Affiliations
- Pennsylvania State University (US)
- Venue
- Proceedings of the 16th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2009-11-09
- Pages
- 280-290
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2084201645
- Cited by
- 101
- References
- 29
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 1 · 2023: 5 · 2022: 5 · 2021: 1 · 2020: 3 · 2019: 12 · 2018: 7 · 2017: 8 · 2016: 6 · 2015: 12 · 2014: 11 · 2013: 9 · 2012: 10
- FWCI
- 4.47
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM SIGSAC Conference on Computer and Communications Security (CCS) (publishedVersion)
- Funders
- Multidisciplinary University Research Initiative
- Air Force Office of Scientific Research
- Topics
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Physical Sciences › Computer Science › Hardware and Architecture › Physical Unclonable Functions (PUFs) and Hardware Security
- Physical Sciences › Computer Science › Hardware and Architecture › Security and Verification in Computing
- Keywords
- software plagiarism, software birthmarks, code obfuscation, avoidance strategies, compiler optimization, open source software
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.