A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 269-280
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A new parameter for a broadcast algorithm with locally bounded Byzantine faultsInformation Processing Letters, 2010
- Broadcasting with locally bounded Byzantine faultsInformation Processing Letters, 2005
- Broadcast in radio networks tolerating byzantine adversarial behavior2004
- On perfectly secure communication over arbitrary networks2002
- Fault-Tolerant Broadcasting in Radio NetworksJournal of Algorithms, 2001
- Secure Communication in Minimal Connectivity ModelsJournal of Cryptology, 2000
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 RoundsSIAM Journal on Computing, 1998
- Perfectly secure message transmissionJournal of the ACM, 1993
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- The Byzantine generals strike againJournal of Algorithms, 1982