Abstract
Recently the demand to make software resistant to manipulation is increasing. Similarly the demand to hide operation of software or to hide secret used in software is increasing. Software possessing such properties is called tamper-resistant software. One of methods to realize tamper-resistant software is obfuscation of software, and evaluating such software objectively and quantitatively has been an important research subject. One of the known objective and quantitative methods is the method using a parse tree of a compiler proposed in [[GMMS00]]. This method takes into account the complexity in one module of software but not the complexity originated from relationships among modules. We propose at first several obfuscation methods to create a complicated module structure which violates the structured programming rules. Then, we propose a new evaluation method which can measure the difficulty caused by complicated structure among modules. Its effectiveness is proven through experiments. One of experiments shows the grades obtained by the proposed evaluation well reflects the actual reading time required by analysts.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kenichiro AKAI, Tsutomu MATSUMOTO, “Brute force method of tamper resistance evaluation for block cipher software,” Computer Security Symposium 2000, CSS 2000, IPSJ Symposium series, Vol. 2000, No. 12, pp. 205–210, 2000. [in Japanese]
David Aucsmith, “Tamper Resistant Software: An Implementation,” Information Hiding, IH’ 96, Lecture Notes in Computer Science Vol. 1174, Springer-Verlag, pp. 317–333, 1996.
Christian Collberg, Clark Thomborson, Douglas Low, “A Taxonomy of Obfuscating Transformations,” Technical Report 148, Department of Computer Science, The University of Auckland, 1997.
Ole-Johan Dahl, Edsger Dijkstra, C.A.R. Hoare, Structured Programming, A.P.I.C. Studies in Data Processing, No. 8, Academic Press, 1972.
Hideaki Goto, Masahiro Mambo, Kenjiro Matsumura, Hiroki Shizuya, “An Approach to the Objective and Quantitative Evaluation of Tamper-Resistant Software,” Information Security Workshop, ISW2000, Lecture Notes in Computer Science Vol. 1975, Springer-Verlag, pp. 82–96, 2000.
Jun KUWAHARA, Tsutomu MATSUMOTO, “A Method of Constructing Tamper-Resistant Java Classfiles,”Proc. of 2000 Symposium on Cryptography and Information Security, SCIS2000-D10, Jan. 2000. [in Japanese]
Masahiro MAMBO, Takanori MURAYAMA and Eiji OKAMOTO, “A Tentative Approach to Constructing Tamper-Resistant Software,” 1997 New Security Paradigms Workshop, ACM Press, pp. 23–33 1998.
Akito MONDEN, Yoshihiro TAKADA and Koji TORII, “Methods for Scrambling Programs Containing Loops,” Trans. of IEICE, Vol. J80-D-I, No. 7, pp. 644–652, 1997. [in Japanese]
Eisaku Teranishi, Eiji Okamoto and Masahiro Mambo, “A Proposal of Copyright Protection Scheme for Software Programs,” Proc. of 1997 Symposium on Cryptography and Information Security, SCIS97-10B, Jan. 1997. [in Japanese]
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goto, H., Mambo, M., Shizuya, H., Watanabe, Y. (2001). Evaluation of Tamper-Resistant Software Deviating from Structured Programming Rules. In: Varadharajan, V., Mu, Y. (eds) Information Security and Privacy. ACISP 2001. Lecture Notes in Computer Science, vol 2119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47719-5_13
Download citation
DOI: https://doi.org/10.1007/3-540-47719-5_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42300-3
Online ISBN: 978-3-540-47719-8
eBook Packages: Springer Book Archive