Improving the Round Complexity of VSS in Point-to-Point Networks

摘要

We revisit the following question: what is the optimal round complexity of verifiable secret sharing (VSS)? We focus here on the case of perfectly-secure VSS where the number of corrupted parties t satisfies t