Cryptology ePrint Archive: Report 2015/793

Algorithmic Information Theory for Obfuscation Security

Rabih Mohsen and Alexandre Miranda Pinto

Abstract: The main problem in designing effective code obfuscation is to guarantee security. State of the art obfuscation techniques rely on an unproven concept of security, and therefore are not regarded as provably secure. In this paper, we undertake a theoretical investigation of code obfuscation security based on Kolmogorov complexity and algorithmic mutual information. We introduce a new definition of code obfuscation that requires the algorithmic mutual information between a code and its obfuscated version to be minimal, allowing for controlled amount of information to be leaked to an adversary. We argue that our definition avoids the impossibility results of Barak et al. and is more advantageous then obfuscation indistinguishability definition in the sense it is more intuitive, and is algorithmic rather than probabilistic.

Category / Keywords: foundations / Code Obfuscation, Kolmogorov Complexity, Intellectual Property Protection

Original Publication (in the same form): International Conference on Security and Cryptography (SECRYPT 2015)

Date: received 6 Aug 2015

Contact author: r mohsen11 at imperial ac uk

Available format(s): PDF | BibTeX Citation

Version: 20150810:142334 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]