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.
Part of the work was done when this author was with Certicom Corp.
Chapter PDF
References
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computing. In: Proc. ACM STOC,’ 88, pages 1–10, ACM Press, 1988.
D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditional secure protocols. In: Proc. ACM STOC’ 88, pages 11–19, ACM Press, 1988.
D. Dolev. The Byzantine generals strike again. J. of Algorithms, 3:14–30, 1982.
D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. J. of the ACM, 40(1):17–47, 1993.
L.R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
M. Franklin and R. Wright. Secure communication in minimal connectivity models. Journal of Cryptology, 13(1):9–30, 2000.
M. Franklin and M. Yung. Secure hypergraphs: privacy from partial broadcast. In: Proc. ACM STOC’ 95, pages 36–44, ACM Press, 1995.
E. Gilbert, F. MacWilliams, and N. Sloane. Codes which detect deception. The BELL System Technical Journal, 53(3):405–424, 1974.
O. Goldreich, S. Goldwasser, and N. Linial. Fault-tolerant computation in the full information model. SIAM J. Comput. 27(2):506–544, 1998.
V. Hadzilacos. Issues of Fault Tolerance in Concurrent Computations. PhD thesis, Harvard University, Cambridge, MA, 1984.
F. J. MacWilliams and N. J. A. Sloane. The theory of error-correcting codes. North-Holland Publishing Company, 1978.
R. J. McEliece and D. V. Sarwate. On sharing secrets and Reed-Solomon codes. Comm. ACM, 24(9):583–584, September 1981.
T. Rabin. Robust sharing of secrets when the dealer is honest or faulty. J. of the ACM, 41(6):1089–1109, 1994.
T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. ACM STOC’ 89, pages 73–85, ACM Press, 1989.
Y. Wang and Y. Desmedt. Secure communication in multicast channels: the answer to Franklin and Wright’s question. J. of Cryptology, 14(2):121–135, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Desmedt, Y., Wang, Y. (2002). Perfectly Secure Message Transmission Revisited. In: Knudsen, L.R. (eds) Advances in Cryptology — EUROCRYPT 2002. EUROCRYPT 2002. Lecture Notes in Computer Science, vol 2332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46035-7_33
Download citation
DOI: https://doi.org/10.1007/3-540-46035-7_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43553-2
Online ISBN: 978-3-540-46035-0
eBook Packages: Springer Book Archive