applied cryptography - protocols, algorithms, and source code in c

783 a jiwa j seberry and y zheng beacon based

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: es, and Programming, Springer–Verlag, 1990, pp. 268–282. 617. O. Goldreich and E. Kushilevitz, “A Perfect Zero–Knowledge Proof for a Problem Equivalent to Discrete Logarithm,” Advances in Cryptology—CRYPTO ’88 Proceedings, Springer–Verlag, 1990, pp. 58–70. 618. O. Goldreich and E. Kushilevitz, “A Perfect Zero–Knowledge Proof for a Problem Equivalent to Discrete Logarithm,” Journal of Cryptology, v. 6, n. 2, 1993, pp. 97–116. 619. O. Goldreich, S. Micali, and A. Wigderson, “Proofs That Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design,” Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science, 1986, pp. 174–187. 620. O. Goldreich, S. Micali, and A. Wigderson, “How to Prove All NP Statements in Zero Knowledge and a Methodology of Cryptographic Protocol Design,” Advances in Cryptology—CRYPTO ’86 Proceedings, Springer–Verlag, 1987, pp. 171–185. 621. O. Goldreich, S. Micali, and A. Wigderson, “How to Play Any Mental Game,” Proceedings of the 19th ACM Symposium on the Theory of Computing, 1987, pp. 218–229. 622. O. Goldreich, S. Micali, and A. Wigderson, “Proofs That Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design,” Journal of the ACM, v. 38, n. 1, Jul 1991, pp. 691–729. 623. S. Goldwasser and J. Kilian, “Almost All Primes Can Be Quickly Certified,” Proceedings of the 18th ACM Symposium on the Theory of Computing, 1986, pp. 316– 329. 624. S. Goldwasser and S. Micali, “Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information,” Proceedings of the 14th ACM Symposium on the Theory of Computing, 1982, pp. 270–299. 625. S. Goldwasser and S. Micali, “Probabilistic Encryption,” Journal of Computer and System Sciences, v. 28, n. 2, Apr 1984, pp. 270–299. 626. S. Goldwasser, S. Micali, and C. Rackoff, “The Knowledge Complexity of Interactive Proof Systems,” Proceedings of the 17th ACM...
View Full Document

This note was uploaded on 10/18/2010 for the course MATH CS 301 taught by Professor Aliulger during the Fall '10 term at Koç University.

Ask a homework question - tutors are online