IACR paper details
| Title | The Round Complexity of Verifiable Secret Sharing: The Statistical Case |
|---|
| Booktitle | Advances in Cryptology - ASIACRYPT 2010 - 16th International Conference on the Theory and Application of Cryptology and Information Security |
|---|
| Volume | 6477 |
|---|
| Pages | 431-447 |
|---|
| Year | 2010 |
|---|
| URL | Search for the paper |
|---|
| DOI | 10.1007/978-3-642-17373-8_25 (link) |
|---|
| Author | Ranjit Kumaresan |
|---|
| Author | Arpita Patra |
|---|
| Author | C. Pandu Rangan |
|---|
@inproceedings{asiacrypt-2010-23818,
title={The Round Complexity of Verifiable Secret Sharing: The Statistical Case},
booktitle={Advances in Cryptology - ASIACRYPT 2010 - 16th International Conference on the Theory and Application of Cryptology and Information Security},
series={Lecture Notes in Computer Science},
publisher={Springer},
volume={6477},
pages={431-447},
doi={10.1007/978-3-642-17373-8_25},
author={Ranjit Kumaresan and Arpita Patra and C. Pandu Rangan},
year=2010
}
Download a complete BibTeX file.