[60] BoYAR, J. F., Brassard, G. Peralta, R., "Subquadratic zero-, knov/ledge", Proceedings of 32nd IEEE Symposium on Foundations of Computer Science, October 1991, pp. 69-78.

[61] Boyar, J.F., Chaum, D., Damgard, I. В., Pedersen, Т., "Convertible imdeniable signatures". Advances in Cryptology - Crypto 90 Proceedings, August 1990, Springer - Verlag, pp. 189-205.

[62] BoYAR, J. F., Krentel, M.W., Kurtz, S.A., "A discrete logarithm implementation of perfect zero-knowledge blobs". Journal of Cryptology, vol. 2, 1990, pp. 63-76.

[63] BoYAR, J.F., Lund, C, Peralta, R., "On the communication complexity of zero-knowledge proofs". Journal of Cryptology, в процессе подготовки; предварительная версия в: Advances in Cryptology - Crypto89 Proceedings, August 1989, Springer-Verlag, pp. 507-525.

[64] Brassard, G., "A note on the complexity of cryptography", IEEE Transactions on Information Theory, vol. IT-25, 1979, pp. 232-233.

[65] Brassard, G., "A time-luck tradeoff in relativized cryptography". Journal of Computer and System Sciences, vol. 22, 1981, pp. 280-311.

[66] Brassard, G., "An optiitiadly seau-e relativized cryptosystem". Advances in Cryptography, a Report on Crypto 81, технический отчет no. 82-04, Department of ECE, University of California, Santa Barbara, CA, 1982, pp. 54-58; перепечатано в: Sigact News, vol. 15, no. 1, 1983, pp. 28-33.

[67] Brassard, G., "Computationally secure authentication tags requiring short secret shared keys". Advances in Cryptology: Proceedings of Crypto 82, August 1982, Plenum Press, pp. 79-86.

[68] Brassard, G., "Relativized cryptography", IEEE Transactions on Information Theory, vol. IT-29, 1983, pp. 877-894.

[69] Brassard, G., "Cryptology in academia: A ten year retrospective". Proceedings of 29th IEEE Computer Conference (CompCon), 1987, pp. 222-226.

[70] Brassard, G., "Cryptology", Encyclopcedia of Mathematics, D. Reidel Pubhshing Company, Dordrecht, Pays-Bas.

[71] Brassard, G., Modern Cryptology, Springer - Verlag, Lecture Notes in Computer Science, vol. 325, 1988. Рецензия на русеком языке: Вбтчинин М. П., «Современная криптология: рецензия на книгу Brassard, G., "Modern Crypto/ogy"», Новые книги за рубеоюом, 1994, № 9(сентябрь), стр. 30-34.

[72] Brassard, G., "How to improve signature schemes". Advances in Cryptology - Eurocrypt 89 Proceedings, April 1989, Springer -Verlag, pp. 16-22.

[73] Brassard, G., "Cryptology column - Hot news on interactive protocols", Sigact News, vol. 21, no. 1, 1990, pp. 7-11.

[74] Brassard, G., "Cryptology column - Hiding information from oracles", Sigact News, vol. 21, no. 2, 1990, pp. 5-11.

[75] Brassard, G., "Cryptology column - How convincing is уош- protocol?", Sigact News, vol. 22, no. 1, 1991, pp. 5-12.

[76] Brassard, G. Bratley, P., Algorithmique: conception et analyse, Massori, Paris, 1987.

[77] Brassard, G., Bratley, P., Algorithmics: Theory and Practice, Prentice-HaU, Englewood Chffs, NJ, 1988.

[78] Brassard, G., Chaum, D., Crepeau, C, "Minimum disclosure proofs of knowledge". Journal of Computer and System Sciences, vol. 37, 1988, pp. 156-189.

[79] Brassard, G. Crepeau, C, "Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT cind beyond". Proceedings, of 27th IEEE Sympasumon Foundations of Computer Science, October 1986, pp. 188-195.

[80] Brassard, G. Crepeau, C, "Sorting out zero-knowledge". Advances in Cryptology - Eurocrypt 89 Proceedings, April 1989, Springer - Verlag, pp. 181-191.

[81] Brassard, G. Crepeau, C, "Quantum bit commitment and coin tossing protocols". Advances in Cryptology - Crypto90 Proceedings, August 1990, Springer - Verlag, pp. 49 - 61.

[82] Brassard, G., Crepeau, C, Laplante, S., Leger, C, "Computationally convincing proofs of knowledge", Proceedings of 8th Symposium on Theoretical Aspects of Computer Science, February 1991, Springer - Verlag, pp. 251 - 262.

[83] Brassard, G., Crepeau, C, Robert, J.-M., "All-or-nothing disclosure of secrets". Advances in Cryptology - Crypto86 Proceedings, August 1986, Springer-Verlag, pp. 234-238.

[84] Brassard, G., Crepeau, C, Robert, J.-M., "Information theoretic reductions £imong disclosure problems". Proceedings of 27th IEEE Symposium on Foundations of Computer Science, October 1986, pp. 168-173.

[85] Brassakd, G,, Crepeau, С. Yhng, M., "Constant-round perfect zero-knowledge computati<HiaUy ccmvincing protocols". Theoretical Computer Science, vol. 84, 1991, pp. 23-52.

[86] Brassard, G., Monet, S., Zuffeixato, D., "Algorithmes pour rarithmetique des tres grands entiers", TSI: Technique et Science Informatigues, vol. 5, 1986, pp. 89-102.

[87] Brassard, G. Yung, M., "One-way group actions". Advances in Cryptology - Crypto 90 Proceedings, August 1990, Springer -Verlag, pp. 94-107.

[88] ВШСКШХ, E. F., "Solving low density knapsacks", Advances in Cryptology: Proceedings of Crypto 83, August 1983, Pleniun Press, pp. 25-37.

[89] ВшскЕЬЬ, E. F., "Breaking iterated knapsacks", Advances in Cryptology: Proceedings of Crypto 84, August 1984, Springer - Verlag, pp. 342 - 358.

[90] Brickell, E. F., "The cryptanalysis of knapseick cryptosystems", в: Applications of Discrete Mathematics, R.D. Ringeisen, F.S. Roberts (editors), SIAM, Philaddphia, PA, 1988, pp. 3-23.

[91] Brickell, E. F., "A survey of hardware implementations of RSA", Advances in Cryptology - Crypto 89 Proceeding, August 1989, Springer-Verlag, pp. 368 - 370.

[92] Brickell, E. P., Davenport, D. M., "On the classification of ideal secret sharing schemes", Journal of Cryptology, vol. 4, 1991, pp. 123-134.

[93] Brickell, E.P., Odlyzko, A.M., "Cryptanalysis: A survey of recent results", в: [333], 1992, pp. 501-540; (есть русский перевод журнальной версии в: ТИИЭР, т. 76(1988), №5, стр. 75-94).

[94] Burmester, М. V. D., Desmedt, Y. G., "Remarks on the soundness of proofs". Electronics Letters, vol. 25, 26 October 1989, pp. 1509-1511.

[95] Carroll, J. M., Computer Security, Butterworth Publishers, Stoneham, MA, 1987.

[96] Carroll, J. M., Robbins, L. E., "The automated cryptanalysis of polyalphabetic dphers", Crypologia, \ol. XI, 1987, pp. 193-205.

[97] Cahholl, j. M., RoBBDiS, L. E., "Computer cryptanalysis of product ciphers", Cryptologia, vol. ХШ, 1989, pp. 303 -326.