Perfectly secure message transmission revisited.
In: Knudsen, L, (ed.)
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2002, PROCEEDINGS.
(pp. 502 - 517).
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.
|Title:||Perfectly secure message transmission revisited|
|Event:||International Conference on the Theory and Applications of Cryptographic Techniques|
|Dates:||2002-04-28 - 2002-05-02|
|Keywords:||network security, privacy, reliability, network connectivity, COMMUNICATION, SECRETS, CODES|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science
UCL > School of BEAMS > Faculty of Engineering Science > Computer Science
Archive Staff Only