Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch
Authors:
- 29 April 2002
- book chapter
- Published by Springer Nature
- p. 482-501
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Multiparty Protocols Tolerating Half Faulty Processors2001
- An Update on Quantum Cryptography2000
- From partial consistency to global broadcast2000
- Verifiable secret sharing and multiparty protocols with honest majority1989
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988
- Easy impossibility proofs for distributed consensus problemsDistributed Computing, 1986
- An efficient algorithm for byzantine agreement without authenticationInformation and Control, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980
- The tail of the hypergeometric distributionDiscrete Mathematics, 1979
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963