Perfectly secure message transmission

Danny Dolev*, Cynthia Dwork, Orli Waarts, Moti Yung

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

15 Scopus citations

Abstract

The problem of perfectly secure communication in a general network in which processors and communication lines may be faulty is studied. Lower bounds are obtained on the connectivity required for successful secure communication. Efficient algorithms that operate with this connectivity and rely on no complexity theoretic assumptions are derived. These are the first algorithms for secure communication in a general network to achieve simultaneously the goals of perfect secrecy, perfect resiliency, and worst case time linear in the diameter of the network.

Original languageEnglish
Pages (from-to)36-45
Number of pages10
JournalIEEE Transactions on Industry Applications
Volume27
Issue number1 pt 1
StatePublished - Jan 1991
Externally publishedYes
Event1989 Industry Applications Society Annual Meeting - San Diego, CA, USA
Duration: 1 Oct 19895 Oct 1989

Fingerprint

Dive into the research topics of 'Perfectly secure message transmission'. Together they form a unique fingerprint.

Cite this