Earticle

초록

영어

The classical objective of obfuscation considers indistinguishability of the obtained code in relation to original programs of equal functionality. The present paper reviews another objective of obfuscation, when indistinguishability is considered relatively to programs of different functionality. In this case, an obfuscator is provided with a key at the input. It is nearly impossible to discover the program’s functionality without having the key. Hence, that obfuscator type is named a key obfuscator. The paper proves existence of a key obfuscator and existence of effective algorithms for its operation demonstrated by recursive functions. The practical relevance of the result obtained by the research is the possibility to store an executable code in an untrusted computational environment and to obstruct injection attacks and distributed computing analysis. RKB-Obfuscator (Recursive Key Blur), an application for obfuscating high-level applications is presented. The presented application matches recursive functions with commands of a high-level programming language.

목차

Abstract
 1. Introduction
 2. Setting the Objective for Key-Based Obfuscation
 3. Inefficient Algorithms for Creating a Key-Based Obfuscator
 4. Efficient Algorithms for Creating a Key-Based Obfuscator
 5. Practical Implementation of a Key-Based Obfuscator by the Example of the Rkb-Obfuscator
 6. Conclusion
 Acknowledgments
 References

키워드

저자

• Mikhail Styugin [ Siberian Federal University, Krasnoyarsk, Russia ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605