International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

The Round Complexity of Verifiable Secret Sharing: The Statistical Case

Authors:
Ranjit Kumaresan
Arpita Patra
C. Pandu Rangan
Download:
DOI: 10.1007/978-3-642-17373-8_25
URL: https://www.iacr.org/archive/asiacrypt2010/6477435/6477435.pdf
Search ePrint
Search Google
Conference: ASIACRYPT 2010
BibTeX
@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},
  url={https://www.iacr.org/archive/asiacrypt2010/6477435/6477435.pdf},
  doi={10.1007/978-3-642-17373-8_25},
  author={Ranjit Kumaresan and Arpita Patra and C. Pandu Rangan},
  year=2010
}