Asynchronous verifiable secret sharing and proactive cryptosystems

Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, Reto Strobl
2002 Proceedings of the 9th ACM conference on Computer and communications security - CCS '02  
Verifiable secret sharing is an important primitive in distributed cryptography. With the growing interest in the deployment of threshold cryptosystems in practice, the traditional assumption of a synchronous network has to be reconsidered and generalized to an asynchronous model. This paper proposes the first practical verifiable secret sharing protocol for asynchronous networks. The protocol creates a discrete logarithm-based sharing and uses only a quadratic number of messages in the number
more » ... f participating servers. It yields the first asynchronous Byzantine agreement protocol in the standard model whose efficiency makes it suitable for use in practice. Proactive cryptosystems are another important application of verifiable secret sharing. The second part of this paper introduces proactive cryptosystems in asynchronous networks and presents an efficient protocol for refreshing the shares of a secret key for discrete logarithm-based sharings.
doi:10.1145/586123.586124 fatcat:cewp7oefhzct7bn52umtc7rbli