The Round Complexity of Verifiable Secret Sharing Revisited

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]

Abstract

Abstract is missing.