Skip to main content
SpringerLink
Log in

Reducibility Among Protocols

Extended Abstract

  • Chapter
Advances in Cryptology

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.

This research was supported by NSF-grant MCS 82-04506.

Also supported by IBM Doctoral Fellowship.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Blum, How to Exchange (Secret) Keys“,Proc. 15th ACM STOC (Apr. 1983), 440–447.

    Google Scholar 

  2. M. Blum and M. O. Rabin, “Mail Certification by Randomization”, to appear.

    Google Scholar 

  3. W. Diffie and M. E. Hellman, “Privacy and Authentication: An Introduction to Cryptography”, Proc. IEEE, Vol. 67, No. 3 (March 1979), 397–427.

    Article  Google Scholar 

  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. M. O. Rabin, “Transaction Protection by Beacons”, Harvard Center for Research in Computer Technology, TR-29–81 (1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept., University of California, Berkeley, CA, 94720, USA

    Manuel Blum, Umesh V. Vazirani & Vijay V. Vazirani

Authors
  1. Manuel Blum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Umesh V. Vazirani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vijay V. Vazirani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of California, Santa Barbara, California, USA

    David Chaum

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Plenum Press, New York

About this chapter

Cite this chapter

Blum, M., Vazirani, U.V., Vazirani, V.V. (1984). Reducibility Among Protocols. In: Chaum, D. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-4730-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-4730-9_12

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4684-4732-3

  • Online ISBN: 978-1-4684-4730-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation