On Signatures and Authentication

  • S. Goldwasser
  • S. Micali
  • A. Yao
Conference paper

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.

Keywords

Signature Scheme Signed Message Cryptographic Protocol Boolean Circuit Message Space 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Blum, “Coin flipping by telephone,” Proc. of IEEE, Spring CoanpCon 1982, 133–137.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    W. Diflìe and M. E. Hellman, “New directions in cryptography” IEEE Trans. on Inform. Th 22 (1976), 644–654.CrossRefGoogle Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    M. Rabin, “Digitalized signatures and public-key functions as intractable as factorization,” it Mff/LCS/TR-212, MIT Technical Memo, 1979.Google Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public key cryptosystems,” Comm. ACM 21 (1978), 120–126.CrossRefGoogle Scholar
  9. [9]
    A. Shamir, “On the generation of cryptographically strong pseudo-random sequences,” ICALP 1981.Google Scholar

Copyright information

© Springer Science+Business Media New York 1983

Authors and Affiliations

  • S. Goldwasser
    • 1
  • S. Micali
    • 1
  • A. Yao
    • 1
  1. 1.Computer Science DivisionUniversity of CaliforniaBerkeleyUSA

Personalised recommendations