A Framework for the Study of Cryptographic Protocols

  • Richard Berger
  • Sampath Kannan
  • René Peralta
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 218)


We develop a simple model of computation under which to study the meaning of cryptographic protocol and security. We define a protocol as a mathematical object and security as a possible property of this object. Having formalized the concept of a secure protocol we study its general properties. We back up our contention that the model is reasonable by solving some well known cryptography problems within the framework of the model.


Secure Protocol Cryptographic Protocol Quadratic Residue Oblivious Transfer Secure Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    M. Blum, Coin Flipping by Telephone, Proc. IEEE COMPCON, 1982, 133–137.Google Scholar
  2. 2.
    M. Luby, S. Micali and C. Rackoff, How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin., 24th. IEEE Annual Symp. on Foundations of Computer Science, 1983, 11.Google Scholar
  3. 3.
    T. Tedrick, How to Exchange Half a Bit, Proceedings of Crypto 83, N.Y., 1984, 147.Google Scholar
  4. 4.
    S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, 17th. Annual ACM Symp. on Theory of Computing, 1985.Google Scholar
  5. 5.
    M. Fischer, S. Micali and C. Rackoff, A Secure Protocol for the Oblivious Transfer, Proceedings of Eurocrypt 84., 1984.Google Scholar
  6. 6.
    R. Berger, R. Peralta and T. Tedrick, A Provably Secure Oblivious Transfer, Dept. EECS, Univ. of California, Berkeley, Calif., 1983.Google Scholar
  7. 7.
    M. Blum, How to Exchange Secret Keys, ACM Transactions on Computer Systems 1,2 (May 1983), 175–193.CrossRefGoogle Scholar
  8. 8.
    M. Blum, Three Applications of the Oblivious Transfer: 1. Coin Flipping by Telephone, 2. How to Exchange Secrets, 3. How to Send Certified Electronic Mail, Dept. EECS, Univ. of California, Berkeley, Calif., 1981.Google Scholar
  9. 9.
    S. Even, O. Goldreich and A. Lempel, A Randomized Protocol for Signing Contracts, Technical Report #233, February 1982.Google Scholar
  10. 10.
    S. Fortune and M. Merritt, Poker Protocols, Crypto 84, 1984.Google Scholar
  11. 11.
    M. Yung, Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game., Crypto 84, 1984.Google Scholar
  12. 12.
    L. Blum, M. Blum and M. Shub, A Simple Secure Pseudo-Random Number Generator, CRYPTO 82, 1982.Google Scholar
  13. 13.
    S. Goldwasser and M. Blum, An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information., Crypto 84, 1984.Google Scholar
  14. 14.
    M. Blum, A Potential Danger with Low-Exponent Modular Encryption Schemes: Avoid Encrypting Exactly the Same Message to Several People., U.C. Berkeley Computer Science Department, 1984.Google Scholar
  15. 15.
    J. Hastad, On Using RSA with Low Exponent in a Public Key Network., MIT Computer Science Department, 1984.Google Scholar
  16. 16.
    D. Dolev, S. Even and R. Karp, On The Security Of Ping-Pong Protocols, Proceedings of Crypto 82, 1982.Google Scholar
  17. 17.
    D. Dolev and A. Yao, On The Security Of Public Key Protocols, IEEE Transactions on Information Theory. IT-30 (March 1983), 198.CrossRefMathSciNetGoogle Scholar
  18. 18.
    M. Merritt, Cryptographic Protocols, Ph.D Thesis. Georgia Institute of Technology, GIT-ICS-83/06. 1983.Google Scholar
  19. 19.
    M. Merritt and P. Wolper, States of Knowledge in Cryptographic Protocols., Unpublished Manuscript.,.Google Scholar
  20. 20.
    L. Adleman, Private Communication through M. Blum., 1983.Google Scholar
  21. 21.
    K. Chung, A Course in Probability Theory, Academic Press, London, 1974.zbMATHGoogle Scholar
  22. 22.
    R. Peralta and T. Tedrick, The Probabilistic Channel, In preparation, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Richard Berger
    • 1
  • Sampath Kannan
    • 1
  • René Peralta
    • 1
  1. 1.Computer Science DivisionUniversity of CaliforniaBerkeley

Personalised recommendations