Abstract
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.
Research sponsored in part by GTE fellowship.
Research sponsored by the Helen and George Pardee Fellowship
Reaeuch sponsored in part by NSF grant MCS-82-04506 and by Universidad Católica de Chile.
Chapter PDF
Keywords
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.
References
M. Blum, Coin Flipping by Telephone, Proc. IEEE COMPCON, 1982, 133–137.
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.
T. Tedrick, How to Exchange Half a Bit, Proceedings of Crypto 83, N.Y., 1984, 147.
S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, 17th. Annual ACM Symp. on Theory of Computing, 1985.
M. Fischer, S. Micali and C. Rackoff, A Secure Protocol for the Oblivious Transfer, Proceedings of Eurocrypt 84., 1984.
R. Berger, R. Peralta and T. Tedrick, A Provably Secure Oblivious Transfer, Dept. EECS, Univ. of California, Berkeley, Calif., 1983.
M. Blum, How to Exchange Secret Keys, ACM Transactions on Computer Systems 1,2 (May 1983), 175–193.
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.
S. Even, O. Goldreich and A. Lempel, A Randomized Protocol for Signing Contracts, Technical Report #233, February 1982.
S. Fortune and M. Merritt, Poker Protocols, Crypto 84, 1984.
M. Yung, Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game., Crypto 84, 1984.
L. Blum, M. Blum and M. Shub, A Simple Secure Pseudo-Random Number Generator, CRYPTO 82, 1982.
S. Goldwasser and M. Blum, An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information., Crypto 84, 1984.
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.
J. Hastad, On Using RSA with Low Exponent in a Public Key Network., MIT Computer Science Department, 1984.
D. Dolev, S. Even and R. Karp, On The Security Of Ping-Pong Protocols, Proceedings of Crypto 82, 1982.
D. Dolev and A. Yao, On The Security Of Public Key Protocols, IEEE Transactions on Information Theory. IT-30 (March 1983), 198.
M. Merritt, Cryptographic Protocols, Ph.D Thesis. Georgia Institute of Technology, GIT-ICS-83/06. 1983.
M. Merritt and P. Wolper, States of Knowledge in Cryptographic Protocols., Unpublished Manuscript.,.
L. Adleman, Private Communication through M. Blum., 1983.
K. Chung, A Course in Probability Theory, Academic Press, London, 1974.
R. Peralta and T. Tedrick, The Probabilistic Channel, In preparation, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berger, R., Kannan, S., Peralta, R. (1986). A Framework for the Study of Cryptographic Protocols. In: Williams, H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39799-X_9
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16463-0
Online ISBN: 978-3-540-39799-1
eBook Packages: Springer Book Archive