Java obfuscation with a theoretical basis for building secure mobile agents

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2828, Issue , 2003, Pages 89-103

  Sakabe, Yusuke ^a,b   Soshi, Masakazu ^a   Miyaji, Atsuko ^a  

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

^b SONY CORPORATION   (Japan)

Author keywords

Computational complexity; Mobile agents; Obfuscation; Security; Static analysis

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; STATIC ANALYSIS;

EMPIRICAL EXPERIMENTS; JAVA OBFUSCATION; JAVA PROGRAM; NOVEL TECHNIQUES; OBFUSCATION; POINTS-TO ANALYSIS; SECURE MOBILE AGENT; SECURITY;

MOBILE AGENTS;

EID: 35248814855     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45184-6_8     Document Type: Article

References (11)

1. Hohl, F.: Time limited blackbox security: Protecting mobile agents from malicious hosts. In Vigna, G., ed.: Mobile Agents Security. Volume 1419 of Lecture Notes in Computer Science. Springer-Verlag (1998) 92-113
2. Collberg, C., Thomborson, C., Low, D.: A taxonomy of obfuscating transformations. Technical Report 148, Department of Computer Science, the University of Auckland, Auckland, New Zealand (1997)
3. Aucsmith, D.: Tamper resistant software: An implementation. In Anderson, R.J., ed.: Information Hiding: First International Workshop. Volume 1174 of Lecture Notes in Computer Science., Springer-Verlag (1996) 317-333
4. Mambo, M., Murayama, T., Okamoto, E.: A tentative approach to constructing tamper-resistant software. In: New Security Paradigm Workshop. (1997) 23-33
5. Ogiso, T., Sakabe, Y., Soshi, M., Miyaji, A.: Software obfuscation on a theoretical basis and its implementation. IEICE Transactions on Fundamentals E86-A (2003) 176-186
6. Wang, C., Hill, J., Knight, J., Davidson, J.: Software tamper resistance: Obstructing static analysis of programs. Technical Report CS-2000-12, Department of Computer Science, University of Virginia (2000)
7. Chatterjee, R., Ryder, B.G., Landi, W.: Complexity of points-to analysis of Java in the presence of exceptions. IEEE Transactions on Software Engineering 27 (2001) 481-512
8. Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-completeness. W. H. Freeman and Co. (1979)
9. Sander, T., Tschudin, C.F.: Protecting mobile agents against malicious hosts. In Vign, G., ed.: Mobile Agents and Security. Volume 1419 of Lecture Notes in Computer Science. Springer-Verlag (1998) 44-60
10. Kotzanikolaou, P., Burmester, M., Chrissikopoulos, V.: Secure transactions with mobile agents in hostile environments. In: Information Security and Privacy: Fifth Australasian Conference on Information Security and Privacy, ACISP 2000. Volume 1841 of Lecture Notes in Computer Science., Springer-Verlag (2000) 289-297
11. Myers, E.W.: A precise inter-procedural data flow algorithm. In: Conference record of the 8th ACM Symposium on Principles of Programming Languages (POPL). (1981) 219-230