Secure communication in minimal connectivity models

  • Matthew Franklin
  • Rebecca N. Wright
Conference paper

DOI: 10.1007/BFb0054138

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1403)
Cite this paper as:
Franklin M., Wright R.N. (1998) Secure communication in minimal connectivity models. In: Nyberg K. (eds) Advances in Cryptology — EUROCRYPT'98. EUROCRYPT 1998. Lecture Notes in Computer Science, vol 1403. Springer, Berlin, Heidelberg

Abstract

Problems of secure communication and computation have been studied extensively in network models. In this work, we ask what is possible in the information-theoretic setting when the adversary is very strong (Byzantine) and the network connectivity is very low (minimum needed for crash-tolerance). For some natural models, our results imply a sizable gap between the connectivity required for perfect security and for probabilistic security. Our results also have implications to the commonly studied simple channel model and to general secure multiparty computation.

Download to read the full conference paper text

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Matthew Franklin
    • 1
  • Rebecca N. Wright
    • 1
  1. 1.AT&T Labs ResearchFlorham ParkUSA

Personalised recommendations