Reducibility Among Protocols

Extended Abstract
  • Manuel Blum
  • Umesh V. Vazirani
  • Vijay V. Vazirani

Abstract

Recently considerable attention has been given to designing provably secure cryptographic protocols. Three basic problems that have been studied are: exchange of secrets, contract signing, and certified mail. Several protocols have been proposed for these problems. These solutions are very diverse in nature: they are secure under different assumptions, have different probabilities of cheating, and require different number of message exchanges. Consequently, there is a need to investigate the underlying relationships between these problems. In this paper, we study reducibilities among these problems, i.e. how a protocol for one problem can be transformed into a protocol for another problem, preserving (roughly) the operating conditions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Blum, How to Exchange (Secret) Keys“,Proc. 15th ACM STOC (Apr. 1983), 440–447.Google Scholar
  2. [2]
    M. Blum and M. O. Rabin, “Mail Certification by Randomization”, to appear.Google Scholar
  3. [3]
    W. Diffie and M. E. Hellman, “Privacy and Authentication: An Introduction to Cryptography”, Proc. IEEE, Vol. 67, No. 3 (March 1979), 397–427.CrossRefGoogle Scholar
  4. [4]
    S. Even, O. Goldreich, and A. Lempel, “A Randomized Protocol for Signing Contracts”, Tech. Report #233, The Technion, Israel (Feb. 1982), 11 pp.Google Scholar
  5. [5]
    M. O. Rabin, “Transaction Protection by Beacons”, Harvard Center for Research in Computer Technology, TR-29–81 (1981).Google Scholar

Copyright information

© Plenum Press, New York 1984

Authors and Affiliations

  • Manuel Blum
    • 1
  • Umesh V. Vazirani
    • 1
  • Vijay V. Vazirani
    • 1
  1. 1.Computer Science Dept.University of CaliforniaBerkeleyUSA

Personalised recommendations