The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Renovo: a hidden code extractor for packed executables
Abstract
As reverse engineering becomes a prevalent technique to analyze malware, malware writers leverage various anti-reverse engineering techniques to hide their code. One technique commonly used is code packing as packed executables hinder code analysis. While this problem has been previously researched, the existing solutions are either unable to handle novel samples, or vulnerable to various evasion techniques. In this paper, we propose a fully dynamic approach that captures an intrinsic nature of hidden code execution that the original code should be present in memory and executed at some point at run-time. Thus, this approach monitors program execution and memory writes at run-time, determines if the code under execution is newly generated, and then extracts the hidden code of the executable. To demonstrate its effectiveness, we implement a system, Renovo, and evaluate it with a large number of real-world malware samples. The experiments show that Renovo is accurate compared to previous work, yet practical in terms of performance
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Proceedings of the 11th USENIX Security Symposium
Boneh, D. (2002) · Cited by 2,528
Obfuscation 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
Address obfuscation: an efficient approach to combat a board range of memory error exploits
Bhatkar, S., DuVarney, D. C., & Sekar, R. (2003) · USENIX Security Symposium · Cited by 509
PolyUnpack: Automating the Hidden-Code Extraction of Unpack-Executing Malware
Royal, P., Halpin, M., Dagon, D., Edmonds, R., & Lee, W. (2006) · 2006 22nd Annual Computer Security Applications Conference (ACSAC'06) · doi:10.1109/acsac.2006.38 · Cited by 293
Static disassembly of obfuscated binaries
Kruegel, C., Robertson, W., Valeur, F., & Vigna, G. (2004) · Cited by 279
Scalability, fidelity, and containment in the potemkin virtual honeyfarm
Vrable, M., Ma, J. H., Chen, J., Moore, D., Vandekieft, E., Snoeren, A. C., Voelker, G. M., & Savage, S. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095825 · Cited by 269
Scalability, fidelity, and containment in the potemkin virtual honeyfarm
Vrable, M., Ma, J. H., Chen, J., Moore, D., Vandekieft, E., Snoeren, A. C., Voelker, G. M., & Savage, S. (2005) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/1095810.1095825 · Cited by 144
Cited by
A survey on automated dynamic malware-analysis techniques and tools
Egele, M., Scholte, T., Kirda, E., & Kruegel, C. (2012) · ACM Computing Surveys · doi:10.1145/2089125.2089126 · Cited by 871
BitBlaze: A New Approach to Computer Security via Binary Analysis
Song, D., Brumley, D., Yin, H., Caballero, J., Jager, I., Kang, M. G., Liang, Z., Newsome, J., Poosankam, P., & Saxena, P. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89862-7_1 · Cited by 718
Self-citationA 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
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
Metadata
- Authors
- Kang, M. G., Poosankam, P., & Yin, H.
- Venue
- Proceedings of the 2007 ACM workshop on Recurring malcode
- Publisher
- ACM
- Published
- 2007-11-02
- Pages
- 46-53
- OpenAlex
- W2159702664
- Cited by
- 272
- References
- 7
- FWCI
- 17.81
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Renovo: a hidden code extractor for packed executables. https://app.cochat.ai/papers/10.1145/1314389.1314399
- The paper
- Kang, M. G., Poosankam, P., & Yin, H. (2007). Renovo: a hidden code extractor for packed executables. Proceedings of the 2007 ACM workshop on Recurring malcode. https://doi.org/10.1145/1314389.1314399
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.