The Round Complexity of Verifiable Secret Sharing Revisited - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Arpita Patra' in GoogleThis author has not been identified. Look up 'Ashish Choudhary' in GoogleThis author has not been identified. Look up 'Tal Rabin' in GoogleThis author has not been identified. Look up 'C. Pandu Rangan' in Google

runs on WebDSL