Skip to main content
SpringerLink
Log in

Reliable communication over partially authenticated networks

  • Contributed Papers
  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1320))

Included in the following conference series:

Abstract

Reliable communication between parties in a network is a basic requirement for executing any protocol. In this work, we consider the effect on reliable communication when some pairs of parties have common authentication keys. The pairs sharing keys define a natural “authentication graph”, which may be quite different from the “communication graph” of the network. We characterize when reliable communication is possible in terms of these two graphs, focusing on the very strong setting of a Byzantine adversary with unlimited computational resources.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computations. In 20th STOC, pp. 1–10, 1988.

    Google Scholar 

  2. J. Carter and M. Wegman. Universal classes of hash functions. J. of Computer and System Sciences, 18:143–154, 1979.

    Article  Google Scholar 

  3. D. Chaum, C. Crepau, and I. Damgard. Multiparty unconditionally secure protocols. In Proc. of the 20th STOC, pages 11–19, 1988.

    Google Scholar 

  4. D. Dolev. The Byzantine generals strike again. J. of Algorithms, 3:14–30, 1982.

    Article  Google Scholar 

  5. D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. J. of the ACM, 40(1):17–47, 1993.

    Article  Google Scholar 

  6. K. Menger. Allgemeinen kurventheorie. Fund. Math., 10:96–115, 1927.

    Google Scholar 

  7. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. of the 20st STOC, pages 73–85, 1989.

    Google Scholar 

  8. G. J. Simmons. A survey of information authentication. In G. J. Simmons, editor, Contemporary Cryptology, The Science of Information Integrity, pages 441–497. IEEE Press, 1992.

    Google Scholar 

  9. M. Wegman and J. Carter. New hash functions and their use in authentication and set equality. J. of Computer and System Sciences, 22:265–279, 1981.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIMACS, Rutgers University, Piscataway, NJ

    Amos Beimell

  2. AT&T Labs - Research, Florham Park, NJ

    Matthew Franklin

Authors
  1. Amos Beimell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthew Franklin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marios Mavronicolas Philippas Tsigas

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beimell, A., Franklin, M. (1997). Reliable communication over partially authenticated networks. In: Mavronicolas, M., Tsigas, P. (eds) Distributed Algorithms. WDAG 1997. Lecture Notes in Computer Science, vol 1320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030688

Download citation

  • DOI: https://doi.org/10.1007/BFb0030688

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63575-8

  • Online ISBN: 978-3-540-69600-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation