| Manufacturing opaque predicates in distributed systems for code obfuscation |
| Full text |
Pdf
(332 KB)
|
| Source
|
ACM International Conference Proceeding Series; Vol. 171
archive
Proceedings of the 29th Australasian Computer Science Conference - Volume 48
table of contents
Hobart, Australia
Pages: 187 - 196
Year of Publication: 2006
ISBN ~ ISSN:1445-1336 , 1-920682-30-9
|
|
Authors
|
|
Anirban Majumdar
|
Secure Systems Group, Department of Computer Science, The University of Auckland, Auckland, New Zealand
|
|
Clark Thomborson
|
Secure Systems Group, Department of Computer Science, The University of Auckland, Auckland, New Zealand
|
|
| Publisher |
Australian Computer Society, Inc.
Darlinghurst, Australia, Australia
|
| Bibliometrics |
Downloads (6 Weeks): 6, Downloads (12 Months): 51, Citation Count: 0
|
|
|
ABSTRACT
Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfuscation is to make the logic embedded in code incomprehensible to automated program analysis tools used by adversaries. Opaque predicates act as tool for obfuscating control flow logic embedded within code. In this position paper, we address the problem of control-flow code obfuscation of processes executing in distributed computing environments by proposing a novel method of combining the open problems of distributed global state detection with a well-known hard combinatorial problem to manufacture opaque predicates. We name this class of new opaque predicates as distributed opaque predicates. We demonstrate our approach with an illustration and provide an extensive security analysis of code obfuscated with distributed opaque predicates. We show that our class of opaque predicates is capable of withstanding most known forms of automated static analysis attacks and a restricted class of dynamic analysis attack that could be mounted by adversaries.
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
|
Boaz Barak , Oded Goldreich , Russell Impagliazzo , Steven Rudich , Amit Sahai , Salil P. Vadhan , Ke Yang, On the (Im)possibility of Obfuscating Programs, Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, p.1-18, August 19-23, 2001
|
| |
2
|
|
| |
3
|
|
| |
4
|
Clark Thomborson , Jasvir Nagra , Ram Somaraju , Charles He, Tamper-proofing software watermarks, Proceedings of the second workshop on Australasian information security, Data Mining and Web Intelligence, and Software Internationalisation, p.27-36, January 01, 2004, Dunedin, New Zealand
|
| |
5
|
SETI@home (2005), http://setiathome.ssl.berkeley.edu/ (accessed July 15 2005).
|
| |
6
|
J. Palsberg , S. Krishnaswamy , Minseok Kwon , D. Ma , Qiuyun Shao , Y. Zhang, Experience with software watermarking, Proceedings of the 16th Annual Computer Security Applications Conference, p.308, December 11-15, 2000
|
| |
7
|
Nagra, J. & Thomborson, C. (2004), Threading Software Watermarks. In the proceedings of 6th International Workshop on Information Hiding, LNCS Volume 3200, Springer-Verlag. Toronto, ON, Canada.
|
| |
8
|
|
 |
9
|
Christian Collberg , Clark Thomborson , Douglas Low, Manufacturing cheap, resilient, and stealthy opaque constructs, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.184-196, January 19-21, 1998, San Diego, California, United States
[doi> 10.1145/268946.268962]
|
 |
10
|
|
| |
11
|
|
| |
12
|
Mattern, F. (1989), Virtual time and global states of distributed systems. In the proceedings of Workshop on Parallel and Distributed Algorithms, Elsevier Science Publication, pages 215-226.
|
 |
13
|
|
 |
14
|
|
 |
15
|
|
 |
16
|
|
 |
17
|
John Whaley , Martin Rinard, Compositional pointer and escape analysis for Java programs, Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, p.187-206, November 01-05, 1999, Denver, Colorado, United States
|
 |
18
|
|
 |
19
|
|
| |
20
|
|
|