Algorithmic Information Theory for Obfuscation Security

Rabih Mohsen, Alexandre Miranda Pinto

2015

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.

Paper Citation

in Harvard Style

Mohsen R. and Miranda Pinto A. (2015). Algorithmic Information Theory for Obfuscation Security . In Proceedings of the 12th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2015) ISBN 978-989-758-117-5, pages 76-87. DOI: 10.5220/0005548200760087

in Bibtex Style

@conference{secrypt15,
author={Rabih Mohsen and Alexandre Miranda Pinto},
title={Algorithmic Information Theory for Obfuscation Security},
booktitle={Proceedings of the 12th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2015)},
year={2015},
pages={76-87},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005548200760087},
isbn={978-989-758-117-5},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 12th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2015)
TI - Algorithmic Information Theory for Obfuscation Security
SN - 978-989-758-117-5
AU - Mohsen R.
AU - Miranda Pinto A.
PY - 2015
SP - 76
EP - 87
DO - 10.5220/0005548200760087