Efficient Byzantine agreement secure against general adversaries
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 134-148
- https://doi.org/10.1007/bfb0056479
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Span Programs and General Secure Multi-Party ComputationBRICS Report Series, 1997
- Towards optimal distributed consensusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Optimal algorithms for Byzantine agreementPublished by Association for Computing Machinery (ACM) ,1988
- Multiparty unconditionally secure protocolsPublished by Association for Computing Machinery (ACM) ,1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988
- Shifting gears: changing algorithms on the fly to expedite Byzantine agreementPublished by Association for Computing Machinery (ACM) ,1987
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- An efficient algorithm for byzantine agreement without authenticationInformation and Control, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980