Improving the Round Complexity of VSS in Point-to-Point Networks
- 1 January 2008
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Improving the Round Complexity of VSS in Point-to-Point NetworksLecture Notes in Computer Science, 2008
- Round-Efficient Secure Computation in Point-to-Point NetworksLecture Notes in Computer Science, 2007
- On Expected Constant-Round Protocols for Byzantine AgreementLecture Notes in Computer Science, 2006
- Round-Optimal and Efficient Verifiable Secret SharingLecture Notes in Computer Science, 2006
- General Secure Multi-party Computation from any Linear Secret-Sharing SchemeLecture Notes in Computer Science, 2000
- 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 BroadcastingLecture Notes in Computer Science, 1991
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- How to share a secretCommunications of the ACM, 1979