Improving the round complexity of VSS in point-to-point networks

Authors:
Jonathan Katz;Chiu-Yuen Koo;Ranjit Kumaresan
Affiliations:
Department of Computer Science, University of Maryland, College Park, MD 20742, USA;Google Labs, Mountain View, CA 94043, USA;Department of Computer Science, University of Maryland, College Park, MD 20742, USA
Venue:
Information and Computation
Year:
2009

Citing 14
Cited 1

Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfectly secure message transmission

Journal of the ACM (JACM)
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

SIAM Journal on Computing
How to share a secret

Communications of the ACM
The round complexity of verifiable secret sharing and secure multicast

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Sequential composition of protocols without simultaneous termination

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Collective Coin Tossing Without Assumptions nor Broadcasting

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Efficient player-optimal protocols for strong and differential consensus

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Studies on fault-tolerant broadcast and secure computation

Studies on fault-tolerant broadcast and secure computation
Verifiable secret sharing and achieving simultaneity in the presence of faults

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
On expected constant-round protocols for Byzantine agreement

Journal of Computer and System Sciences
General secure multi-party computation from any linear secret-sharing scheme

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Round-Optimal and efficient verifiable secret sharing

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Verifiable secret sharing in a total of three rounds

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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