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

Lecture notes in computer science

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

Yongge Wang, Yvo Desmedt

Published Jan 1, 1999• 11 citations
Publisher
DOI
10.1007/3-540-48910-x_31

Related papers

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

Yongge Wang, Yvo Desmedt

Journal of Cryptology•Mar 1, 2001•41 citations

Broadcast Channels with Confidential Messages: Channel Uncertainty, Robustness, and Continuity

Rafael F. Schaefer, Andrea Grigorescu, Holger Boche +1 more

Lecture notes in electrical engineering•Sep 24, 2015•0 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

Adaptively Secure Broadcast

Martin Hirt, Vassilis Zikas

Lecture notes in computer science•Jan 1, 2010•62 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

From Partial to Global Asynchronous Broadcast

Diana Ghinea

Broadcast is a fundamental primitive in distributed computing.It allows a sender to consistently distribute a message among n recipients.The seminal result of Pease et al. [JACM'80] shows that in a complete network of synchronous bilateral channels, achieving broadcast is possible if and only if the number of corruptions is bounded by t < n/3.To overcome this bound, Fitzi and Maurer [STOC'00], Considine et al. [JC'05], and Raykov [ICALP'15] strengthen the communication network by assuming partial broadcast channels, which guarantee consistency among a subset of recipients.We extend this line of research to the asynchronous setting.We consider asynchronous broadcast protocols assuming a communication network where each party can broadcast to any subset of b -1 recipients.A natural question is to investigate the trade-off between the size b and the corruption threshold t.We answer this question by showing feasibility and impossibility results:• An asynchronous broadcast protocol Π n,3 BC for b = 3, that is secure up to t < n/2 corruptions.• An asynchronous broadcast protocol Π n,n BC for b = n, that is secure up to t < n -1 corruptions.• An asynchronous broadcast protocol Π n,(b,n) BC I would like to express my deepest gratitude to Dr. Martin Hirt and Chen-Da Liu Zhang for offering me the opportunity to work on such an interesting problem, and for closely supervising every step towards the completion of my thesis.Each result of this work is based on the guidance and motivation they gave me during our countless inspiring discussions filled with enthusiasm.I am extremely grateful to my five-times host at Google, Dr. Holger Brandsmeier, for inspiring and encouraging me to study at ETH, while proposing me unique challenges that helped me push my limits and widen my ambitions.Besides, I thank the whole team for creating an enjoyable work environment, especially last summer, when I mixed work with the exams session.I want to thank my mother, Carmen Mincȃ, and my grandmother, Ana Mincȃ, for raising me to follow my dreams

•Jan 1, 2020•0 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.
Broadcast is a fundamental primitive in distributed computing.It allows a sender to consistently distribute a message among n recipients.The seminal result of Pease et al. [JACM'80] shows that in a complete network of synchronous bilateral channels, achieving broadcast is possible if and only if the number of corruptions is bounded by t < n/3.To overcome this bound, Fitzi and Maurer [STOC'00], Considine et al. [JC'05], and Raykov [ICALP'15] strengthen the communication network by assuming partial broadcast channels, which guarantee consistency among a subset of recipients.We extend this line of research to the asynchronous setting.We consider asynchronous broadcast protocols assuming a communication network where each party can broadcast to any subset of b -1 recipients.A natural question is to investigate the trade-off between the size b and the corruption threshold t.We answer this question by showing feasibility and impossibility results:• An asynchronous broadcast protocol Π n,3 BC for b = 3, that is secure up to t < n/2 corruptions.• An asynchronous broadcast protocol Π n,n BC for b = n, that is secure up to t < n -1 corruptions.• An asynchronous broadcast protocol Π n,(b,n) BC I would like to express my deepest gratitude to Dr. Martin Hirt and Chen-Da Liu Zhang for offering me the opportunity to work on such an interesting problem, and for closely supervising every step towards the completion of my thesis.Each result of this work is based on the guidance and motivation they gave me during our countless inspiring discussions filled with enthusiasm.I am extremely grateful to my five-times host at Google, Dr. Holger Brandsmeier, for inspiring and encouraging me to study at ETH, while proposing me unique challenges that helped me push my limits and widen my ambitions.Besides, I thank the whole team for creating an enjoyable work environment, especially last summer, when I mixed work with the exams session.I want to thank my mother, Carmen Mincȃ, and my grandmother, Ana Mincȃ, for raising me to follow my dreams