18 search results - page 1 / 4 » The Round Complexity of Verifiable Secret Sharing Revisited |
CRYPTO
2009
Springer
13 years 8 months ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
ASIACRYPT
2010
Springer
13 years 2 months ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
STOC
2000
ACM
13 years 8 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing...
ASIACRYPT
2005
Springer
13 years 10 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...