Efficient update diffusion in Byzantine environments

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2001, Pages 90-98

  Malkhi, Dahlia ^a   Rodeh, Ohad ^a   Reiter, Michael K ^b   Sella, Yaron ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

FT algorithms; FT communication; Security

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA STRUCTURES; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; SECURITY OF DATA;

BYZANTINE FAILURES; DISTINCT REPLICAS; UPDATE DIFFUSION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0035198939     PISSN: 10609857     EISSN: None     Source Type: Journal    
DOI: 10.1109/RELDIS.2001.969758     Document Type: Article

References (21)

1. The eternity service
2. Bimodal multicast
3. Grapevine, an exercise in distributed computing
4. Asynchronous consensus and broadcast protocols
5. Practical Byzantine fault tolerance
6. Atomic broadcast: From simple message diffusion to Byzantine agreement
7. Host extensions for IP multicasting
8. Epidemic algorithms for replicated database maintenance
9. Authenticated algorithms for Byzantine agreement
10. Towards an archival intermemory
11. The SecureRing protocols for securing group communication
12. Drinking from the firehose: Multicast USENET news
13. The Byzantine generals problem
14. Total ordering algorithms for asynchronous Byzantine systems
15. On diffusing updates in a Byzantine environment
16. A high-throughput secure reliable multicast protocol
17. Byzantine quorum systems
18. An architecture for survivable coordination in large-scale systems
19. The load and availability of Byzantine quorum systems
20. Secure agreement protocols: Reliable and atomic group multicast in Rampart
21. Publius, A robust, tamper-evident and censorship-resistant web publishing system