An unconditional study of computational zero knowledge

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 176-185

  Vadhan, Salil P ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLACK-BOX SIMULATORS; COMPUTATIONAL ZERO KNOWLEDGE; INTERACTIVE PROOFS; POLYNOMIAL-TIME VERIFIERS;

CRYPTOGRAPHY; FUNCTIONS; PROBLEM SOLVING; RANDOM PROCESSES; SIMULATORS; STATISTICAL METHODS; THEOREM PROVING;

COMPUTATIONAL COMPLEXITY;

EID: 17744388835     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. W. Aiello and J. Håstad. Statistical zero-knowledge languages can be recognized in two rounds. J. Computer & System Sci., 42(3):327-345, 1991.
2. B. Barak. How to go beyond the black-box simulation barrier. Proc. 42nd FOCS, 2001.
3. M. Bellare, S. Micali, and R. Ostrovsky. Perfect zeroknowledge in constant rounds. In Proc. 22nd STOC, pages 482-493, 1990.
4. M. Bellare and E. Petrank. Making zero-knowledge provers efficient. In Proc. 24th STOC, pages 711-722, 1992.
5. M. Ben-Or, O. Goldreich, S. Goldwasser, J. Håstad, J. Kilian, S. Micali, and P. Rogaway. Everything provable is provable in zero-knowledge. In Proc. CRYPTO '88, 1988.
6. M. Blum. How to prove a theorem so no one else can claim it. In Proc. ICM, Vol. 1, 2, pages 1444-1451. AMS, 1987.
7. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. J. Computer & System Sci., 37(2): 156-189, Oct. 1988.
8. A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung. On monotone formula closure of SZK. In Proc. 35th FOCS, pages 454-465, 1994.
9. G. Di Crescenzo, T. Okamoto, and M. Yung. Keeping the SZK-verifier honest unconditionally. In Proc. CRYPTO '97, pages 31-45, 1997.
10. S. Even, A. L. Selman, and Y. Yacobi. The complexity of promise problems with applications to public-key cryptography. Information and Control, 61(2): 159-173, 1984.
11. L. Fortnow. The complexity of perfect zero-knowledge. In Advances in Computing Research, volume 5, pages 327-343. JAC Press, 1989.
12. M. Fürer, O. Goldreich, Y. Mansour, M. Sipser, and S. Zachos. On completeness and soundness in interactive proof systems. In Advances in Computing Research, volume 5, pages 429-442. JAC Press, 1989.
13. O. Goldreich. A note on computational indistinguishability. Information Processing Lett., 34(6):277-281, 28 May 1990.
14. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.
15. O. Goldreich and A. Kahan. How to construct constant-round zero-knowledge proof systems for NP. J. Cryptology, 9(3):167-190, 1996.
16. O. Goldreich and H. Krawczyk. Sparse pseudorandom distributions. Random Structures & Alg., 3(2): 163-174, 1992.
17. O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIAM J. Comput., 25(1), 1996.
18. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM, 38(1):691-729, 1991.
19. O. Goldreich and E. Petrank. Quantifying knowledge complexity. Computational Complexity, 8(1):50-98, 1999.
20. O. Goldreich, A. Sahai, and S. Vadhan. Honest verifier statistical zero-knowledge equals general statistical zeroknowledge. In Proc. 30th STOC, pages 399-408, 1998.
21. O. Goldreich and S. Vadhan. Comparing entropies in statistical zero-knowledge with applications to the structure of SZK. In Proc. 14th CCC, pages 54-73, 1999.
22. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Computing, 18(1):186-208, 1989.
23. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. In Advances in Computing Research, volume 5, pages 73-90. JAC Press, 1989.
24. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Computing, 28(4):1364-1396, 1999.
25. R. Impagliazzo and M. Yung. Direct minimum-knowledge computations (extended abstract). In Proc. CRYPTO '87, pages 40-51, 1987.
26. T. Itoh, Y. Ohta, and H. Shizuya. A language-dependent cryptographic primitive. J. Cryptology, 10(1):37-49, 1997.
27. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. J. ACM, 39(4): 859-868, 1992.
28. D. Micciancio and S. Vadhan. Statistical zero-knowledge proofs with efficient provers: lattice problems and more. In Proc. CRYPTO '03, pages 282-298, 2003.
29. M. Naor. Bit commitment using pseudorandomness. J. Cryptology, 4(2):151-158, 1991.
30. T. Okamoto. On relationships between statistical zero-knowledge proofs. J. Computer & System Sci., 60(1):47-108, 2000.
31. R. Ostrovsky and A. Wigderson. One-way functions are essential for non-trivial zero-knowledge. In Proc. of the 2nd Israel Symp. on Theory of Computing and Systems, 1993.
32. E. Petrank and G. Tardos. On the knowledge complexity of NP. In Proc. 37th FOCS, pages 494-503, 1996.
33. A. Sahai and S. Vadhan. A complete problem for statistical zero knowledge. J. ACM, 50(2): 196-249, 2003.
34. A. Shamir. IP = PSPACE. J. ACM, 39(4):869-877, 1992.
35. S. P. Vadhan. A Study of Statistical Zero-Knowledge Proofs. PhD thesis, MIT, 1999.