Perfectly Secure Message Transmission

Danny Dolev; Cynthia Dwork; Orli Waarts; Moti Yung

Perfectly Secure Message Transmission

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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 Scopus citations

Abstract

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

Original language	English
Title of host publication	Proceedings - 31st Annual Symposium on Foundations of Computer Science, FOCS 1990
Publisher	IEEE Computer Society
Pages	36-45
Number of pages	10
ISBN (Print)	081862082X
State	Published - 1990
Externally published	Yes
Event	31st Annual Symposium on Foundations of Computer Science, FOCS 1990 - St. Louis, MO, USA, United States Duration: 22 Oct 1990 → 24 Oct 1990

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)	0272-5428

Conference

Conference	31st Annual Symposium on Foundations of Computer Science, FOCS 1990
Country/Territory	United States
City	St. Louis, MO, USA
Period	22/10/90 → 24/10/90

Bibliographical note

Publisher Copyright:
©1990 IEEE.

Cite this

@inproceedings{8a94455f2fef4a108f3a3e1f56030715,

title = "Perfectly Secure Message Transmission",

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

author = "Danny Dolev and Cynthia Dwork and Orli Waarts and Moti Yung",

note = "Publisher Copyright: {\textcopyright}1990 IEEE.; 31st Annual Symposium on Foundations of Computer Science, FOCS 1990 ; Conference date: 22-10-1990 Through 24-10-1990",

year = "1990",

language = "אנגלית",

isbn = "081862082X",

series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

publisher = "IEEE Computer Society",

pages = "36--45",

booktitle = "Proceedings - 31st Annual Symposium on Foundations of Computer Science, FOCS 1990",

address = "ארצות הברית",

}

Dolev, D, Dwork, C, Waarts, O & Yung, M 1990, Perfectly Secure Message Transmission. in Proceedings - 31st Annual Symposium on Foundations of Computer Science, FOCS 1990. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, IEEE Computer Society, pp. 36-45, 31st Annual Symposium on Foundations of Computer Science, FOCS 1990, St. Louis, MO, USA, United States, 22/10/90.

Perfectly Secure Message Transmission. / Dolev, Danny; Dwork, Cynthia; Waarts, Orli et al.
Proceedings - 31st Annual Symposium on Foundations of Computer Science, FOCS 1990. IEEE Computer Society, 1990. p. 36-45 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Perfectly Secure Message Transmission

AU - Dolev, Danny

AU - Dwork, Cynthia

AU - Waarts, Orli

AU - Yung, Moti

PY - 1990

Y1 - 1990

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

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

UR - https://www.scopus.com/pages/publications/105032061572

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:105032061572

SN - 081862082X

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 36

EP - 45

BT - Proceedings - 31st Annual Symposium on Foundations of Computer Science, FOCS 1990

PB - IEEE Computer Society

T2 - 31st Annual Symposium on Foundations of Computer Science, FOCS 1990

Y2 - 22 October 1990 through 24 October 1990

ER -

Perfectly Secure Message Transmission

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this