From partial consistency to global broadcast

From partial consistency to global broadcast
复制标题

从部分一致性到全局广播

DOI:
--
复制
发表时间:
2000
期刊:
Symposium on the Theory of Computing
影响因子:
--
通讯作者:
U. Maurer
U. Maurer
中科院分区:
--
文献类型:
--
作者:
Matthias Fitzi;U. Maurer

文献摘要

被引文献

相似文献

This paper considers unconditionally secure protocols for reliable broadcast among a set of players, some of which may be corrupted by an active (Byzantine) adversary. In the standard model with a complete, synchronous network of pairwise authentic communication channels among the players, broadcast is achievable if and only if the number of corrupted players is less than . We show that, by extending this model only by the existence of a broadcast channel among three players, global broadcast is achievable if and only if the number of corrupted players is less than . Moreover, for this an even weaker primitive than broadcast among three players is sufficient. All protocols are efficient.