| C. Collberg, C. Thomborson, and D. Low, "A Taxonomy of Obfuscating Transformations," Technical Report 148, Department of Computer Science, University of Auckland, 1997. |
....as described in App. B. If cryptographically preventing disassembly is not possible, we can resort to periodic obfuscation to make understanding the disassembled code and isolating the checksum code as difficult as possible. Periodic obfuscation extends the idea of static obfuscation [30] by periodically obfuscating code in time. For example, we can randomly vary the checksum formula and its location within the bytecode from work packet to work packet. This would prevent hackers from manually disassembling and modifying the bytecode once and for all. We can also insert dummy code ....
....the agents behavior. In the context of this thesis, such techniques would also be helpful in preventing computational sabotage, as described in Sects. 2.3.3 and 6.2. In this paper, we discuss three main techniques encrypted computation (also called mobile cryptography) 127] obfuscation [30], and time limited blackbox security [71] We present an overview and a critique of each technique, and conclude with some suggestions on possible directions for future research. B.1 Motivation With the growing popularity of Java and other mobile code systems that allow executable code to be ....
[Article contains additional citation context not shown here]
C. Collberg, C. Thomborson, and D. Low. A Taxonomy of Obfuscating Transformations. Technical Report 161. Department of Computer Science, The University of Auckland, New Zealand, July 1997.
....order to do a fast good job. Up to now the easiness of the decompilation is an unavoidable side e#ect of the security of the JVM. 63 Intuitively, the obfuscation of the code is aimed at modifying the compiled code in order to make it non understandable. The first formal definition was given in [CTL97, CTL98b] to reverse engineer with the same observable behavior. If P fails to terminate or terminates with an error, then P # may or may not terminate. Otherwise, P # must terminate and produce the same output as P . To be complete, we need to define what harder to reverse engineer and same ....
....will crash or produce a non correct decompiled code, the reverse engineer will have to look to the compiled code itself which is a really di#cult task on big programs. We present here a short description of the useful obfuscation techniques. A more complete and detailed list could be found in [CTL97] Obfuscation techniques can be divided into four categories. Layout obfuscation consists in changing or removing information in the bytecode that does not modify the executable part of the code. Usually debugging information and comments remain embedded within the code and these data are free ....
[Article contains additional citation context not shown here]
C. Collberg, C. Thomborson, and D. Low. A Taxonomy of Obfuscating Transformations. Technical Report 148, Department of Computer Science. The University of Auckland, July 1997. 64, 65, 68
....attempts to thwart reverse engineering by making it hard to understand the behavior of a program through static or dynamic analysis. Obfuscation techniques tend to be ad hoc, based on ideas about human behavior or methods aimed to derail automated static or dynamic analysis. Collberg, et al. [CTL97,CTL98a,CTL98b] presented classes of transformations to a binary that attempt to confuse static analysis of the control flow graph of a program. Wang, et al. Wan01,WDHK01,WHKD00] also proposed transformations to make it hard to determine the control flow graph of a program by obscuring the destination of ....
C. Collberg, C. Thomborson, and D. Low. A taxonomy of obfuscating transformations. Technical Report 148, University of Auckland, 1997.
.... (IL) which is a typed representation used by the backends of compilers for many di#erent programming languages [15, 22] IL is quite close to some high level languages, in particular to C# [2, 17] and because of the ease by which one can convert from IL to C#, obfuscation of IL is important [8]. Our main examples are therefore drawn from the literature on obfuscation, but we also consider a few standard compiler optimisations. The structure of this paper is as follows. First we provide a brief introduction to IL, and a variant of IL that is useful when applying program transformations ....
....source code that results from decompilation di#cult to understand might be an acceptable alternative. In this section, we show how path logic programming can be used to give formal, executable specifications to two representative examples from Collberg s taxonomy of obfuscating transformations [8]: variable transformation and array splitting. 6.1 Variable Transformations The idea of variable transformation is to pick a variable i which is local to a method and to replace all occurrences of i in that method with a new variable j , which is related to i . For this, we need a function f ....
Collberg, C., Thomborson, C., and Low, D. A taxonomy of obfuscating transformations. Tech. Rep. 148, Department of Computer Science, University of
No context found.
C. Collberg, C. Thomborson, and D. Low. A taxonomy of obfuscating transformations. Technical Report 148, Department of Computer Science, University of Auckland, July 1997.
No context found.
Christian Collberg, Clark Thomborson, and Douglas Low. A taxonomy of obfuscating transformations. Technical Report 148, Department of Computer Science, University of Auckland, July 1997. www.cs. auckland.ac.nz/~collberg/Research/Publications/CollbergThomborso%nLow97a.
No context found.
Christian Collberg, Clark Thomborson, and Douglas Low. A taxonomy of obfuscating transformations. Technical Report 148, Department of Computer Science, University of Auckland, July 1997. http: //www.cs.auckland.ac.nz/~collberg/Research/Publications/CollbergThomborsonLow97a.
No context found.
Christian Collberg, Clark Thomborson, and Douglas Low. A taxonomy of obfuscating transformations. Technical Report 148, Department of Computer Science, University of Auckland, July 1997. http://citeseer.nj. nec.com/collberg97taxonomy.html.
No context found.
Christian Collberg, Clark Thomborson, and Douglas Low. A taxonomy of obfuscating transformations. Technical Report 148, Department of Computer Science, University of Auckland, July 1997.
No context found.
C. Collberg, C. Thomborson, and D. Low, "A Taxonomy of Obfuscating Transformations," Technical Report 148, Department of Computer Science, University of Auckland, 1997.
No context found.
C. Collberg, C. Thomborson, and D. Low. A Taxonomy of Obfuscating Transformations. Technical Report 148, Department of Computer Science, University of Auckland, July 1997.
No context found.
C. Collberg, C. Thomborson, and D. Low. A taxonomy of obfuscating transformations. Technical Report 148, Dept. of Computer Science, Univ. of Auckland, 1997.
No context found.
C. Collberg, C. Thomborson, and D. Low. A taxonomy of obfuscating transformations. Technical Report 148, The University of Auckland, New Zealand, 1997.
No context found.
C. Collberg, C. Thomborson, D. Low, "A Taxonomy of Obfuscating Transformations", Tech. Rep. 148, Dept. Computer Science, Univ. of Auckland (July 1997).
No context found.
C.Collberg, C.Thomborson, and D.Low, "A taxonomy of obfuscating transformations," Technical Report of Deptartment of Computer Science 148, University of Auckland, New Zealand, 1997.
No context found.
C. Collberg, C. Thomborson, D. Low, "A Taxonomy of Obfuscating Transformations", Tech. Rep. 148, Dept. Computer Science, Univ. of Auckland (July 1997).
No context found.
C. Collberg, C. Thomborson, D. Low, "A Taxonomy of Obfuscating Transformations", Tech. Rep. 148, Dept. Computer Science, Univ. of Auckland (July 1997).
No context found.
C. Collberg, C. Thomborson, D. Low, \A Taxonomy of Obfuscating Transformations ", Technical Report 148, Dept. Computer Science, University of Auckland (July 1997).
No context found.
C. Collberg, C. Thomborson, D. Low, \A Taxonomy of Obfuscating Transformations ", Technical Report 148, Dept. Computer Science, University of Auckland (July 1997).
No context found.
C. Collberg, C. Thomborson, and D. Low. A taxonomy of obfuscating transformations. Technical Report Technical Report 148, Department of Computer Science, University of Auckland, 1997.
No context found.
C. Collberg, C. Thomborson, and D. Low. A Taxonomy of Obfuscating Transformations. Technical report, TR--148, Department of Computer Science, University of Auckland, New Zealand, July 1997.
No context found.
C. Collberg, C. Thomborson, and D. Low. A taxonomy of obfuscating transformations. Technical Report 148, Department of Computer Sciences, The University of Auckland, July 1997.
No context found.
C. Collberg, C. Thomborson, and D. Low. A taxonomy of obfuscating transformations. Technical Report 148, Department of Computer Science, University of Auckland, New Zealand, July 1997.
No context found.
C. Collberg, C. Thomborson, and D. Low. A taxonomy of obfuscating transformations. Technical Report 148, University of Auckland, July 1997. 3.6.2
No context found.
C. Collberg, C. Thomborson, and D. Low. A taxonomy of obfuscating transformations. Technical Report 148, University of Auckland, 1997.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC