Современная криптология - Брассар Ж.
Скачать (прямая ссылка):
[21] BENALOH, J. D., “Cryptographic capsules: A disjunctive primitive for interactive protocols”, Advances in Cryptology — Crypto ’86 Proceedings, August 1986, Springer - Verlag, pp. 213-222.
[22] BENALOH, J. D., Leichter, J., “Generalized secret sharing and monotone functions”, Advances in Cryptology — Crypto ’88 Proceedings, August 1988, Springer - Verlag, pp. 27-35.
[23] Benaloh, J.D., Yung, М., “Distributing the power of a government to enhance the privacy of voters”, Proceedings of 5th ACM Symposium on Principles of Distributed Computing, August 1986, pp. 52-62.
Литература
145
[24] Bengio, S., Brassard, G., Desmedt, Y. G., Goutier, C., Quis-QUATER, JJ., “Secure implementation of identification systems”, Journal of Cryptology, vo\. 4, 1991, pp. 175-183.
[25] Bennett, C.H., Bessette, F., Brassard, G., Salvail, L., > SMOLIN, J., “Experimented quantum cryptography”, Journal of
Cryptology, vol. 5, 1992, pp. 3-28.
[26] Bennett, C.H., Brassard, G., “An update on quantum cryptography”, Advances in Cryptology: Proceedings of Crypto 84, August 1984, Springer -Verlag, pp. 475-480.
[27] Bennett, C.H., Brassard, G., “Quantum cryptography: Public-key distribution and coin tossing”, Proceedings of the International Conference on Computers, Systems and Signal Processing, Bangalore, India, December 1984, pp. 175-179.
[28] Bennett, С. H., Brassard, G., “Quantum public key distribution system”, IBM Technical Disclosure Bulletin, vol. 28, 1985, pp. 3153-3163.
[29] Bennett, С. H. Brassard, G., “The dawn of a new era for quantum cryptography: The experimented prototype is working”, Sigact News, vol. 20, no. 4, 1989, pp. 78-82.
[30] Bennett, С. H., Brassard, G., Breidbart, S., “Quantum cryptography II: How to re-use a one-time pad safely even if V = MV ”, рукопись можно получить у авторов, November 1982.
[31] Bennett, С.Н., Brassard, G., Breidbart, S., Wiesner, S., “Quantum cryptography, or unforgeable subway tokens”, Advances in Cryptology: Proceedings of Crypto 82, August 1982, Plenum Press, pp. 267-275.
[32] Bennett, C.H., Brassard, G., Crepeau, C., Maurer, U.M., “Privacy amplification against probabilistic information”, на этапе подготовки.
[33] Bennett, C.H., Brassard, G., Crepeau, C. Skubiszews-KA, M.-H., “Practiced quantum oblivious transfer”, Advances in Cryptology — Crypto’91 Proceedings, August 1991, Springer -Verlag, pp. 351-366.
[34] Bennett, C.H., Brassard, G. Ekert, A.K., “Quantum cryptography”, Scientific American, October 1992, pp. 50-57.
[35] Bennett, C.H., Brassard, G. Mermin, N. D., “Quantum cryptography without Bell’s theorem”, Physical Review Letters, vol. 68, 3 February 1992, pp. 557-559.
146
Литература
[36] Bennett, С. Н., Brassard, G., Robert, J.-M., “Privacy ampli-i fication by-public discussion”, SIAM Journal on Computing, vol. 17,
.1988, pp. 210-229.'
[37] Ben-Or, М., Goldwasser, S., Kilian, J., Wigderson, A., “Multi-prover interactive proofs: How to remove intractability-assumptions”, Proceedings of 20th ACM Symposium on Theory of Computing, May 1988, pp. 113-131.
[38] Ben-Or, М., Goldwasser,-S., Wigderson, A., “Completeness theorems for -non-cryptographic fault-tolerant distributed computation”, будет опубликована в Journal of Computer and' System Sciences; предварительный вариант в: Proceedings of 20th ACM Symposium on Theory of Computing, May 1988, pp. 1 -10.
[39] Ben-Or, М., Linial, N., “Collective coin flipping”, в: Advances in Computing Research 5: Randomness and Computation, S. Micali (editor), JAI Press, Greenwich, CT, 1989.
[40] Berger, R., Peralta, R., Tedrick, Т., “A provably secure oblivious transfer protocol”, Advances in Cryptology: Proceedings of Eu-rocrypt 84, April 1984, Springer - Verlag, pp. 379 - 386.
[41] Berlekamp, E. R., Algebraic Coding Theory, McGraw-Hill, New York, NY, 1968; переработанное издание: Aegean Park Press, Laguna Hills, CA, 1984; (есть русский перевод первого издания: Э. Берлекэмп, Алгебраическая теория кодирования, М., Мир, 1971).
[42] Berthiaume, A., Brassard, G., “The quantum challenge to structural complexity theory”, Proceedings of 7th Annual IEEE Conference on Structure in Complexity Theory, June 1992, pp. 132-137.»
[43] Вшам, E., Shamir, A., “Differential cryptanalysis of DES-like cryptosystems”, Journal of Cryptology, vol. 4, 1991, pp. 3-72.'
[44] BlHAM, E., SHAMIR, A., “Differential cryptanalysis of the full 16-round DES”, Advances in Cryptology — Crypto ’92 Proceedings, August 1992, Springer - Verlag.
[45] Blake, 1. F., Fuji-Hara, R., Mullins, R. C., Vanstone, S. A., “Computing logarithms in finite fields of characteristic two”, SIAM Journal on Algebraic Discrete Methods, vol. 5, 1984, pp. 276-285.
[46] Blakley, G. R., “Safeguarding cryptographic keys”, Proceedings of AFIPS National Computer Conference, vol. 48, 1979, pp. 313-317.
[47] Blakley, G.R., Borosh, I., “Rivest-Shamir-Adleman public key cryptosystems do not always conceal messages”, Computers & Mathematics with Applications, vol. 5, 1979, pp. 169-178.