The Round Complexity of Verifiable Secret Sharing Revisited
- Arpita PatraAffiliated withDept of Computer Science and Engineering, IIT Madras
- , Ashish ChoudharyAffiliated withDept of Computer Science and Engineering, IIT Madras
- , Tal RabinAffiliated withIBM T.J. Watson Research Center
- , C. Pandu RanganAffiliated withDept of Computer Science and Engineering, IIT Madras
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 always succeeds, i.e. with probability 1. In contrast we show that with a negligible probability of error in the reconstruction phase:
There exists an efficient 2-round VSS protocol for n = 3t + 1. If we assume that the adversary is non-rushing then we can achieve a 1-round reconstruction phase.
There exists an efficient 1-round VSS for t = 1 and n > 3.
We prove that our results are optimal both in resilience and number of sharing rounds by showing:
There does not exist a 2-round WSS (and hence VSS) for n ≤ 3t.
There does not exist a 1-round VSS protocol for t ≥ 2 and n ≥ 4.
- The Round Complexity of Verifiable Secret Sharing Revisited
- Book Title
- Advances in Cryptology - CRYPTO 2009
- Book Subtitle
- 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings
- pp 487-504
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.