Publicly Verifiable Secret Sharing

Publicly Verifiable Secret Sharing (1996)

by Markus Stadler

Citations:

105 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Publicly Verifiable Secret Sharing	user correction - Legacy Corrections
AUTHOR NAME	Markus Stadler	SVM HeaderParse 0.1
AUTHOR AFFIL	Institute for Theoretical Computer Science; ETH Zurich	SVM HeaderParse 0.2
AUTHOR ADDR	CH-8092 Zurich, Switzerland	SVM HeaderParse 0.1
ABSTRACT	. A secret sharing scheme allows to share a secret among several 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 correctly 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. 1 Introduction A secret sharing scheme [20, 2] allows to split a secret into different pieces, called shares, which are given to the participants, such that only certain groups of them can recover the secret. The first secret sharing schemes have been threshold schemes, where only groups of more than a certain number of participants can recover the secret. Verifiable secret sharing (V...	user correction - Legacy Corrections
YEAR	1996	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	190--199	INFERENCE
VOLUME	1070	INFERENCE
CITATIONS	21 found	ParsCit 1.0