Our ABA protocol is built on a new statistical asynchronous verifiable secret sharing (AVSS) protocol with optimal resilience. Our AVSS protocol significantly improves the communication complexity of the only known statistical and optimally-resilient AVSS protocol of Canetti et al. Our AVSS protocol is further built on an asynchronous primitive called asynchronous weak commitment (AWC), while the AVSS of Canetti et al. is built on the primitive called asynchronous weak secret sharing (AWSS). We observe that AWC has weaker requirements than AWSS and hence it can be designed more efficiently than AWSS.
The common coin primitive is one of the most important building blocks for the construction of an ABA protocol. In this paper, we extend the existing common coin protocol to make it compatible with our new AVSS protocol that shares multiple secrets simultaneously. As a byproduct, our new common coin protocol is more communication efficient than all the existing common coin protocols.Category / Keywords: Byzantine agreement, Computationally unbounded, Secret sharing, Common coin. Original Publication (with major differences): PODC 2009 and PODC 2012 Date: received 1 Oct 2008, last revised 11 Oct 2013 Contact author: arpitapatra_10 at yahoo co in Available format(s): PDF | BibTeX Citation Version: 20131011:125834 (All versions of this report) Short URL: ia.cr/2008/424 Discussion forum: Show discussion | Start new discussion