129
click to vote
ASIACRYPT
2010
Springer
15 years 17 days 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...