Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.

Semantics-Based Obfuscation-Resilient Binary Code Similarity Comparison with Applications to Software and Algorithm Plagiarism Detection

Luo, Lannan, Ming, Jiang, Wu, Dinghao, Liu, Peng, Zhu, Sencun · 2017 · IEEE Transactions on Software Engineering

Abstract

Existing code similarity comparison methods, whether source or binary code based, are mostly not resilient to obfuscations. Identifying similar or identical code fragments among programs is very important in some applications. For example, one application is to detect illegal code reuse. In the code theft cases, emerging obfuscation techniques have made automated detection increasingly difficult. Another application is to identify cryptographic algorithms which are widely employed by modern malware to circumvent detection, hide network communications, and protect payloads among other purposes. Due to diverse coding styles and high programming flexibility, different implementation of the same algorithm may appear very distinct, causing automatic detection to be very hard, let alone code obfuscations are sometimes applied. In this paper, we propose a binary-oriented, obfuscation-resilient binary code similarity comparison method based on a new concept, longest common subsequence of semantically equivalent basic blocks , which combines rigorous program semantics with longest common subsequence based fuzzy matching. We model the semantics of a basic block by a set of symbolic formulas representing the input-output relations of the block. This way, the semantic equivalence (and similarity) of two blocks can be checked by a theorem prover. We then model the semantic similarity of two paths using the longest common subsequence with basic blocks as elements. This novel combination has resulted in strong resiliency to code obfuscation. We have developed a prototype. The experimental results show that our method can be applied to software plagiarism and algorithm detection, and is effective and practical to analyze real-world software.

Overview

Integrity signals

Registry

Crossref · 10.1109/tse.2017.2655046

Cites

69 of 69 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 69 references

Research works printed but not linked: 4

  1. conway, 1972, Unpredictable iterations, Proc Number Theory Conf, 49
  2. crussell, 2013, Scalable semantics-based detection of similar Android applications, Proc 18th Eur Symp Res Comput Secur, 182
  3. desnos, 2011, Android: From reversing to decompilation, Black Hat Abu Dhabi United Arab Emirates
  4. lutz, 2008, Towards revealing attackers’ intent by automatically decrypting network traffic, Master’s thesis Institut für Technische Informatik und Kommunikationsnetze ETH Zürich Zürich Switzerland

Cited by

See all 144

Metadata

Authors
Luo, L., Ming, J., Wu, D., Liu, P., & Zhu, S.
Affiliations
  • Pennsylvania State University (US)
  • The University of Texas at Arlington (US)
Venue
IEEE Transactions on Software Engineering
Published
2017-12-01
Volume
43
Issue
12
Pages
1157-1177
ISSN
  • 0098-5589 (ISSN-L)
  • 1939-3520
OpenAlex
W2579698096
Cited by
144
References
69
Citations by year
2026: 12 · 2025: 25 · 2024: 19 · 2023: 19 · 2022: 17 · 2021: 15 · 2020: 12 · 2019: 13 · 2018: 8 · 2017: 4
FWCI
18.84
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Software Engineering (publishedVersion)
Funders
US National Science Foundation (CCF-1320605)
Topics
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
  • Physical Sciences › Computer Science › Hardware and Architecture › Security and Verification in Computing
  • Physical Sciences › Computer Science › Hardware and Architecture › Physical Unclonable Functions (PUFs) and Hardware Security
Keywords
code obfuscation, obfuscation resilience, software plagiarism detection, longest common subsequence, approximate string matching, theorem proving

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Semantics-Based Obfuscation-Resilient Binary Code Similarity Comparison with Applications to Software and Algorithm Plagiarism Detection. https://app.cochat.ai/papers/10.1109/tse.2017.2655046
The paper
Luo, L., Ming, J., Wu, D., Liu, P., & Zhu, S. (2017). Semantics-Based Obfuscation-Resilient Binary Code Similarity Comparison with Applications to Software and Algorithm Plagiarism Detection. IEEE Transactions on Software Engineering. https://doi.org/10.1109/tse.2017.2655046

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.