ACM Home Page
Please provide us with feedback. Feedback
Program obfuscation: a quantitative approach
Full text PdfPdf (213 KB)
Source
Conference on Computer and Communications Security archive
Proceedings of the 2007 ACM workshop on Quality of protection table of contents
Alexandria, Virginia, USA
SESSION: Software security table of contents
Pages: 15 - 20  
Year of Publication: 2007
ISBN:978-1-59593-885-5
Authors
Bertrand Anckaert  Ghent University, Ghent, Belgium
Matias Madou  Ghent University, Ghent, Belgium
Bjorn De Sutter  Ghent University, Ghent, Belgium
Bruno De Bus  Ghent University, Ghent, Belgium
Koen De Bosschere  Ghent University, Ghent, Belgium
Bart Preneel  Katholieke Universiteit Leuven, Leuven, Belgium
Sponsors
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 114,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1314257.1314263
What is a DOI?

ABSTRACT

Despite the recent advances in the theory underlying obfuscation, there still is a need to evaluate the quality of practical obfuscating transformations more quickly and easily. This paper presents the first steps toward a comprehensive evaluation suite consisting of a number of deobfuscating transformations and complexity metrics that can be readily applied on existing and future transformations in the domain of binary obfuscation. In particular, a framework based on software complexity metrics measuring four program properties: code, control flow, data and data flow is suggested. A number of well-known obfuscating and deobfuscating transformations are evaluated based upon their impact on a set of complexity metrics. This enables us to quantitatively evaluate the potency of the (de)obfuscating transformations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. Appel. Deobfuscation is in np, August 2002.
 
2
G. Arboit. A method for watermarking java programs via opaque predicates. In The Fifth International Conference on Electronic Commerce Research (ICECR-5), 2002.
 
3
 
4
G. Balakrishnan and T. Reps. Analyzing memory accesses in x86 executables. In Proc. Int. Conf. on Compiler Construction, pages 5--23, 2004.
 
5
 
6
P. Biondi and F. Desclaux. Silver needle in the skype. In BlackHat Europe, 2006.
7
 
8
 
9
Cloakware Corp: S. Chow, H. Johnson, and Y. Gu. Tamper Resistant Software - Control Flow Encoding, Patent US 6,779,114, Filed 1999, Granted 2004.
 
10
11
 
12
C. Collberg, C. Thomborson, and D. Low. A taxonomy of obfuscating transformations. Technical Report 148, University of Auckland, 1997.
13
 
14
C. Cook. Information theory metric for assembly language. Software Engineering Strategies, pages 52--60, 1993.
 
15
M. Dalla Preda, M. Madou, K. De Bosschere, and R. Giacobazzi. Opaque predicates detection by abstract interpretation. Algebraic Methodology and Software Technology, LNCS 4019:81--95, 2006.
 
16
 
17
 
18
19
 
20
K. Heffner and C. Collberg. The obfuscation executive. Information Security Conference (ISC04), 2004.
 
21
 
22
23
 
24
B. Lynn, M. Prabhakaran, and A. Sahai. Positive results and techniques for obfuscation. In EUROCRYPT, 2004.
25
 
26
J. Maebe, M. Ronsse, and K. De Bosschere. DIOTA: Dynamic Instrumentation, Optimization and Transformation of Applications. In Proc. Int. Conf. on Parallel Architectures and Compilation Techniques (PACT), september 2002.
 
27
 
28
 
29
G. Myles and C. Collberg. Software watermarking via opaque predicates: Implementation, analysis, and attacks, 2004.
 
30
N. Naeem, M. Batchelder, and L. Hendren. Metrics for measuring the effectiveness of decompilers and obfuscators. Technical Report 2006-4, McGill University, School of Computer Science: Sable Research Group, June 2006.
 
31
P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. LNCS, 1592:223--238, 1999.
 
32
 
33
 
34
 
35
 
36
 
37
 
38


Collaborative Colleagues:
Bertrand Anckaert: colleagues
Matias Madou: colleagues
Bjorn De Sutter: colleagues
Bruno De Bus: colleagues
Koen De Bosschere: colleagues
Bart Preneel: colleagues