Advertisement
Published in:
2005 | OriginalPaper | Chapter
A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback
Authors : Yvo Desmedt, Yongge Wang, Mike Burmester
Published in: Algorithms and Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Problems of unconditionally secure communication have been studied extensively in network models. Dolev-Dwork-Waarts-Yung considered the Byzantine threats model, in which the adversary can only take over a number of nodes bounded by a threshold. They studied two cases:
1
all communication links (edges in the graph) are two-way communication,
2
all communication links are one-way communication, and there is no feedback.
The node sets that the adversary can take over was generalized by Hirt-Maurer to an adversary structure. At PODC 2002, Kumar-Goundan-Srinathan-Rangan generalized Dolev-Dwork-Waarts-Yung’s first scenario to the case of a general adversary structure. In this paper we generalize Dolev-Dwork-Waarts-Yung’s second scenario to the case of a general adversary structure. As in Dolev-Dwork-Waarts-Yung, our work relies on the use of secret sharing.