On the complexity of bounded-interaction and noninteractive zero-knowledge proofs

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

Volumn , Issue , 1994, Pages 466-477

  Kilian, Joe ^a  

^a NEC CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC PRIMITIVES; INTERACTIVE IMPLEMENTATION; NON-INTERACTIVE PROOF; NON-INTERACTIVE ZERO-KNOWLEDGE PROOFS; NONBLOCKING NETWORKS; PROPERTY; RANDOM STRING; SECURITY PARAMETERS; STRING MODELS; ZERO-KNOWLEDGE PROOFS;

EID: 85115135380     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1994.365744     Document Type: Conference Paper

References (20)

1. S. Arora and T. Leighton and B. Maggs. On-line algorithms for path selection in a nonblocking network. Proc. of STOC90, pp. 149-158
2. S. Arora and S. Safra. Probabilistic Checking of Proofs, Proc. of STOC92.
3. G. Brassard, D. Chaum, and C. Crepeau. Minimum Disclosure Proofs of Knowledge, J. Comput. System Sci. 37 (1988), 156-189.
4. C. Bennett, personal communication via Gilles Brassard.
5. M. Bellare and M. Yung, Certifying Cryptographic Tools, the Case of Trapdoor Permutations, Advances in Cryptology - Crypto '92.
6. I. Damgard, Non-interactive circuit based proofs and noninteractive perfect zero-knowledge with preprocessing. Advances in Cryptology: Proceedings, Eurocrypt '92.
7. D. Beaver, F. Feigenbaum, J. Kilian and P. Rogaway, Cryptographic Applications of Locally Random Reductions Advances in Cryptology: Proceedings, Crypto 90.
8. th Symposium on the Theory of Computation, 1988, pages 103-112.
9. J. Boyar, and R. Peralta, Efficient Non-Interactive Zero-Knowledge Proofs of Circuit Satisfiability, Institut for Matematik og Datalogi, Odense Universitet, Preprints 1994, Nr. 1, ISSN No. 0903-3920.
10. A. De Santis, S. Micali and G. Persiano, "Bounded-Interaction Zero-Knowledge proofs," Advances in Cryptology - Crypto '88
11. U. Feige. Personal communication.
12. U. Feige, D. Lapidot and A. Shamir. Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, Proceedings of the 22th Annual Symposium on the Theory of Computation, 1990, pages 308-317
13. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solution to Identification and Signature Problems. Advances in Cryptology - Crypto '86, pp. 186-189.
14. O. Goldreich, S. Micali, and A. Wigderson. How to Play ANY Mental Game, Proc. of STOC87.
15. J. Kilian. A note on efficient zero-knowledge proofs and arguments, Proc. of STOC92.
16. J. Kilian. Near-Optimal Arguments. Manuscript.
17. J. Kilian, S. Micali, and R. Ostrovsky. Minimum Resource Zero-Knowledge Proofs, Proc. of FOCS89.
18. S. Micali. CS Proofs, MIT EECS Colloquium Lecture, 1992, TheoryNet announcement and lecture at the Weizmann Institute Colloquium on Interactive Proof Systems and their Applications to Approximability Theory.
19. S. Micali. Certified letter, P 848 697 589, sent to this author and other researchers.
20. S. Rudich, personal communication via Gilles Brassard.