3 search results - page 1 / 1 » The Round Complexity of Verifiable Secret Sharing: The Stati... |
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...
CRYPTO
2009
Springer
13 years 9 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...
CORR
2010
Springer
13 years 5 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...