NON-TRANSITIVE TRANSFER OF CONFIDENCE: A PERFECT ZERO-KNOWLEDGE INTERACTIVE PROTOCOL FOR SAT AND BEYOND.

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1986, Pages 188-195

  Brassard, Gilles ^a   Crepeau, Claude ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS - PROTOCOLS; INFORMATION THEORY; PROBABILITY - GAME THEORY;

NON-TRANSITIVE TRANSFER OF CONFIDENCE; ZERO-KNOWLEDGE INTERACTIVE PROTOCOL (ZKIP);

CRYPTOGRAPHY;

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

References (20)

1. L. Adleman Reducibility, randomness and intractability Proceedings of the 9th Annual ACM Symposium on the Theory of Computing 151 163 Proceedings of the 9th Annual ACM Symposium on the Theory of Computing 1977
2. L. Babai Trading group theory for randomness Proceedings of the 17th Annual ACM Symposium on the Theory of Computing 421 429 Proceedings of the 17th Annual ACM Symposium on the Theory of Computing 1985
3. J. D. Benaloh (Cohen) Cryptographic capsules: a disjunctive primitive for interactive protocols CRYPTO 86 CRYPTO 86 1986
4. M. Ben-Or private communication 1986
5. G. Brassard C. Crépeau Zero-knowledge simulation of Boolean circuits CRYPTO 86 CRYPTO 86 1986
6. D. Chaum Demonstrating that a public predicate can be satisfied without revealing any information about how CRYPTO 86 CRYPTO 86 1986
7. J. D. Cohen M. J. Fischer A robust and verifiable cryptographically secure election scheme Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science 372 382 Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science 1985
8. Z. Galil S. Haber M. Yung A private interactive test of a Boolean predicate and minimum-knowledge public-key cryptosystems Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science 360 371 Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science 1985
9. J. Gill Computational complexity of probabilistic Turing machines SIAM Journal on Computing 6 4 675 695 December 1977
10. O. Goldreich S. Micali A. Wigderson Proofs that yield nothing but the validity of the assertion and the methodology of cryptographic protocol design these Proceedings of the 27th Annual IEEE Symposium on the Foundations of Computer Science these Proceedings of the 27th Annual IEEE Symposium on the Foundations of Computer Science 1986
11. S. Goldwasser J. Kilian A provably correct and probably fast primality test Proceedings of the 18th Annual ACM Symposium on the Theory of Computing 316 329 Proceedings of the 18th Annual ACM Symposium on the Theory of Computing 1986
12. S. Goldwasser S. Micali C. Rackoff The knowledge complexity of interactive proof-systems Proceedings of the 17th Annual ACM Symposium on the Theory of Computing 291 304 Proceedings of the 17th Annual ACM Symposium on the Theory of Computing 1985
13. S. Goldwasser M. Sipser Arthur-Merlin games versus interactive proof systems Proceedings of the 18th Annual ACM Symposium on the Theory of Computing 59 68 Proceedings of the 18th Annual ACM Symposium on the Theory of Computing 1986
14. R. Impagliazzo private communication 1986
15. C. H. Papadimitriou Games against nature Journal of Computer and System Sciences 31 288 301 1985
16. V. Pratt Every prime has a succinct certificate SIAM J. on Computing 4 214 220 1975
17. M. O. Rabin Algorithms and Their Complexity: Recent Results and New Directions 21 39 1976 Academic Press NY, New York Probabilistic algorithms
18. M. O. Rabin Digitalized signatures and public-key functions as intractable as factorization 1979 MITILCS/TR-22
19. R. Solovay V. Strassen A fast Monte Carlo test for primality SIAM Journal on Computing 6 84 85 1977