Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 74-92
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Perfectly-Secure MPC with Linear Communication Complexity2008
- Simple and Efficient Perfectly-Secure Asynchronous MPC2007
- Round-Optimal and Efficient Verifiable Secret Sharing2006
- Efficient Multi-party Computation with Dispute Control2006
- Efficient Multiparty Protocols Using Circuit Randomization2001
- General Secure Multi-party Computation from any Linear Secret-Sharing Scheme2000
- Efficient Multiparty Computations Secure Against an Adaptive Adversary1999
- Perfectly secure message transmissionJournal of the ACM, 1993
- Asynchronous secure computation1993
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988