Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds

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

Volumn 372 LNCS, Issue , 1989, Pages 123-136

  Brassard, Gilles ^a   Crépeau, Claude ^b   Yung, Moti ^c  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY;

DISCRETE LOGARITHMS; HIGH SECURITIES; INTERACTIVE PROTOCOLS; ONE-WAY GROUP HOMOMORPHISMS; PERFECT ZERO-KNOWLEDGE;

AUTOMATA THEORY;

EID: 84957656166     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0035756     Document Type: Conference Paper

References (19)

1. Benaloh, J. C., “Cryptographic capsules: A disjunctive primitive for interactive protocols”, Advances in Cryptology - CRYPTO ’86 Proceedings, Springer-Verlag, 1987, pp. 213-222.
2. Boyar, J. F., Krentel, M. W. and Kurtz, S. A., “A discrete logarithm implementation of zero-knowledge blobs”, Journal of Cryptology, to appear.
3. Brassard, G., Chaum, D. and Crépeau, C., “Minimum disclosure proofs of knowledge”, Journal of Computer and System Sciences, vol. 37, no. 2, 1988, pp.156-189.
4. Brassard, G. and Crépeau, C., “Zero-knowledge simulation of Boolean circuits”, Advances in Cryptology- CRYPTO ’86 Proceedings, Springer-Verlag, 1987, pp.224-233.
5. Brassard, G. and Crépeau, C., “Non-transitive transfer of confidence: A perfect zeroknowledge interactive protocol for SAT and beyond”, Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp.188-195.
6. Brassard, G. and Crépeau, C., “Sorting out zero-knowledge”, Advances in Cryptology - EUROCRYPT ’89 Proceedings, Springer-Verlag, to appear.
7. Chaum, D., “Demonstrating that a public predicate can be satisfied without revealing any information about how”, Advances in Cryptology - CRYPTO ’86 Proceedings, SpringerVerlag, 1987, pp.195-199.
8. Chaum, D., Damgaard, I. B. and van de Graaf, J., “Multiparty computations ensuring privacy of each party’s input and correctness of the result”, Advances in Cryptology - CRYPTO ’87 Proceedings, Springer-Verlag, 1988, pp. 87-119.
9. Chaum, D., Evertse, J.-H. and van de Graaf, J., “An improved protocol for demonstrating possession of discrete logarithms and some generalizations”, Advances in Cryptology - EUROCRYPT ’87 Proceedings, Springer-Verlag, 1988, pp.127-141.
10. Chaum, D., Evertse, J.-H., van de Graaf, J. and Peralta, R., “Demonstrating possession of a discrete logarithm without revealing it”, Advances in Cryptology - CRYPTO ’86 Proceedings, Springer-Verlag, 1987, pp.200-212.
11. Feige, U., Fiat, A. and Shamir, A., “Zero knowledge proofs of identity”, Journal of Cryptology, vol.1, no. 2, 1988, pp. 77-94.
12. Feige, U. and Shamir, A., “Zero knowledge proofs of knowledge in two rounds”, submitted to CRYPTO ’89, March 1989.
13. Fortnow, L., “The complexity of perfect zero-knowledge”, Proceedings of the 19th ACM Symposium on Theory of Computing, 1987, pp. 204-209.
14. Goldreich, O., personal communication.
15. Goldreich, O., Micali, S. and Wigderson, A., “Proofs that yield nothing but their validity and a methodology of cryptographic protocol design”, Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp.174-187.
16. Goldwasser, S., Micali, S. and Rackoff, C., “The knowledge complexity of interactive proof systems”, SIAM Journal on Computing, vol. 18, no.1, 1989, pp.186-208.
17. Impagliazw, R. and Yung, M., “Direct minimum-knowledge computations”, Advances in Cryptology- CRYPTO ’87 Proceedings, Springer-Verlag, 1988, pp.40-51.
18. Pohlig, S. and Hellman, M. E., “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance”, IEEE Transactions on Information Theory, vol.IT-24, 1978, pp.106-110.
19. Shannon, C. E., “A mathematical theory of communications”, Bell System Technical Journal, vol. 27, 1948, pp. 379-423 and 623-656.