[98] Carter, J. L., Wegman, M.N., "Universal classes of hash functions". Journal of Computer and System Sciences, vol. 18, 1979, pp. 143-154. ...

[99] Ceillier, R., La cryptographie. Que sais-je?, vol. 116 (sic!). Presses Universitcures de Frcince, Pms, 1945.

[100] Chaum, D., "Untreiceable electronic meiil, return ciddresses cind digital pseudonyms". Communications of the ACM, vol. 24, 1981, pp. 84-88.

[101] Chaum, D., "Seciuity without identification: Trcmsaction system to make Big Brother obsolete". Communications of the ACM, vol. 28, 1985, pp. 1030-1044.

[102] Chaum, D., "Showing credentiab without identification: Signatures transferred between imconditionally unlinkable pseudonyms". Advances in Cryptology - Eurocrypt85 Proceedings, April 1985, Springer-Verlag, pp. 241-244.

[103] Chaum, D., "Demonstrating that a pubhc predicate Ccin be satisfied without reveciling ciny information about how". Advances in Cryptology - Crypto 86 Proceedings, August 1986, Springer - Verlag, pp. 195-199.

[104] Chaum, D., "The dining cryptographers problem: Unconditional sender and recipient imtrciceability". Journal of Cryptology, vol. 1, 1988, pp. 65-75.

[105] Chaum, D., "Onhne cash checks". Advances in Cryptology - Eurocrypt89 Proceedings, April 1989, Springer - Verlag, pp. 288-293.

[106] Chaum, D., "The spymasters double-agent problem: Multiparty computation secure imconditionally from minorities and cryptographically from majorities". Advances in Cryptology - Crypto 89 Proceedings, August 1989, Springer - Verlag, pp. 591-602.

[107] Chaum, D., "Zero-knowledge imdeniable signatures". Advances in Cryptology - Eurocrypt 90 Proceedings, May 1990, Springer -Verlag, pp. 458-464.

[108] Chaum, D., "Some wecJmesses of WecJmesses of imdeniable signatures". Advances in Cryptology - Eurocrypt91 Proceedings, April 1991, Springer - Verlag, pp. 554-556.

[109] Chaum, D., van Antwerpen, H., "Undeniable signatures". Advances in Cryptology - Crypto 89 Proceedings, August 1989, Springer-Verlag, pp. 212-216.

[110] Chaum, D., den Boer, В., van Heyst, E., Mj0lsnes, S., Steen-• beek, A., "Efficient offline electronic checks". Advances in Cryptology - Eurocrypt 89 Proceedings, April 1989, Springer - Verlag, pp. 294-301.

[Ill] Chaum, D., Crepeau, C, Damgard, 1.В., "Multiparty unconditionally secure protocols". Proceedings of 20th ACM Symposium on Theory of Computing, May 1988, pp. 11-19.

[112] Chaum, D., Damgard, I. В., vande Graaf, J., "Multiparty computations ensuring privacy of each partys input cmd correctness of the result". Advances in Cryptology - Crypto 87 Proceedings, August 1987, Springer-Verlag, pp. 87-119.

[113] Chaum, D., Evertse, J.-H., "Cryptanalysis of DES with a reduced number of roimds". Advances in Cryptology - Crypto 85 Proceedings, August 1985, Springer-Verlag, pp. 192-211.

[114] Chaum, D., Evertse, J.-H., van de Graaf, J., Peralta, R., "Demonstrating possession of a discrete logarithm without revealing it". Advances in Cryptology - Crypto 86 Proceedings, August 1986, Springer-Verlag, pp. 200-212.

[115] Chaum, D., Fiat, A., Naor, M., "Untraceable electronic cash". Advances in Cryptology - Crypto 88 Proceedings, August 1988, Springer-Verlag, pp. 319-327.

[116] Chaum, D., SchauMULLER-Bilch, 1. (editors). Smart Card 2000, NorrilHolland, Amsterdam, Pays-Bas, 1988.

[117] Chor, B.-Z., Two Issues in Public Key Cryptography, ACM Distinguished Doctoral Dissertation Series, MIT Press, Cambridge, MA, 1986.

[118] Chor, B.-Z., Goldreich, O., Hastad, J., Freidmann, J., Rudich, S., Smolensky, R., "The bit extraction problem or t-resihent fimctions", Proceedings of 26th IEEE Symposium on Foundations of Computer Science, October 1985, pp. 396-407.

[119] Cohen (Benaloh), J. D., Fisher, M., "A robust and verifiable cryptographically secure election scheme", Proceedings of 26th IEEE Symposium on Foundations of Computer Science, October 1985, pp. 372-382.

[120] Cook, S.A., "The complexity of theorem proving proce-dvu-es", Proceedings of 3rd ACM Symposium on Theory of Computing, May 1971, pp. 151-158; (есть русский перевод в: Кибернетический сборник, нов. сер., вып. 12, М., Мир, 1975, стр. 5-15).

[121] Coppersmith, D., "Cheating at mental poker". Advances in Cryptology - Crypto85 Proceedings, August 1985, Springer - Verlag, pp. 104-107.

[122] Coppersmith, D., "Cryptography", IBM Journal of Research and •Development, vol. 31, 1987, pp. 244 - 248.

[123] Coppersmith, D., "DES designed to withstand differential crypt-einalysis", Internet, Newsgroup sci.crypt, 23 March 1992.

[124] Coppersmith, D., Odlyzko, A.M., Schroeppel, R., "Discrete logarithms in GF(p)", Algorithmica, vol. 1, 1986, pp. 1-15.

[125] CouvREUR, C, Quisquater, J.-J., "An introduction to fast generation of large prime numbers", Philips Journal of Research, vol. 37, 1982, pp. 231-264; errata в: ibid, vol. 38, 1983, p. 77.

[126] Crepeau, C, "A secure poker protocol that minimizes the effect of player cocilitions", Advances in Cryptology - Crypto 85 Proceedings, August 1985, Springer-Verlag, pp. 73-86.

[127] Crepeau, C, "A zero-knowledge poker protocol that achieves con-fidentiahty of the players strategy, or How to achieve cin electronic poker face", Advances in Cryptology - Crypto 86 Proceedings, August 1986, Springer-Verlag, pp. 239-247.

[128] Crepeau, C, "Equivalence between two flavovus of obhvious trcmsfers", Advances in Cryptology - Crypto 87 Proceedings, August 1987, Springer - Verlag, pp. 350-354.

[129] Crepeau, C, "Verifiable disclosure of secrets and apphcation". Advances in Cryptology - Eurocrypt 89 Proceedings, April 1989, Springer - Verlag, pp. 150-154.

[130] Crepeau, C, Correct and Private Reductions among Oblivious Transfers, these de doctorat. Department of Electric£il Engineering and Computer Science, Massachusetts Institute of Technology, February 1990.

[131] Crepeau, C, Santha, M., "Efficient reduction among oblivious transfer protocols based on new self-intersecting codes", Proceedings of Sequences 91: Methods in Communication, Security and Computer Science, Jime 1991, Springer - Verlag.

[132] CsiszAR, I., KoRNER, J., "Broadcast channels with confidential messages", IEEE Transactions on Information Theory, vol. IT-24, 1978, pp. 339 - 348.