Indistinguishable executable code generation method
- Authors: Styugin M.A.1
-
Affiliations:
- Siberian State Aerospace University (SibSAU)
- Issue: Vol 23, No 1 (2017)
- Pages: 28-33
- Section: Digital processing of signals and images
- Published: 15.01.2017
- URL: https://journals.eco-vector.com/1684-6400/article/view/703301
- DOI: https://doi.org/10.17587/it.23.28-33
- ID: 703301
Cite item
Full Text
Abstract
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, therefore that obfuscator type is named a key obfuscator. The paper proves existence of a key obfuscator and existence of efficient 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.
About the authors
M. A. Styugin
Siberian State Aerospace University (SibSAU)
Author for correspondence.
Email: styugin@gmail.com
PhD, Researcher
Russian Federation, KrasnoyarskReferences
- Hada S. Zero-knowledge and code obfuscation, Advances in Cryptology — ASIACRYPT, 2000, pp. 443—457.
- Barak B., Goldreich O., Impagliazzo R. On the (Im)possibility of obfuscating programs, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2001, no. 2139, pp. 1—18.
- Katz J., Lindell Y. Introduction to Modern Cryptography, CRC PRESS, 2007, 512 p.
- Garg S., Raykova M., Sahai A. Candidate indistinguishability obfuscation and functional encryption for all circuits, Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013), 2013, pp. 23—41.
- Alwen J., Barbosa M., Farshim P. On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption, Lecture Notes in Computer Science, Cryptography and Coding, 2014, no. 8308, pp. 65—84.
- Sahai A., Waters B. How to use indistinguishability obfuscation: deniable encryption, and more, Proc. of the 46th Annual ACM Symposium on Theory of Computing, 2014, pp. 475—484.
- Garg S., Gentry C., Halevi S. Candidate Multilinear Maps from Ideal Lattices, Lecture Notes in Computer Science (EUROCRYPT 2013), 2013, no. 7881, pp. 1—17.
- Barak B., Garg S., Kalai Y. Protecting Obfuscation Against Algebraic Attacks, EUROCRYPT 2014, 2014, pp. 221—238.
- Koppula V., Bishop A., Waters B. Indistinguishability Obfuscation for Turing Machines with Unbounded Memory, Proc. of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015, pp. 419—428.
Supplementary files

