| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 426544 | Information and Computation | 2009 | 11 Pages |
Abstract
We revisit the following question: what is the optimal round complexity of verifiable secret sharing (VSS)? We focus here on the case of perfect VSS where the number of corrupted parties t satisfies t
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
