The round complexity of verifiable secret sharing and secure multicast
Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin · 2001
The round complexity of interactive protocols is one of their most important complexity measures. In this work we study the exact round complexity of two basic secure computation tasks: Verifiable Secret Sharing (VSS) and Secure Multicast.