Software obfuscation on a theoretical basis and its implementation

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E86-A, Issue 1, 2003, Pages 176-186

  Ogiso, Toshio ^a   Sakabe, Yusuke ^a   Soshi, Masakazu ^a   Miyaji, Atsuko ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Computational complexity; Obfuscation; Static analysis; Tamper resistant software

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; INTELLECTUAL PROPERTY; PROBLEM SOLVING;

SOFTWARE OBFUSCATION;

SECURITY SYSTEMS;

EID: 0041475743     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (18)

1. A.V. Aho, R. Sethi, and J.D. Ullman, Compilers: Principles, Techniques and Tools, Addison-Wesley, 1986.
2. G. Aigner, A. Diwan, D.L. Heine, M.S. Lam, D.L. Moore, B.R. Murphy, and C. Sapuntzakis, An overview of the SUIF2 compiler infrastructure, Computer Systems Laboratory, Stanford University, http://suif.stanford.edu/.
3. D. Aucsmith, "Tamper resistant software: An implementation," in R.J. Anderson ed., Information Hiding: First International Workshop, Lecture Notes in Computer Science, vol. 1174, pp.317-333, Springer-Verlag, 1996.
4. C. Collberg, C. Thomborson, and D. Low, A taxonomy of obfuscating transformations, Technical Report 148, Department of Computer Science, the University of Auckland, Auckland, New Zealand, 1997.
5. M.R. Garey and D.S. Johnson, Computers and Intractability - A Guide to the Theory of NT-completeness, W.H. Freeman and Co., 1979.
6. M. Hind, M. Burke, P. Carini, and J.-D. Choi, "Interprocedural pointer alias analysis," ACM Trans. Prog. Lang. Syst., vol.21, no.4, pp.848-894, 1999.
7. F. Hohl, "Time limited Blackbox security: Protecting mobile agents from malicious hosts," in G. Vigna ed., Mobile Agents Security, Lecture Notes in Computer Science, vol.1419, pp.92-113, Springer-Verlag, 1998.
8. T. Iwai, K. Kuriyama, W. Wu, and F. Mizoguchi, "A proposal for tamper-resistant mobile agents," Computer Security Symposium (CSS99), pp.43-48, Oct. 1999.
9. W.A. Landi, Interprocedural aliasing in the presence of pointers, PhD thesis, Rutgers University, New Brunswick, NJ, Jan. 1992.
10. M. Mambo, T. Murayama, and E. Okamoto, "A tentative approach to constructing tamper-resistant software," New Security Paradigm Workshop, pp.23-33, Sept. 1997.
11. T.J. Marlowe and B.G. Ryder, "Properties of data flow frameworks: A unified model," Acta Inf., vol.28, no.2, pp.121-163, 1990.
12. M. Misawa, K. Akai, and T. Matsumoto, "Evaluation of obfuscator by searching runtime data," Symposium on Cryptography and Information Security (SCIS 2002), pp.365-370, Jan. 2002.
13. R. Muth and S. Debray, On the complexity of function pointer may-alias analysis, Technical Report TR96-18, Department of Computer Science, University of Arizona, Oct. 1996.
14. E.W. Myers, "A precise inter-procedural data flow algorithm," Conference record of the 8th ACM Symposium on Principles of Programming Languages (POPL), pp.219-230, 1981.
15. G. Ramalingam, "The undecidability of aliasing," ACM Trans. Prog. Lang. Syst., vol.16, no.6, pp.1467-1471, Nov. 1994.
16. C. Wang, J. Hill, J. Knight, and J. Davidson, "Software tamper resistance: Obstructing static analysis of programs," Technical Report CS-2000-12, Department of Computer Science, University of Virginia, Dec. 2000.
17. U.G. Wilhelm, S. Staamann, and L. Buttyán, On the problem of trust in mobile agent systems, Symposium on Network and Distributed System Security, Internet Society, March 1998.
18. S. Zhang and B. Ryder, Complexity of single level function pointer aliasing analysis, Technical Report LCSR-TR-233, Laboratory of Computer Science Research, Rutgers University, Oct. 1994.