Issue No. 07 - July (2000 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.877748
<p><b>Abstract</b>—<it>Independence</it> is a fundamental property needed to achieve security in fault-tolerant distributed computing. In practice, distributed communication networks are neither fully synchronous or fully asynchronous, but rather <it>loosely synchronized</it>. By this, we mean that in a communication protocol, messages at a given round may depend on messages from other players at the same round.</p><p>These possible dependencies among messages create problems if we need <tmath>$n$</tmath> players to announce independently chosen values. This task is called <it>simultaneous broadcast</it>. In this paper, we present the first <it>constant</it> round protocol for simultaneous broadcast in a reasonable computation model (which includes a common shared random string among the players). The protocol is provably secure under general cryptographic assumptions. In the process, we develop a new and stronger formal definition for this problem. Previously known protocols for this task required either <tmath>$O(\log n)$</tmath> or expected constant rounds to complete (depending on the computation model considered).</p>
Independence, computation model, communication networks, simultaneous broadcast, and Verifiable Secret Sharing (VSS) protocols.
R. Gennaro, "A Protocol to Achieve Independence in Constant Rounds," in IEEE Transactions on Parallel & Distributed Systems, vol. 11, no. , pp. 636-647, 2000.