International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems

Authors:
Christian Cachin
Klaus Kursawe
Anna Lysyanskaya
Reto Strobl
Download:
URL: http://eprint.iacr.org/2002/134
Search ePrint
Search Google
Abstract: 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.
BibTeX
@misc{eprint-2002-11657,
  title={Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / threshold cryptography, byzantine agreement},
  url={http://eprint.iacr.org/2002/134},
  note={Extended abstract appears in ACM CCS-9. cachin@acm.org 11928 received 29 Aug 2002},
  author={Christian Cachin and Klaus Kursawe and Anna Lysyanskaya and Reto Strobl},
  year=2002
}