Improving the Round Complexity of VSS in Point-to-Point Networks
Authors:
- 1 January 2008
- book chapter
- Published by Springer Nature
- p. 499-510
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Improving the Round Complexity of VSS in Point-to-Point Networks2008
- Round-Efficient Secure Computation in Point-to-Point Networks2007
- On Expected Constant-Round Protocols for Byzantine Agreement2006
- Round-Optimal and Efficient Verifiable Secret Sharing2006
- General Secure Multi-party Computation from any Linear Secret-Sharing Scheme2000
- An Optimal Probabilistic Protocol for Synchronous Byzantine AgreementSIAM Journal on Computing, 1997
- Perfectly secure message transmissionJournal of the ACM, 1993
- Collective Coin Tossing Without Assumptions nor Broadcasting1991
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- How to share a secretCommunications of the ACM, 1979