Improved efficient arguments: Preliminary version

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

Volumn 963, Issue , 1995, Pages 311-324

  Kilian, Joe ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CORRECTION;

COMMUNICATION COMPLEXITY; DISCRETE LOGARITHMS; ERROR CORRECTION CAPABILITY; HYBRID CONSTRUCTION; PERFECT ZERO-KNOWLEDGE; SECURITY PARAMETERS; SUPER-POLYNOMIALS; ZERO KNOWLEDGE;

CRYPTOGRAPHY;

EID: 84957654400     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44750-4_25     Document Type: Conference Paper

References (29)

1. S. Arora and S. Safra. Probabilistic Checking of Proofs, Proceedings of STOC 1992.
2. S. Arora and T. Leighton and B. Maggs. On-line algorithms for path selection in a nonblocking network. Proceedings of STOC 1990, pp. 149-158
3. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Hardness of Approximation Problems, Proceedings of STOC 1992.
4. G. Brassard, D. Chaum, and C. Crépeau. Minimum Disclosure Proofs of Knowledge, J. Comput. System Sci. 37 (1988), 156-189.
5. L. Babai, L. Fortnow, and C. Lund. Non-Deterministic Exponential Time has Two-Prover Interactive Proofs, Proceedings of FOCS 1990
6. L. Babai, L. Fortnow, L. Levin and M. Szegedy. Checking computation in poly- logarithmic time. Proceedings of STOC 1991.
7. th STOC, 1998, pp. 294-804
8. M. Bellare, P. Rogaway. Random Oracles are Practical: A paradigm for Designing Efficient Protocols, Proc. First ACM Conference on Computer and Communications Security, ACM, November 1993.
9. I. Damgård, Non-inter active Circuit Based Proofs and Non-Interactive Perfect Zero-Knowledge with Preprocessing, Advances in Cryptology - EUROCRYPT 92, pp. 341-355.
10. C. Dwork, U. Feige, J. Kilian, M. Naor and S. Safra. Low communication 2-Prover Zero-Knowledge Proofe for NP. Advances in Cryptology - Crypto '92, pp. 215-227.
11. n
12. nd Annual Symposium on Foundations of Computer Science, 1991, pp. 2-12.
13. 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, pp. 308-317
14. C. Bennett, personal communication via Gilles Brassard.
15. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-Prover Interactive Proofs: How to Remove Intractability, Proceedings of STOC 1988.
16. De Santis, A., S. Micali and G. Persiano, "Bounded-Interaction Zero-Knowledge proofs," Advances in Cryptology - Crypto '88
17. U. Feige, S. Goldwasser, L. Lovász, S. Safra and M. Szegedy. Approximating clique is almost NP-Complete. Proceedings of FOCS 1991, pp. 2-12.
18. L. Fortnow, J. Rompel, and M. Sipser. On the Power of Multi-Prover Interactive Protocols, Proceedings of Structure 1988.
19. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solution to Identification and Signature Problems. Advances in Cryptology - Crypto '86, pp. 186-189.
20. S. Goldwasser, S. Micali, and C. RackofF. The Knowledge Complexity of Interactive Proof Systems, SIAM J. Comput. 18 (1989), 186-208.
21. J. Kilian. A note on efficient zero-knowledge proofs and arguments, Proceedings of STOC 1992.
22. J. Kilian On the complexity of bounded interaction and noninteractive proofs. Proceedings of FOCS 1994.
23. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. The polynomial-time hierarchy has interactive proofs, Proceedings of STOC 1990, pp. 2-10.
24. R. Merkle. A Certified Digital Signature. Proceedings of Crypto '89, pp. 218-238.
25. S. Micali. Computationally Sound Proofs, Proceedings of FOCS 1994
26. M. Naor, R. Ostrovsky, R. Venkatesan and M. Yung. Perfect Zero-Knowledge Arguments for NP can be Based on General Complexity Assumptions. Advances in Cryptology Crypto '92, pp. 196-214.
27. A. Polishchuk and D. Spielman. Nearly-linear Size Holographic Proofs. Proceedings of STOC 1994
28. S. Rudich, Personal communication via Gilles Brassard.
29. A. Shamir. IP - PSPACE, Proceedings of FOCS 1990, IEEE.