[Resource Topic] 2002/134: Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems

Welcome to the resource topic for 2002/134

Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems

Authors: Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, Reto Strobl


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 \emph{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 of 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.

ePrint: https://eprint.iacr.org/2002/134

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .