Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Asynchronous secure computation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Simple and efficient asynchronous byzantine agreement with optimal resilience
Proceedings of the 28th ACM symposium on Principles of distributed computing
Efficient statistical asynchronous verifiable secret sharing with optimal resilience
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
| Hi-index | 0.00 |
Asynchronous Verifiable Secret Sharing (AVSS) is a fundamental primitive in secure distributed computing. It finds significant application in problems like asynchronous Byzantine Agreement (ABA) and Asynchronous Multiparty Computation (AMPC). In [4], we presented a new asynchronous primitive called Asynchronous Weak Commitment (AWC) and used it to construct an AVSS scheme, which is thus far the most communication efficient AVSS scheme. Through this brief announcement, we wish to make our result visible to the Distributed Computing community.