1. 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
  2. Bruse Schneier, Applied Cryptography, Second edition: Protocols, Algorthms and Source Code in C, Wiley Computer Publishing, John Wiley & Sons, Inc.,1996,666p.
  3. Запечников С.В. Криптографические протоколы и их применение в финансовой и коммерческой деятельности: Учебное пособие для вузов. - М.: Горячая линия - Телеком, 2007. - 320с.
  4. 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
  5. S.Goldwasser, S.Micali and C.Rackoff. The Knowledge Complexity of Interactive Proof System. SIAM Journal on Computing, Vol.18, pages 186-208, 1989
  6. M.Blum, "Coin Flipping by Telephone: A Protocol for Solving Impossible Problems", Proceedings of the 24th IEEE Computer Conference (CompCon), 1982, pp. 133-137.
  7. M.Blum, "Coin flipping by telephone -- A protocol for solving impossible problems," ACM SIGACT News, vol. 15, no. 1, pp. 23-27, Dec. 1983.
  8. M.Blum, "How to exchange (secret) keys," ACM Trans. Computer Systems, vol. 1, no. 2, pp. 175-193, May 1983.
  9. 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
  10. O.Goldreich Foundations of cryptography. Basic tools. Cambridge University Press, 2004
  11. O.Goldreich Foundations of cryptography II. Basic applications. Cambridge University Press, 2004
  12. 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.)
  13. 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
  14. Венбо Мао. Современная криптография. Теория и практика = Modern Cryptography: Theory and Practice. — М.: Вильямс, 2005. — 768 с.
  15. 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.
  16. Schnorr C.P. Efficient Signature Generation by Smart Cards. Journal of Cryptology, Vol.4, pp.161-174, 1991.
  17. Ященко В.В. (ред.) Введение в криптографию. М.: МЦНМО: «ЧеРо», 1999. - 272 с. 2-е изд., испр.
  18. Погорелов Б.А., Сачков В.Н.(ред.) Словарь криптографических терминов. - М.: Издательство МЦНМО, 2006. - 94c.
  19. Tal Moran, Moni Naor, Gil Segev, An Optimally Fair Coin Toss, Cryptology ePrint Archive: Report 2009/214. - 21p.
  20. Варновский Н.П. Курс лекций по математической криптографии. - 2009 - С.71-72.
  21. Steven Fortune and Michael Merritt. Poker protocols. Advances in Cryptology - CRYPT0 ’84, LNCS 196, pp. 454-464, 1985.
  22. M.Naor Bit Commitment Using Pseudo-Randomness (Extended Abstract). Advances in Cryptology - CRYPT0‘89, LNCS 435, pp. 128-136, 1990.
  23. Lamport L., Shostak R., Pease M. The Byzantine generals problem. ACM Transactionson ProgrammingLanguagesand Systems,Vol.4, No. 3, July 1982,Pages 382-401.
  24. Shamir A., Rivest R., Adleman L. Mental poker // The Mathematical Gardner. - 1981. - P. 37-43.
  25. Goldwasser S., Micali S. Probabilistic Encryption and How To Play Mental Poker Keeping Secret All Partial Information // Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC '82). - 1982. - P. 365-377.
  26. Tatsuaki Okamoto, Kazuo Ohta How to Simultaneously Exchange Secrets by General Assumptions. Proceedings of the 2nd ACM Conference on Computer and Communications Security, Fairfax, Virginia, USA, November 2-4, 1994.; 01/1994 pp. 184-192
  27. Саломаа А. Криптография с открытым ключом: Пер. с англ. - М.: Мир, 1995. - 318с.,ил. - С.237-238
  28. W. Diffie and M. E. Hellman, New Directions in Cryptography, IEEE Transactions on Information Theory, vol. IT-22, Nov. 1976, pp: 644–654.
  29. P.Zimmermann, A.Johnston, J.Callas. ZRTP: Media Path Key Agreement for Unicast Secure RTP. – Internet Engineering Task Force, Request for Comments (RFC) 6189bis, November 2012.
  30. National Institute of Standards and Technology, The Keyed-Hash Message Authentication Code (HMAC), Federal Information Processing Standards Publication 198-1, July 2008.
  31. Stewart, R. Stream Control Transmission Protocol. – Internet Engineering Task Force, Request for Comments (RFC) 4960, September 2007