Литература

[1] Abadi, М., Feigenbaum, J., Kilian, J., "On hiding information from an oracle". Journal of Computer and System Sciences, vol. 39, 1989, pp. 21-50.

[2] Adleman, L.M., "Implementing an electronic notary public". Advances in Cryptology: Proceedings of Crypto 82, August 1982, Plenum Press, pp. 259-265.

[3] Adleman, L. M., "On breaking genercJized knapsack public key cryptosystems", Proceedings of 15th ACM Symposium on Theory of Computing, April 1983, pp. 402-412.

[4] Agnew, G. в., Beth, Th., Mullin, R. C, Vanstone, S. A., "Arithmetic operations in GF(2")", Journal of Cryptology, на этапе подготовки.

[5] Agnew, ,G. В., Mullin, R. С, Onyszchuk, I.M., Van-stone, S. A., "An implementation for a fast pubUc-key cryptosystem". Journal of Cryptology, vol. 3, 1991, pp. 63-79.

[6] Agnew, G.B., Mullin, R. C, Vanstone, S.A., "A fast elhptic curve cryptosystem", Advances in Cryptology - Eurocrypt 89 Proceedings, April 1989, Springer-Verlag, pp. 706-708.

[7] Ahq, a.v., Hopcroft, J.E., Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974; (есть русский перевод: A. Ахо, Дж. ХопкрОФТ, Дж. Уль-ман, Построение и анализ вычислительных алгоритмов, М., Мир, 1979).

[8] Alexi, W., Chor, B.-Z., Goldreich, С, Schnorr, СР., "RSA cind Rabin fimctions: Certain parts are as hard as the whole", SI AM Journal on Computing, vol. 17, 1988, pp. 194 - 209.

[9] Alpern, В., Schneider, F. В., "Key exchange using keyless cryptography". Information Processing Letters, vol. 16, 1983, pp. 79-81.

[10] Angluin, D., Lichtenstein, D., "Provable security of cryptosys-tems: A survey", технический отчет YALEU/DGS/rrR-288, Department of Computer Science, Yale University, 1983.

[11] Babai, L., Moran, S., "Arthur-Merlin games: A randomized proof system, cind a hiereirchy of complexity classes". Journal of Computer and System Sciences, vol. 36, 1988, pp. 254-276.

[12] Bacon, R., Secret Works of Art and the Nullity of Magic, circa 1250.

[13] Banerjee, S. K., "High speed implementation of DES", Computers and Security, vol. 1, 1982, pp. 261 - 267.

[14] Barany, I., FiJREDI, Z., "Mental poker with three or more players", Information and Control, vol. 59, 1983, pp. 84-93.

[15] ВЕдиснЕМШ, p., Brassard, G., "A generaUzation of Hellmans extension to Shemnoris approach td cryptography", Journal of Cryptology, vol. 1, 1988, pp. 129-131.

[16] Beauchemin, p.. Brassard, G., Crepeau, C, Goutier, C, PoMERANCE, C, "The generation of rcindom numbers that are probably prime". Journal of Cryptology, vol. 1, 1988, pp. 53-64.

[17] Beaver, D., Feigenbaum, J., "Hiding instances in multioracle queries". Proceedings of 7th Symposium on Theoretical Aspects of Computer Science, Februeiry 1990, Springer - Verlag, pp. 37-48.

[18] Bellare, M., Micali, S., "How to sign given any trapdoor permutation". Journal of the ACM, vol. 39, 1992, pp. 214-233.

[19] Bellare, M., Micali, S., Ostrovsky, R., "Perfect zero-knowledge in constant roimds". Proceedings of 22nd ACM Symposium on Theory of Computing, May 1990, pp. 482-493.

[20] Bellare, M., Petrank, E., "Making zero-knowledge provers efficient". Proceedings of 24th ACM Symposium on Theory of Computing, May 1992, pp. 711-722.

[21] Benaloh, J. D,, "Cryptographic capsules: A disjimctive primitive for interactive protocols", Advances in Cryptology - Crypto 86 Proceedings, August 1986, Springer - Verlag, pp. 213-222.

[22] Benaloh, J.D., Leichter, J., "GeneraUzed secret sharing and monotone functions". Advances in Cryptology - Crypto 88 Proceedings, August 1988, Springer-Verlag, pp. 27-35.

[23] Benaloh, J.D., Yung, M., "Distributing the power of a government to enhance the privcicy of voters". Proceedings of 5th ACM Symposium on Principles of Distributed Computing, August 1986, pp. 52-62.