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

104107 371 d coppersmith the real reason for rivests

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: cience, 1980, pp. 380–386. 233. G. Brassard, “A Time–Luck Tradeoff in Relativized Cryptography,” Journal of Computer and System Sciences, v. 22, n. 3, Jun 1981, pp. 280–311. 234. G. Brassard, “An Optimally Secure Relativized Cryptosystem,” SIGACT News, v. 15, n. 1, 1983, pp. 28–33. 235. G. Brassard, “Relativized Cryptography,” IEEE Transactions on Information Theory, v. IT–29, n. 6, Nov 1983, pp. 877–894. 236. G. Brassard, Modern Cryptology: A Tutorial, Springer–Verlag, 1988. 237. G. Brassard, “Quantum Cryptography: A Bibliography,” SIGACT News, v. 24, n. 3, Oct 1993, pp. 16–20. 238. G. Brassard, D. Chaum, and C. Crépeau, “An Introduction to Minimum Disclosure,” CWI Quarterly, v. 1, 1988, pp. 3–17. 239. G. Brassard, D. Chaum, and C. Crépeau, “Minimum Disclosure Proofs of Knowledge,” Journal of Computer and System Sciences, v. 37, n. 2, Oct 1988, pp. 156–189. 240. G. Brassard and C. Crépeau, “Non–Transitive Transfer of Confidence: A Perfect Zero–Knowledge Interactive Protocol for SAT and Beyond,” Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 188–195. 241. G. Brassard and C. Crépeau, “Zero–Knowledge Simulation of Boolean Circuits,” Advances in Cryptology—CRYPTO ’86 Proceedings, Springer–Verlag, 1987, pp. 223–233. 242. G. Brassard and C. Crépeau, “Sorting Out Zero–Knowledge,” Advances in Cryptology—EUROCRYPT ’89 Proceedings, Springer–Verlag, 1990, pp. 181–191. 243. G. Brassard and C. Crépeau, “Quantum Bit Commitment and Coin Tossing Protocols,” Advances in Cryptology—CRYPTO ’90 Proceedings, Springer–Verlag, 1991, pp. 49–61. 244. G. Brassard, C. Crépeau, R. Jozsa, and D. Langlois, “A Quantum Bit Commitment Scheme Provably Unbreakable by Both Parties,” Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 362–371. 245. G. Brassard, C. Crépeau, and J.–M. Robert, “Information Theoretic Reductions...
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