Abstract
The design of cryptographic protocols using trapdoor and one-way functions has received considerable attention in the past few years [1–8]. More recently, attention has been paid to provide rigorous correctness proofs based on simple mathematical assumptions, for example, in coin flipping (Blum [1]), mental poker (Goldwasser and Micali [4]). It is perhaps reasonable to speculate at this time that all cryptographic protocols can eventually be designed to be provably secure under simple assumptions, such as factoring large numbers or inverting RSA functions are computationally intractable in the appropriate sense.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Blum, “Coin flipping by telephone,” Proc. of IEEE, Spring CoanpCon 1982, 133–137.
R. DeMillo, N. Lynch, and M. Merritt, “Cryptographic protocols,” Proc. 14th Ann. ACM Symp. on Th. of Comp, San Francisco, California, May 1982, 383–400.
W. Diflìe and M. E. Hellman, “New directions in cryptography” IEEE Trans. on Inform. Th 22 (1976), 644–654.
S. Goldwasser and S. Micali, “Probabilistic encryption and how to play mental poker keeping secret all partial information,” Proc. 14th Ann. ACM Symp. on Theory of Computing,May 1982, San Francisco, California, 365–377.
S. Goldwasser, S. Micali, and P. Tong, “I-low to dstablish a private code on a public network,” Proc. 23rd Ann. IEEE’ Symp. on Found. of Comp. Sci, Oct. 1982, Chicago, Illinois.
M. Rabin, “Digitalized signatures and public-key functions as intractable as factorization,” it Mff/LCS/TR-212, MIT Technical Memo, 1979.
M. Rabin, “Digitalized signatures,” in Foundations of Secure Computations, edited by R. DeMillo, D. Dobkin, A. Joncs, and R. Lipton, Academic Press, 1978, 155–168.
R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public key cryptosystems,” Comm. ACM 21 (1978), 120–126.
A. Shamir, “On the generation of cryptographically strong pseudo-random sequences,” ICALP 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this paper
Cite this paper
Goldwasser, S., Micali, S., Yao, A. (1983). On Signatures and Authentication. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-0602-4_20
Download citation
DOI: https://doi.org/10.1007/978-1-4757-0602-4_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-0604-8
Online ISBN: 978-1-4757-0602-4
eBook Packages: Springer Book Archive