|
|
Библиография |
|
- Jean-Jacques, Myriam, Muriel and Michael Quisquater; Louis, Marie Annick, Gaid, Anna, Gwenole and Soazing Guillou in collaboration with Tom Berson for the English version, "How to Explain Zero-Knowledge Protocols to Your Children", Advances in Gryptology CRYPTO'89 Proceedings, Springer-Verlag, 1990, pp.628-631
- Bruse Schneier, Applied Cryptography, Second edition: Protocols, Algorthms and Source Code in C, Wiley Computer Publishing, John Wiley & Sons, Inc.,1996,666p., - P.95-96
- Запечников С.В. Криптографические протоколы и их применение в финансовой и коммерческой деятельности: Учебное пособие для вузов. - М.: Горячая линия - Телеком, 2007. - 320с. - С.28-29
- S.Goldwasser, S.Micali and C.Rackoff. The Knowledge Complexity of Interactive Proof System. In Proceeding of 17th ACM Symposium on the Theory of Computing, pages 291-304, 1985
- S.Goldwasser, S.Micali and C.Rackoff. The Knowledge Complexity of Interactive Proof System. SIAM Journal on Computing, Vol.18, pages 186-208, 1989
- M.Blum, "Coin Flipping by Telephone: A Protocol for Solving Impossible Problems", Proceedings of the 24th IEEE Computer Conference (CompCon), 1982, pp. 133-137.
- M.Blum, "Coin flipping by telephone -- A protocol for solving impossible problems," ACM SIGACT News, vol. 15, no. 1, pp. 23-27, Dec. 1983.
- M.Blum, "How to exchange (secret) keys," ACM Trans. Computer Systems, vol. 1, no. 2, pp. 175-193, May 1983.
- M.Blum, "How to Prove a Theorem So No One Else Can Claim It, " Proceedings of the International Congress of Mathematicians, Berkeley, CA, 1986, pp. 1444—1451
- O.Goldreich Foundations of cryptography. Basic tools. Cambridge University Press, 2004
- O.Goldreich Foundations of cryptography II. Basic applications. Cambridge University Press, 2004
- O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. Journal of the ACM, Vol. 38, No. 1, pages 691–729, 1991. (Preliminary version in 27th IEEE Symposium on Foundations of Computer Science, 1986.)
- O.Goldreich, S.Micali, A.Wigderson. How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (extended abstract). In A.M. Odlyzko,editor,Advances in Cryptology|CRYPTO'86, volume 263 of Lecture Notes in Computer Science, pages 171-185. Springer-Verlag, 1987, 11-15 August 1986
- Венбо Мао. Современная криптография. Теория и практика = Modern Cryptography: Theory and Practice. — М.: Вильямс, 2005. — 768 с.
- Schnorr C.P. Efficient Identification and Signatures for Smart Cards. Advances in Cryptology - Crypto '89. Lecture Notes in Computer Science, Vol.435, Springer Verlag, pp.235-251, 1990.
- Schnorr C.P. Efficient Signature Generation by Smart Cards. Journal of Cryptology, Vol.4, pp.161-174, 1991.
|
|
Copyright OspanovRM © 2025 |
|
|
|
Статистика |
|
|
Онлайн всего: 1 Гостей: 1 Пользователей: 0 |
|
|