Perfectly Secure Message Transmission Revisited
| dc.creator | Desmedt, Yvo | |
| dc.creator | Wang, Yongge | |
| dc.date | 2002-08-26 | |
| dc.date.accessioned | 2026-07-07T03:18:50Z | |
| dc.date.available | 2026-07-07T03:18:50Z | |
| dc.description | Achieving secure communications in networks has been one of the most important problems in information technology. Dolev, Dwork, Waarts, and Yung have studied secure message transmission in one-way or two-way channels. They only consider the case when all channels are two-way or all channels are one-way. Goldreich, Goldwasser, and Linial, Franklin and Yung, Franklin and Wright, and Wang and Desmedt have studied secure communication and secure computation in multi-recipient (multicast) models. In a ``multicast channel'' (such as Ethernet), one processor can send the same message--simultaneously and privately--to a fixed subset of processors. In this paper, we shall study necessary and sufficient conditions for achieving secure communications against active adversaries in mixed one-way and two-way channels. We also discuss multicast channels and neighbor network channels. | |
| dc.identifier | https://arxiv.org/abs/cs/0208041 | |
| dc.identifier | http://arxiv.org/abs/cs/0208041 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31276 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Computational Complexity | |
| dc.subject | C.2.2; E.1; E.3; E.4; F.1; F.2.3; H.1.1; H.2.0 | |
| dc.title | Perfectly Secure Message Transmission Revisited | |
| dc.type | text |