On the composition of zero-knowledge proof systems

SIAM Journal on Computing

Volumn 25, Issue 1, 1996, Pages 169-192

  Goldreich, Oded ^a   Krawczyk, Hugo ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Cryptographic protocols; Interactive proofs; Zero knowledge

Indexed keywords

COMPOSITION; FORMAL LANGUAGES; SIMULATORS;

COMPLEXITY; INTERACTIVE PROOF; POLYNOMIAL TIME; PROOF SYSTEM; ZERO KNOWLEDGE;

CRYPTOGRAPHY;

EID: 0029767165     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539791220688     Document Type: Article

References (29)

1. L. BABAI, Trading group theory for randomness, in Proc. 17th ACM STOC, 1985, pp. 421-429.
2. M. BELLARE, S. MICALI, AND R. OSTROVSKY, Perfect zero knowledge in constant rounds, in Proc. 22nd ACM STOC, 1990, pp. 482-493.
3. _, The (true) complexity of statistical zero knowledge, in Proc. 22nd ACM STOC, 1990, pp. 494-502.
4. M. BEN-OR, O. GOLDREICH, S. GOLDWASSER, J. HASTAD, J. KILLIAN, S. MICALI, AND P. ROGAWAY, Every thing provable is provable in ZK, in Advances in Cryptology - Crypto '88 Proceedings, S. Goldwasser, ed., Lecture Notes in Comput. Sci. 403, Springer-Verlag, Berlin, 1989, pp. 37-56.
5. G. BRASSARD, D. CHAUM, AND C. CRÉPAU, Minimum disclosure proofs of knowledge, J. Comput. Systems Sci., 37 (1988), pp. 156-189.
6. G. BRASSARD, C. CRÉPAU, AND M. YUNG, Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds, in Proc. 16th ICALP, Stresa, Italy, 1989.
7. B. CHOR AND O. GOLDREICH, On the power of two-point based sampling, J. Complexity, 5 (1989), pp. 96-106.
8. U. FEIGE, Interactive proofs, M.Sc. thesis, Weizmann Institute, 1987.
9. U. FEIGE AND A. SHAMIR, Zero knowledge proofs of knowledge in two rounds, in Advance in Cryptology - Crypto '89 Proceedings, Lecture Notes in Comput. Sci. 435, G. Brassard, ed., 1989. pp. 526-544.
10. _, Witness indistinguishability and witness hiding protocols, in Proc. 22nd ACM STOC, 1990, pp. 416-426.
11. O. GOLDREICH, A uniform-complexity treatment of encryption and zero-knowledge, J. Cryptology, 6 (1993), pp. 21-53.
12. O. GOLDREICH AND A. KAHAN, How to construct constant-round zero-knowledge proof systems for NP, J. Cryptology, to appear.
13. O. GOLDREICH AND H. KRAWCZYK, Sparse pseudorandom distributions, Random Structures and Algorithms, 3 (1992), pp. 163-174.
14. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proofs, J. Assoc. Comput. Mach., 38 (1991), pp. 691-729.
15. _, How to play any mental game or a completeness theorem for protocols with honest majority, in Proc. 19th ACM STOC, 1987, pp. 218-229.
16. O. GOLDREICH AND Y. OREN, Definitions and properties of zero-knowledge proof systems, J. Cryptology, 6 (1993), pp. 1-32.
17. S. GOLDWASSER AND S. MICALI, Probabilistic encryption, J. Comput. System Sci., 28, (1984), pp. 270-299.
18. S. GOLDWASSER, S. MICALI, AND C. RACKOFF, Knowledge complexity of interactive proofs, in Proc. 17th ACM STOC, 1985, pp. 291-304.
19. _, The knowledge complexity of interactive proof systems, SIAM J. Comput., 18 (1989), pp. 186-208.
20. S. GOLDWASSER AND M. SIPSER, Private coins versus public coins in interactive proof systems, in Advances in Computing Research: A Research Annual, Vol. 5 (Randomness and Computation, S. Micali, ed.), 1989. pp. 73-90.
21. W. HOEFFDING, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc., 58 (1963), pp. 13-30.
22. R. IMPAGLIAZZO AND M. YUNG, Direct minimum-knowledge computations, in Advances in Cryptology - Crypto '87 Proceedings, C. Pomerance, ed., Lecture Notes in Comput. Sci. 293, Springer-Verlag, 1987, pp. 40-51.
23. A. JOFFE, On a set of almost deterministic k-independent random variables, Ann. Probab., 2 (1974), pp. 161-162.
24. Y. OREN, On the cunning power of cheating verifiers: Some observations about zero-knowledge proofs, in Proc. 28th IEEE Symp. on OCS, 1987, pp. 462-471.
25. D. SIMON, Issues in the definition of zero-knowledge, M.Sc. Thesis, University of Toronto, 1988.
26. A. SHAMIR, IP = PSPACE, in Proc. 31st IEEE Symp. on FOCS, 1990, pp. 11-15.
27. M. TOMPA AND H. WOLL, Random self-reducibility and zero-knowledge interactive proofs of possession of information, in Proc. 28th IEEE Symp. on FOCS, 1987, pp. 472-482.
28. M. N. WEGMAN AND J. L. CARTER, New hash functions and their use in authentication and set equality, J. Comput. Systems Sci., 22 (1981), pp. 265-279.
29. A. C. YAO, How to generate and exchange secrets, in Proc. 27th IEEE Symp. on FOCS, 1986, pp. 162-167.