On Expected Constant-Round Protocols for Byzantine Agreement

When designing cryptographic protocols, it is often convenient to abstract away various details of the underlying communication network. As one noteworthy example, it is often convenient to assume the existence of a broadcast channel which allows any party to send the same message to all other parties (and all parties to be assured they have received identical messages) in a single round. With limited exceptions (e.g., in a small-scale wireless network or when a semi-trusted third party can be assumed), it is understood that the protocol will be run in a network where only point-to-point communication is available and the parties will have to "Emulate" the broadcast channel by running a broadcast protocol.

Provided by: University of Maryland Topic: Networking Date Added: Jan 2011 Format: PDF

Find By Topic