Analysis of Program Obfuscation Schemes with Variable Encoding Technique

Kazuhide FUKUSHIMA; Shinsaku KIYOMOTO; Toshiaki TANAKA; Kouichi SAKURAI

doi:10.1093/ietfec/e91-a.1.316

Analysis of Program Obfuscation Schemes with Variable Encoding Technique

Kazuhide FUKUSHIMA, Shinsaku KIYOMOTO, Toshiaki TANAKA, Kouichi SAKURAI

Full Text Views

0

Share
Cite this

Summary :

Program analysis techniques have improved steadily over the past several decades, and software obfuscation schemes have come to be used in many commercial programs. A software obfuscation scheme transforms an original program or a binary file into an obfuscated program that is more complicated and difficult to analyze, while preserving its functionality. However, the security of obfuscation schemes has not been properly evaluated. In this paper, we analyze obfuscation schemes in order to clarify the advantages of our scheme, the XOR-encoding scheme. First, we more clearly define five types of attack models that we defined previously, and define quantitative resistance to these attacks. Then, we compare the security, functionality and efficiency of three obfuscation schemes with encoding variables: (1) Sato et al.'s scheme with linear transformation, (2) our previous scheme with affine transformation, and (3) the XOR-encoding scheme. We show that the XOR-encoding scheme is superior with regard to the following two points: (1) the XOR-encoding scheme is more secure against a data-dependency attack and a brute force attack than our previous scheme, and is as secure against an information-collecting attack and an inverse transformation attack as our previous scheme, (2) the XOR-encoding scheme does not restrict the calculable ranges of programs and the loss of efficiency is less than in our previous scheme.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.1 pp.316-329

Publication Date: 2008/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e91-a.1.316

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Cryptanalysis

Cite this

Copy

Kazuhide FUKUSHIMA, Shinsaku KIYOMOTO, Toshiaki TANAKA, Kouichi SAKURAI, "Analysis of Program Obfuscation Schemes with Variable Encoding Technique" in IEICE TRANSACTIONS on Fundamentals, vol. E91-A, no. 1, pp. 316-329, January 2008, doi: 10.1093/ietfec/e91-a.1.316.
Abstract: Program analysis techniques have improved steadily over the past several decades, and software obfuscation schemes have come to be used in many commercial programs. A software obfuscation scheme transforms an original program or a binary file into an obfuscated program that is more complicated and difficult to analyze, while preserving its functionality. However, the security of obfuscation schemes has not been properly evaluated. In this paper, we analyze obfuscation schemes in order to clarify the advantages of our scheme, the XOR-encoding scheme. First, we more clearly define five types of attack models that we defined previously, and define quantitative resistance to these attacks. Then, we compare the security, functionality and efficiency of three obfuscation schemes with encoding variables: (1) Sato et al.'s scheme with linear transformation, (2) our previous scheme with affine transformation, and (3) the XOR-encoding scheme. We show that the XOR-encoding scheme is superior with regard to the following two points: (1) the XOR-encoding scheme is more secure against a data-dependency attack and a brute force attack than our previous scheme, and is as secure against an information-collecting attack and an inverse transformation attack as our previous scheme, (2) the XOR-encoding scheme does not restrict the calculable ranges of programs and the loss of efficiency is less than in our previous scheme.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.1.316/_p

Copy

@ARTICLE{e91-a_1_316,
author={Kazuhide FUKUSHIMA, Shinsaku KIYOMOTO, Toshiaki TANAKA, Kouichi SAKURAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Analysis of Program Obfuscation Schemes with Variable Encoding Technique},
year={2008},
volume={E91-A},
number={1},
pages={316-329},
abstract={Program analysis techniques have improved steadily over the past several decades, and software obfuscation schemes have come to be used in many commercial programs. A software obfuscation scheme transforms an original program or a binary file into an obfuscated program that is more complicated and difficult to analyze, while preserving its functionality. However, the security of obfuscation schemes has not been properly evaluated. In this paper, we analyze obfuscation schemes in order to clarify the advantages of our scheme, the XOR-encoding scheme. First, we more clearly define five types of attack models that we defined previously, and define quantitative resistance to these attacks. Then, we compare the security, functionality and efficiency of three obfuscation schemes with encoding variables: (1) Sato et al.'s scheme with linear transformation, (2) our previous scheme with affine transformation, and (3) the XOR-encoding scheme. We show that the XOR-encoding scheme is superior with regard to the following two points: (1) the XOR-encoding scheme is more secure against a data-dependency attack and a brute force attack than our previous scheme, and is as secure against an information-collecting attack and an inverse transformation attack as our previous scheme, (2) the XOR-encoding scheme does not restrict the calculable ranges of programs and the loss of efficiency is less than in our previous scheme.},
keywords={},
doi={10.1093/ietfec/e91-a.1.316},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - Analysis of Program Obfuscation Schemes with Variable Encoding Technique
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 316
EP - 329
AU - Kazuhide FUKUSHIMA
AU - Shinsaku KIYOMOTO
AU - Toshiaki TANAKA
AU - Kouichi SAKURAI
PY - 2008
DO - 10.1093/ietfec/e91-a.1.316
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2008
AB - Program analysis techniques have improved steadily over the past several decades, and software obfuscation schemes have come to be used in many commercial programs. A software obfuscation scheme transforms an original program or a binary file into an obfuscated program that is more complicated and difficult to analyze, while preserving its functionality. However, the security of obfuscation schemes has not been properly evaluated. In this paper, we analyze obfuscation schemes in order to clarify the advantages of our scheme, the XOR-encoding scheme. First, we more clearly define five types of attack models that we defined previously, and define quantitative resistance to these attacks. Then, we compare the security, functionality and efficiency of three obfuscation schemes with encoding variables: (1) Sato et al.'s scheme with linear transformation, (2) our previous scheme with affine transformation, and (3) the XOR-encoding scheme. We show that the XOR-encoding scheme is superior with regard to the following two points: (1) the XOR-encoding scheme is more secure against a data-dependency attack and a brute force attack than our previous scheme, and is as secure against an information-collecting attack and an inverse transformation attack as our previous scheme, (2) the XOR-encoding scheme does not restrict the calculable ranges of programs and the loss of efficiency is less than in our previous scheme.
ER -