Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Cryptology

Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question

Yongge Wang, Yvo Desmedt

Published Mar 1, 2001• 41 citations
Publisher
DOI
10.1007/s00145-001-0002-y

Related papers

Secure Communication in Broadcast Channels: The Answer to Franklin and Wright’s Question

Yongge Wang, Yvo Desmedt

Lecture notes in computer science•Jan 1, 1999•11 citations

Perfectly Secure Message Transmission Revisited

Yvo Desmedt, Yongge Wang

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.

arXiv:cs/0208041•Aug 26, 2002•0 citations

Secure wireless multicasting with linear equalization

Dilip Kumar Sarker, M. Z. I. Sarkar, Md. Shamim Anower

Physical Communication•Aug 4, 2017•16 citations

Perfectly Secure Message Transmission Revisited (Extended Abstract)

Yvo Desmedt, Yongge Wang

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 channel (such as Ethernet), one pro- cessor 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.

•Jan 1, 2002•1 citation

Multicast Network Security with Asymmetric Cooperative Relaying

Dilip Kumar Sarker, Md. Zahurul I. Sarkar, Md. Shamim Anower +1 more

International Journal of Wireless Information Networks•Jun 14, 2022•5 citations

A Cooperative Transmission Scheme for the Secure Wireless Multicasting

Peng Xu, Xiaodong Xu

Wireless Personal Communications•Dec 23, 2013•2 citations
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.
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 channel (such as Ethernet), one pro- cessor 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.