Cryptology ePrint Archive: Report 2002/128
Perfectly Secure Message Transmission Revisited
Yvo Desmedt and Yongge Wang
Abstract: 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.
Category / Keywords: cryptographic protocols / network security, privacy, reliability, network connectivity
Date: received 24 Aug 2002
Contact author: yonwang at uncc edu
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20020826:172639 (All versions of this report)
Short URL: ia.cr/2002/128
[ Cryptology ePrint archive ]