Lower bounds for non-black-box zero knowledge

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 384-393

  Barak, Boaz ^a   Lindell, Yehuda ^b   Vadhan, Salil ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

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

^c HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; CRYPTOGRAPHY; KNOWLEDGE ENGINEERING; PROBABILITY;

NONBLACK BOX ZERO KNOWLEDGE; NONTRIVIAL LANGUAGE;

COMPUTATIONAL COMPLEXITY;

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

References (39)

1. V. Arvind and J. Köbler. On Pseudorandomness and Resource-Bounded Measure. Theoretical Computer Science, 255(1-2):205-221, 2001.
2. L. Babai and S. Moran. Arthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes. J. Comput. Syst. Sci., 36:254-276, 1988.
3. B. Barak. How to Go Beyond the Black-Box Simulation Barrier. In 42nd FOCS, pages 106-115, 2001.
4. B. Barak, O. Goldreich, S. Goldwasser, and Y. Lindell. Resettably-Sound Zero-Knowledge and its Applications. In 42nd FOCS, pages 116-125, 2001.
5. B. Barak and Y. Lindell. Strict Polynomial-time in Simulation and Extraction. In 34th STOC, pages 484-493, 2002.
6. B. Barak, S. J. Ong, and S. Vadham. Derandomization in Cryptography. In CRYPTO'03, 2003.
7. M. Blum. How to Prove a Theorem So No One Else Can Claim It. In Proc. ICM, pages 1444-1451, 1987.
8. G. Brassard, D. Chaum, and C. Crépeau. Minimum Disclosure Proofs of Knowledge. JCSS, 37(2):156-189, 1988.
9. G. Brassard, C. Crépeau, and M. Yung. Everything in NP Can Be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds. In EUROCRYPT'89, pp. 192-195, 1989.
10. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS, pages 136-145, 2001.
11. R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali. Resettable Zero-Knowledge. 32nd STOC, pp. 235-244, 2000.
12. R. Canetti, J. Kilian, E. Petrank, and A. Rosen. Black-Box Concurrent Zero-Knowledge Requires Ω̃(log n) Rounds. In 33rd STOC, pages 570-579, 2001.
13. R. Canetti, E. Kushilevitz, and Y. Lindell. On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions In EUROCRYPT'03, pages 68-86, 2003.
14. C. Dwork and M. Naor. Zaps and Their Applications. In 41st FOCS, pages 283-293, 2000.
15. C. Dwork, M. Naor, O. Reingold, and L. Stockmeyer. Magic Functions. In 40th FOCS, pages 523-534, 1999.
16. C. Dwork, M. Naor, and A. Sahai. Concurrent Zero Knowledge. In 30th STOC, pages 409-418, 1998.
17. U. Feige and A. Shamir. Zero Knowledge Proofs of Knowledge in Two Rounds. In CRYPTO'89, pages 526-545, 1989.
18. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In CRYPTO'86, pages 186-194, 1986.
19. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.
20. O. Goldreich and A. Kahan. How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. Journal of Cryptology, 9(3):167-189, 1996.
21. O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SICOMP, 25(1):169-192, 1996.
22. O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. Journal of the ACM, 38(3):691-729, 1991.
23. O. Goldreich and Y. Oren. Definitions and Properties of Zero-Knowledge Proof Systems. J. Cryptology, 7(1):1-32, 1994.
24. S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, 18(1):186-208, 1989.
25. S. Goldwasser and Y. Tauman. On the (In)security of the Fiat-Shamir Paradigm. These proceedings.
26. J. Håstad, R. Impagliazzo, L. A. Llevin, and M. Luby. A Pseudorandom Generator From Any One-Way Function. SIAM J. Comput., 28(4):1364-1396, 1999.
27. J. Kilian and E. Petrank. Concurrent and Resettable Zero-Knowledge in Poly-logarithmic Rounds. In 33rd STOC, pages 560-569, 2001.
28. J. Kilian, E. Petrank, and C. Rackoff. Lower Bounds for Zero Knowledge on the Internet. In 39th FOCS, pages 484-492, 1998.
29. A. R. Klivans and D. van Melkebeek. Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. SICOMP, 31(5):1501-1526, 2002.
30. M. G. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
31. S. Micali. CS Proofs. In 35th FOCS, pages 436-453, 1994.
32. P. B. Mltersen and N. V. Vinodchandran. Derandomizing Arthur-Merlin Games Using Hitting Sets. In 40th FOCS, pages 71-80, 1999.
33. N. Nisan and D. Zuckerman. Randomness is Linear in Space. J. Comput. Syst. Sci., 52(1):43-52, 1996.
34. M. Prabhakaran, A. Rosen, and A. Sahai. Concurrent Zero Knowledge with Logarithmic Round-Complexity. In 33rd FOCS, pages 366-375, 2002.
35. L. Reyzin. Zero-Knowledge with Public Keys. PhD thesis, MIT, 2001.
36. P. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In EUROCRYPT'99, pages 415-431, 1999.
37. A. Rosen. A Note on the Round-Complexity of Concurrent Zero-Knowledge. In Crypto'00, pages 451-468, 2000.
38. R. Shaltiel. Recent Developments in Extractors. Bulletin of the European Association for Theoretical Computer Science, 2002.
39. R. Shaltiel and C. Umans, Simple Extractors for all Minentropies and a New Pseudorandom Generator. In 42nd FOCS, pages 648-657, 2001.