Abstract
The Security of the RSA implementation of ping-pong protocols is considered. It is shown that the obvious RSA properties, such as “multiplicativity”, do not endanger the security of ping-pong protocols. Namely, if a ping-pong protocol is secure in general then its implementation using an “ideal RSA” is also secure.
Supported in part by a Weizmann Postdoctoral Fellowship.
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
Awerbuch B., Chor B., Goldwasser S., and Micali S., “Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults”, Proc. of the 24th IEEE Symp. on Foundation of Computer Science.
Ben-Or, M., Goldreich, O., Micali, S., and Rivest, R.L., “A Fair Protocol for Signing Contracts”, Proc. of the 12th ICALP, Lecture Note in Computer Science (194) Springer Verlag, 1985, pp. 43–52.
Church, A., and Rosser, J.B., “Some Properties of Conversion”, Trans. Amer. Math. Soc. 39, (1936), pp. 472–482.
Cohen J.D., and Fischer, M.J., “A Robust and Verifiable Cryptographically Secure Election Scheme”, Proc. of the 24th IEEE Symp. on Foundation of Computer Science
Davida G.I., “Chosen Signature Cryptoanalysis of the RSA (MIT) Public Key Cryptosystem”, Tech. Rep. TR-CS-82-2, Dept. of Electrical Engineering and Computer Science, Univ. of Wisconsin, Milwaukee, WI, Oct. 1982.
Denning D.E., “Digital Signatures with RSA and Other Public-Key Cryptosystems”, Comm. of the ACM, Vol. 27, April 1984, pp. 388–392.
DeMillo, R., Lynch, N., and Merritt, M., “Cryptographic Protocols”, Proc. of the 14th ACM Symp. on Theory of Computation, 1982, pp. 383–400.
Diffie, W., and Hellman, M.E., “New Directions in Cryptography”, IEEE Trans. on Inform. Theory, Vol. IT-22, No. 6, November 1976, pp. 644–654.
Dolev, D., Even, S., and Karp, R.M., “On the Security of Ping-Pong Protocols”, Inform. and Control, Vol. 55, 1982, pp. 57–68.
Dolev, D., and Yao, A.C., “On the Security of Public-Key Protocols”, IEEE Trans. on Inform. Theory, Vol. IT-29, 1983, pp. 198–208.
Even, S., “On the Complexity of Some Word Problems that Arise in Testing the Security of Protocols”, presented in NATO Advanced Research Workshop on Combinatorial Algorithms on Words, Maratea, Italy, June 1984.
Even, S., and Goldreich, O., “On the Security of Multi-Party Ping-Pong Protocols”, Proc. of the 24th IEEE Symp. on Foundation of Computer Science, 1983, pp. 34–39.
Even, S., Goldreich, O., and Lempel, A., “A Randomized Protocol for Signing Contracts”, Comm. of the ACM, Vol. 28, No. 6, pp. 637–647, 1985.
Galil Z., Haber S., and Yung M., “A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems”, Proc. of the 24th IEEE Symp. on Foundation of Computer Science
Goldwasser, S., Micali, S., and Rackoff, C., “The Knowledge Complexity of Interactive Proof Systems”, Proc. of the 17th ACM Symp. on Theory of Computation, 1985, pp. 291–304.
Luby, M., Micali, S., and Rackoff, C., “How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin”, Proc. of the 24th IEEE Symp. on Foundation of Computer Science, 1983, pp. 11–21.
Needham, R.M., and Schroeder, M.D., “Using Encryption for Authentication in Large Networks of Computers”, Comm. of the ACM, Vol. 21, No. 12, 1978, pp. 993–999.
Rivest, R.L., Shamir, A., and Adleman, L., “A Method for Obtaining Digital Signatures and Public Key Cryptosystems”, Comm. of the ACM, Vol. 21, February 1978, pp. 120–126.
Rosen, B.K., “Tree-Manipulation Systems and Church-Rosser Theorems”, Jour. of the ACM, Vol. 20, No. 1, January 1973, pp. 160–187.
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
Even, S., Goldreich, O., Shamir, A. (1986). On the Security of Ping-Pong Protocols when Implemented using the RSA (Extended Abstract). 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_7
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_7
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