Publicly Verifiable Secret Sharing

  • Markus Stadler
Conference paper

DOI: 10.1007/3-540-68339-9_17

Volume 1070 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Stadler M. (1996) Publicly Verifiable Secret Sharing. In: Maurer U. (eds) Advances in Cryptology — EUROCRYPT ’96. EUROCRYPT 1996. Lecture Notes in Computer Science, vol 1070. Springer, Berlin, Heidelberg

Abstract

A secret sharing scheme allows to share a secret among sev- eral participants such that only certain groups of them can recover it. Verifiable secret sharing has been proposed to achieve security against cheating participants. Its first realization had the special property that everybody, not only the participants, can verify that the shares are cor- rectly distributed. We will call such schemes publicly verifiable secret sharing schemes, we discuss new applications to escrow cryptosystems and to payment systems with revocable anonymity, and we present two new realizations based on ElGamal’s cryptosystem.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Markus Stadler
    • 1
  1. 1.Institute for Theoretical Computer ScienceETH ZurichZurichSwitzerland