Unconditional Byzantine agreement for any number of faulty processors
Authors:
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 337-350
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- The dining cryptographers problem: Unconditional sender and recipient untraceabilityJournal of Cryptology, 1988
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983
- New hash functions and their use in authentication and set equalityJournal of Computer and System Sciences, 1981
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Codes Which Detect DeceptionBell System Technical Journal, 1974
- Inversionless decoding of binary BCH codesIEEE Transactions on Information Theory, 1971