Efficient update diffusion in byzantine environments

We present a protocol for diffusion of updates among replicas in a distributed system where up to b replicas may suffer Byzantine failures. Our algorithm ensures that no correct replica accepts spurious updates introduced by faulty replicas, by requiring that a replica accepts an update only after receiving it from at least b+1 distinct replicas (or directly from the update source). Our algorithm diffuses updates more efficiently than previous such algorithms and, by exploiting additional information available in some practical settings, sometimes more efficiently than known lower bounds predict.

[1]  Yishay Mansour,et al.  On diffusing updates in a Byzantine environment , 1999, Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems.

[2]  Louise E. Moser,et al.  The SecureRing protocols for securing group communication , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[3]  Michael K. Reiter,et al.  An Architecture for Survivable Coordination in Large Distributed Systems , 2000, IEEE Trans. Knowl. Data Eng..

[4]  Michael K. Reiter,et al.  A high-throughput secure reliable multicast protocol , 1996, Proceedings 9th IEEE Computer Security Foundations Workshop.

[5]  Sam Toueg,et al.  Asynchronous consensus and broadcast protocols , 1985, JACM.

[6]  Stephen E. Deering,et al.  Host extensions for IP multicasting , 1986, RFC.

[7]  Avishai Wool,et al.  The load and availability of Byzantine quorum systems , 1997, PODC '97.

[8]  Kenneth P. Birman,et al.  Bimodal multicast , 1999, TOCS.

[9]  R. Anderson The Eternity Service , 1996 .

[10]  Andrew V. Goldberg,et al.  Towards an archival Intermemory , 1998, Proceedings IEEE International Forum on Research and Technology Advances in Digital Libraries -ADL'98-.

[11]  Aviel D. Rubin,et al.  Publius: a robust, tamper-evident, censorship-resistant web publishing system , 2000 .

[12]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[13]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[14]  Michael K. Reiter,et al.  Secure agreement protocols: reliable and atomic group multicast in rampart , 1994, CCS '94.

[15]  Flaviu Cristian,et al.  Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement , 1995, Inf. Comput..

[16]  Michael K. Reiter,et al.  Byzantine quorum systems , 1997, STOC '97.

[17]  Miguel Oom Temudo de Castro,et al.  Practical Byzantine fault tolerance , 1999, OSDI '99.

[18]  Louise E. Moser,et al.  Total Ordering Algorithms for Asynchronous Byzantine Systems , 1995, WDAG.

[19]  Kurt J. Lidl,et al.  Drinking from the Firehose: Multicast USENET News , 1994, USENIX Winter.

[20]  Roger M. Needham,et al.  Grapevine: an exercise in distributed computing , 1982, CACM.

[21]  Danny Dolev,et al.  Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..