On the possibility of provably secure obfuscating programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2890, Issue , 2003, Pages 91-102

  Varnovsky, Nikolay P ^a,b   Zakharov, Vladimir A ^a,b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b INSTITUTE FOR SYSTEM PROGRAMMING   (Russian Federation)

Author keywords

Hard core predicate; Mutual information; Obfuscation; One way function; Program transformation; Security

Indexed keywords

INFORMATION THEORY; SEMANTICS;

HARD CORES; MUTUAL INFORMATIONS; OBFUSCATION; ONE-WAY FUNCTIONS; PROGRAM TRANSFORMATIONS; SECURITY;

METADATA;

EID: 33244496918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (19)

1. Amoroso E.G. Fundamentals of Computer Security Technology. Englewood Cliffs, NJ: Prentice Hall PTR, 1994.
2. Barak B., Goldreich O., Impagliazzo R., Rudich S., Sahai A., Vedhan S., Yang K., On the (Impossibility of obfuscating programs. CRYPTO'01 - Advances in Cryptology, Lecture Notes in Computer Science, 2139, 2001, p. 1-18.
3. Chow S., Gu Y., Johnson H., Zakharov V., An approach to the obfuscation of control flow of sequential computer programs. Information Security Conference, Lecture Notes in Computer Science, 2200, 2001, p. 144-156.
4. Collberg C., Thomborson C., Low D., A taxonomy of obfuscating transformations, Tech. Report, N 148, Dept. of Computer Science, Univ. of Auckland, 1997.
5. Collberg C., Thomborson C., Low D., Manufacturing cheap, resilient and stealthy opaque constructs. Symposium on Principles of Programming Languages, 1998, p.184-196.
6. Collberg C., Thomborson C., Low D. Breaking abstraction and unstructuring data structures. IEEE International Conference on Computer Languages, 1998, p.28-38.
7. Collberg C., Thomborson C., Watermarking, tamper-proofing and obfuscation - tools for software protection. IEEE Transactions on Software Engineering, 28, N 2, 2002, p. 735-746.
8. Devanbu P.T., Stubblebine S. Software engineering for security: a roadmap. Future of SE Track, 2000, 227-239.
9. Diffie W., Hellman M.E., New directions in cryptography. IEEE Transactions in Information Theory, 22, 1976, p. 644-654.
10. Gollmann D. Computer Security. New York: Willey, 1999.
11. Goldreich O., Levin L.A., A hard-core predicate for all one-way functions. Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989, p. 25-32.
12. Hada S., Zero-knowledge and code obfuscation. ASIACRYPT'2000 - Advances in Cryptology, 2000.
13. Horwitz S., Precise flow-insensitive may-alias analysis is NP-hard. ACM Transactions on Programming Languages and Systems, 19, N 1, 1997, p. 1-6.
14. Landi W. Undecidability of static analysis. ACM Letters on Programming Languages and Systems, 1, N 4, 1992, p. 323-337.
15. MacDonald J. On program security and obfuscation. Technical Report, University of California, 1998.
16. Menezes A.J., Van Oorschot P.C., Vanstone S.A., Handbook of Applied Cryptography. CRC Press, 1997.
17. Ramalingam G., The undecidability of aliasing. ACM Transactions on Programming Languages and Systems, 16, N 5, 1994, p. 1467-1471.
18. Wang C., Hill J., Knight J. Davidson J., Software tamper resistance: obstructing static analysis of programs, Tech. Report, N 12, Dep. of Comp. Sci., Univ. of Virginia, 2000.
19. Wroblewski G., General method of program code obfuscation, in Proceedings of the International Conference on Software Engineering Research and Practice (SERP), 2002, p. 153-159.