Unconditional Byzantine Agreement with good majority
Authors:
- 13 November 2005
- book chapter
- Published by Springer Nature
- p. 285-295
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Flipping Coins In Many Pockets (Byzantine Agreement On Uniformly Random Values)2005
- The best of both worlds: guaranteeing termination in fast randomized byzantine agreement protocolsInformation Processing Letters, 1990
- Verifiable secret sharing and achieving simultaneity in the presence of faults1985
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983
- An efficient algorithm for byzantine agreement without authenticationInformation and Control, 1982
- New hash functions and their use in authentication and set equalityJournal of Computer and System Sciences, 1981
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980
- How to share a secretCommunications of the ACM, 1979
- Codes Which Detect DeceptionBell System Technical Journal, 1974