The Round Complexity of Verifiable Secret Sharing Revisited

The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS can be circumvented by introducing a negligible probability of error in the reconstruction phase. Previous results show matching lower and upper bounds of three rounds for VSS, with n = 3t + 1, where the reconstruction of the secrets al

• Type: Conference
• Year: 2009
• Where: CRYPTO
• Authors: Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan
• Keywords: CRYPTO 2009, Cryptology, Important Complexity Measures, Lower Bounds, Negligible Probability