International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: The Round Complexity of Verifiable Secret Sharing Revisited

Authors:
Arpita Patra
Ashish Choudhary
Tal Rabin
C. Pandu Rangan
Download:
DOI: 10.1007/978-3-642-03356-8_29
URL: https://www.iacr.org/archive/crypto2009/56770481/56770481.pdf
Search ePrint
Search Google
Conference: CRYPTO 2009
BibTeX
@inproceedings{crypto-2009-23857,
  title={The Round Complexity of Verifiable Secret Sharing Revisited},
  booktitle={Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={5677},
  pages={487-504},
  url={https://www.iacr.org/archive/crypto2009/56770481/56770481.pdf},
  doi={10.1007/978-3-642-03356-8_29},
  author={Arpita Patra and Ashish Choudhary and Tal Rabin and C. Pandu Rangan},
  year=2009
}