Zero-knowledge and code obfuscation

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

Volumn 1976, Issue , 2000, Pages 443-457

  Hada, Satoshi ^a  

^a IBM RESEARCH   (United States)

Author keywords

Code obfuscation; Interactive argument; Interactive proof; Reverse engineering; Zero knowledge

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; REVERSE ENGINEERING; SECURITY OF DATA;

CODE OBFUSCATION; COMPUTATIONAL ASSUMPTIONS; ENGINEERING PROPERTIES; INTERACTIVE ARGUMENT; INTERACTIVE PROOFS; PSEUDO-RANDOM FUNCTIONS; SECURITY DEFINITIONS; ZERO KNOWLEDGE;

CODES (SYMBOLS);

EID: 84937414062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_34     Document Type: Conference Paper

References (14)

1. G. Brassard and C. Crépeau, “Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond, ” Proceedings of 27th FOCS, 1986.
2. R. Canetti, “Security and Composition of Multiparty Cryptographic Protocols,” Journal of Cryptology, Vol. 13, No. 1, pp. 143-202, 2000.
3. C. Collberg, C. Thomborson and D. Low, “A Taxonomy of ObfuscatingT ransformations,” Technical Report 148, Department of Computer Science, University of Auckland, 1997.
4. C. Dwork, M. Naor, O. Reingold and L. Stockmeyer, “Magic Functions, ” Proceedings of 40th FOCS, 1999.
5. O. Goldreich, “Modern Cryptography, Probabilistic Proofs and Pseudorandomness,” Algorithms and Combinatorics Vol. 17, Springer, 1999.
6. O. Goldreich, S. Goldwasser, and S. Micali, “How to Construct Random Functions,” Journal of the ACM, Vol. 33, No. 4, pp. 792-807, 1986.
7. O. Goldreich and H. Krawczyk, “On the Composition of Zero-Knowledge Proof Systems,” SIAM Journal on Computing, Vol. 25, No. 1, pp. 169-192, 1996.
8. O. Goldreich and Y. Oren, “Definitions and Properties of Zero-Knowledge Proof Systems,” Journal of Cryptology, Vol. 7, No. 1, pp. 1-32, 1994.
9. O. Goldreich and R. Ostrovsky, “Software Protection and Simulation on Oblivious RAMs,” Journal of the ACM, Vol. 43, No. 3, pp. 431-473, 1996.
10. S. Goldwasser and S. Micali, “Probabilistic Encryption,” J. Comput. System Sci., 28, pp. 270-299, 1984.
11. S. Goldwasser, S. Micali, and C. Rackoff, “The Knowledge Complexity of Interactive Proofs,” Proceedings of 17th STOC, pp. 291-304, 1985.
12. S. Hada and T. Tanaka, “On the Existence of 3-Round Zero-Knowledge Protocols, ” Proceedings of CRYPTO’98, pp. 408-423, 1998. A revised version is available as Theory of Cryptography Library: Record 99-9.
13. J. E. Hopcroft and J. D. Ullman, “Introduction to Automata Theory, Languages, and Computation,” Addison-Wesley, 1979.
14. Y. Oren, “On the Cunning Power of Cheating Verifiers: Some Observations about Zero-Knowledge Proofs,” Proceedings of 28th FOCS, pp. 462-471, 1987.