Abstract
Recent progress in the area of cryptography has given rise to strong cryptoalgorithms using complex mathematical systems. These algorithms often require quite sophisticated computing capabilities for their implementation and are designed to withstand attack by equally sophisticated opponents with nearly unlimited resources available to them. However, the mere existence o f such algorithms is not enough to solve the problems of message secrecy and authentication. The procedures for handling the data, including the use of a cryptoalgorithm, must insure that the desired level of security is achieved. Such a set of rules or procedures is known as a cryptographic protocol.
This work performed at Sandia National Laboratories supported by the U. S. Department of Energy under contract no. DE-AC04-76DP00789.
Chapter PDF
Similar content being viewed by others
Keywords
- Protocol Designer
- Sandia National Laboratory
- Cryptographic Protocol
- Decryption Function
- Secret Parameter
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
R. Berger, S. Kannan and R. Peralta, ‘A Framework for the Study of Cryptographic Protocols’, Advances in Cryptology-Proceedings of Crypto 85, pp.87–103.
G.I. Davida, ‘Chosen Signature Cryptanalysis of the RSA (MIT) Public Key Cryptosystem’, Tech. Rep. TR-82-2, Dept. of Electrical Engineering and Computer Science, Univ. Of Wisconsin, Milwaukee, WI, Oct. 1982.
J.M. DeLaurentis, ‘A Further Weakness in the Common Modulus Protocol for the RSA Cryptoalgorithm’ Cryptologia, Vol. 8, No. 3, July 1984, pp. 253–259.
S. Even, O. Goldreich and A. Shamir, ‘On the Security of Ping-Pong Protocols Using the RSA’, Advances in Cryptology-Proceedings of Crypto 85, pp.58–72.
S. Goldwasser, S. Micali and A. Yao, ‘Strong Signature Schemes’, Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp.431–439.
J. Hastad, ‘On Using RSA with Low Exponent in a Public Key Network”, Advances in Cryptology-Proceedings of Crypto 85, pp.403–408.
R.R. Jueneman, S.M. Matyas and C.H. Meyer, ‘Message Authentication with Manipulation Detection Codes’, Proceedings of the 1983 Symposium on Security and Privacy, pp. 33–54.
M. Merritt, Cryptographic Protocols, Ph. O. Thesis, Georgia Institute of Technology, GIT-ICS-83/06, 1983.
J.K. Millen, S.C. Clark and S.B. Freedman, ‘The Interrogator: Protocol Security Analysis’, IEEE Transactions on Software Engineering, Vol. SE-13, No. 2, February 1987, pp.274–288.
G.J. Simmons, ‘A “Weak” Privacy Protocol Using the RSA Cryptoalgorithm’, Cryptologia, Vol. 7, pp. 180–182.
G.J. Simmons and D.B. Holdridge, ‘Forward Search as a Cryptanalytic Tool Against a Public Key Privacy Channel’, Proceedings of the IEEE Computer society 1982 Symposium on Security and Privacy, 1982, pp.117–128.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moore, J.H. (1988). Strong Practical Protocols. In: Pomerance, C. (eds) Advances in Cryptology — CRYPTO ’87. CRYPTO 1987. Lecture Notes in Computer Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48184-2_12
Download citation
DOI: https://doi.org/10.1007/3-540-48184-2_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18796-7
Online ISBN: 978-3-540-48184-3
eBook Packages: Springer Book Archive