S. Chow, Y. Gu, H. Johnson, and V. Zakharov. An approach to the obfuscation of control-flow of sequential computer programs. In G. Davida and Y. Frankel, editors, Information Security, ISC 2001.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....variants that are more di#cult to understand or analyze [10, 11] Obfuscation can be shown to be theoretically impossible [7] given enough computational power and memory. This has not deterred attempts to construct obfuscators that have embedded instances of hard problems. For example, [8] shows that an instance of a PSPACE hard problem may be embedded in the control flow of the obfuscated program. As another example, 17] introduce additional variable aliases by indirect addressing, making control flow di#cult to determine. This latter work uses the fact that alias detection is an ....

....latter work uses the fact that alias detection is an NP hard problem. We, too, have explored making the control flow of a program harder to analyze. A resourceful attacker can be expected to attempt to automatically decompile the target code, and to perform other automated analyses. As noted in [8], such automatic analysis can statically obtain global information about the structure of the program, enabling reverse engineering. Thus, our hope is to defend against this attack by obfuscating the control flow (or data flow) of the original program. This can be done by adding extra edges to ....

S. Chow, Y. Gu, H. Johnson, and V. Zakharov. An approach to the obfuscation of control-flow of sequential computer programs. In Proceedings of ISC, 2001. Published in Springer-Verlag LNCS 2200.

....are no other conditional jumps in the rest of the code. Each time a conditional jump must be made, the control flow must go through the dispatcher. All loops are therefore destroyed as only one big loop remains. Combined with various other techniques, this has been implemented in [WHKD00, NCJ01, CGJZ01] 2.4. Preventive transformation Here the target is clearly the decompiler deobfuscator and not the reverse engineer. Two kinds of transformation are possible: Targeted. Explore weaknesses in current decompilers and deobfuscators. Inherent. Explore inherent problems with known ....

S. Chow, Y. Gu, H. Johnson, and V. Zakharov. An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs. In G. Davida and Y. Frankel, editors, Information Security -- ISC 2001, volume 2200 of Lectures Notes in Computer Science (LNCS), pages 144-- 155. Springer-Verlag, 2001. 68

....program NP hard. Theoretical work on encrypted computation is also related to obfuscation. For example, Sander and Tschudin [ST98] propose a theoretical obfuscation method that allows code to execute in an encrypted form for a limited class of computations. Other work on obfuscation appears in [CGJZ01,NCJ01]. Customization takes one copy of a program and creates many very di#erent versions. Distributing many di#erent versions of a program stops widespread damage from a security break since published patches to break one version of an executable might not apply to other customized versions. Aucsmith ....

S.T. Chow, Y. Gu, H.J. Johnson, and V.A. Zakharov. An approach to the obfuscation of control--flow of sequential computer programs. In G.I. Davida and Y. Frankel, editors, ISC 2001, Lecture Notes in Computer Science 2200, pages 144--155. Springer-Verlag, 2001.

No context found.

S. Chow, Y. Gu, H. Johnson, V.A. Zakharov, An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs, pp. 144-155, Proceedings of isc 2001 { Information Security, 4th International Conference (Malaga, Spain, 1-3 October 2001), lncs 2200, Springer-Verlag, 2001.

No context found.

S. Chow, Y. Gu, H. Johnson, V.A. Zakharov, An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs, pp.144-155, Proceedings of ISC 2001 { Information Security, 4th International Conference (Malaga, Spain, 1-3 October 2001), lncs 2200, Springer-Verlag, 2001.

No context found.

S. Chow, Y. Gu, H. Johnson, V.A. Zakharov, An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs, pp.144-155, Proceedings of ISC 2001 -- Information Security, 4th International Conference (Malaga, Spain, 1-3 October 2001), lncs 2200, Springer-Verlag, 2001.

No context found.

S. Chow, Y. Gu, H. Johnson, and V. Zakharov. An approach to the obfuscation of control-flow of sequential computer programs. In G. Davida and Y. Frankel, editors, Information Security, ISC 2001.

No context found.

S. Chow, Y. Gu, H. Johnson, and V. Zakharov. An approach to the obfuscation of control-flow of sequential computer programs. In G. Davida and Y. Frankel, editors, Information Security, ISC 2001.

No context found.

S. Chow, Y. Gu, H. Johnson, V.A. Zakharov, \An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs", pp. 144-155, Proc. ISC 2001 { 4th International Information Security Conference, Malaga, Spain 1-3 October 2001, Springer LNCS 2200 (2001).

No context found.

S. Chow, Y. Gu, H. Johnson, V.A. Zakharov, \An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs", pp. 144-155, Proc. ISC 2001 { 4th International Information Security Conference, Malaga, Spain 1-3 October 2001, Springer LNCS 2200 (2001).

No context found.

S. Chow, Y. Gu, H. Johnson, and V. Zakharov. An approach to the obfuscation of control-flow of sequential computer programs. In Proceedings of ISC, 2001. Published in Springer-Verlag LNCS 2200.

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