Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan. The Round Complexity of Verifiable Secret Sharing Revisited. In Shai Halevi, editor, Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings. Volume 5677 of Lecture Notes in Computer Science, pages 487-504, Springer, 2009. [doi]
@inproceedings{PatraCRR09,
title = {The Round Complexity of Verifiable Secret Sharing Revisited},
author = {Arpita Patra and Ashish Choudhary and Tal Rabin and C. Pandu Rangan},
year = {2009},
doi = {10.1007/978-3-642-03356-8_29},
url = {http://dx.doi.org/10.1007/978-3-642-03356-8_29},
tags = {C++},
researchr = {https://researchr.org/publication/PatraCRR09},
cites = {0},
citedby = {0},
pages = {487-504},
booktitle = {Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings},
editor = {Shai Halevi},
volume = {5677},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-03355-1},
}