MarriageTheoremのこと

_ IACR ePrint 2015/795まで確認済み、ECCC 2003年分まで確認済み

_ 気になった論文：Algorithmic Information Theory for Obfuscation Security, Rabih Mohsen and Alexandre Miranda Pinto, http://eprint.iacr.org/2015/793

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.