Journal of South China University of Technology (Natural Science Edition) ›› 2015, Vol. 43 ›› Issue (5): 132-138.doi: 10.3969/j.issn.1000-565X.2015.05.021

• Computer Science & Technology • Previous Articles     Next Articles

Parameterized Decomposition Tree-Based Obfuscation Method with Double Flattening Control Flow

Zhou Na-qin Qi De-yu   

  1. Research Institute of Computer Systems,South China University of Technology,Guangzhou 510006,Guangdong,China
  • Received:2014-01-03 Revised:2015-04-02 Online:2015-05-25 Published:2015-05-07
  • Contact: 周娜琴(1982-),女,博士生,主要从事软件安全研究. E-mail:zhou.naqin@mail.scut.edu.cn
  • About author:周娜琴(1982-),女,博士生,主要从事软件安全研究.
  • Supported by:
    Supported by the Science and Technology Planning Project of Guangdong Province(2011B010200054) and the Team Project Fund of Natural Science Foundation of Guangdong Province(10351806001000000)

Abstract: Aiming at the security problem of software white box,an improved parameterized decomposition tree-based obfuscation method with double flattening control flow is put forward. On the basis of given upper bounds of depth,breadth and granularity,the method builds a decomposition tree,coordinates the whole tree with a cycle se-lection structure named while-switch,and then applies double flattering to relevant nodes that satisfy certain condi-tions. Experimental results indicate that,in comparison with the flattening obfuscation method of control flow on the basis of parameterized decomposition tree,the proposed method reduces the execution expense and solves the deep nonfeasance problem; and that,in comparison with the traditional method only with flattening control flow,the pro-posed method increases the difficulty in decompilation and reverse engineering.

Key words: software protection, control flow flattening, code obfuscation, reverse engineering, decomposition tree, security

CLC Number: