Verifiable secret sharing

Known as: VSS 
In cryptography, a secret sharing scheme is verifiable if auxiliary information is included that allows players to verify their shares as consistent… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Threshold secret sharing (SS), also denoted as (t, n) SS, has been used extensively in the area of information security, such as… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
2014
2014
This article proposes efficient solutions for the construction of sealed-bid second-price and combinatorial auction protocols in… (More)
  • figure 1
  • table 1
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2011
2011
Verifiable secret sharing (VSS) is an important primitive in distributed cryptography that allows a dealer to share a secret… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2006
2006
We consider perfect verifiable secret sharing (VSS) in a synchronous network of n processors (players) where a designated player… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Verifiable secret sharing is an important primitive in distributed cryptography. With the growing interest in the deployment of… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The <italic>round complexity</italic> of interactive protocols is one of their most important complexity measures. In this work… (More)
Is this relevant?
1996
1996
Secret Sharing is a fundamental notion for secure cryptographic design. In a Secret Sharing protocol a dealer shares a secret… (More)
Is this relevant?
1995
1995
We present a stronger notion of veri able secret sharing and exhibit a protocol implementing it. We show that our new notion is… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Under the assumption that each participant can broadcast a message to all other participants and that each pair of participants… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
  • Paul Feldman
  • 28th Annual Symposium on Foundations of Computer…
  • 1987
This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing. Verifiable secret sharing… (More)
Is this relevant?