Verifiable secret sharing and multiparty protocols in distributed systems

In this paper, we propose verifiable secret sharing and multiparty protocols in a distributed system under the assumption that each participant can broadcast a message to all other participants and that each pair of participants can communicate secretly. The secrecy achieved is unconditional and does not rely on any assumption about computational intractability. Applications of these results to the Byzantine Agreement are also presented. The proposed protocol satisfies the fairness under a non-cryptographic model for the first time. The conventional non-cryptographic protocols don't satisfy the fairness. Also, the proposed protocol is more efficient than Beaver's protocol and Rabin's protocol.