Tolerating malicious gossip

Distributed Computing

Volumn 16, Issue 1, 2003, Pages 49-68

  Minsky, Yaron M ^a   Schneider, Fred B ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Byzantine fault tolerance; Gossip protocols; Replicated data

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER SIMULATION; CRYPTOGRAPHY; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; SECURITY OF DATA;

BYZANTINE FAULTS; GOSSIP PROTOCOLS; MALICIOUS GOSSIP; REPLICATED DATA;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0037303962     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-002-0082-4     Document Type: Article

References (16)

1. Adams R (1987) RFC1036: Standard for interchange of USENET messages, December 1987.
2. Demers A, Greene D, Hauser C, Irish W, Larson J, Shenker S, Sturgis H, Swinehart D, Terry D (1987) Epidemic algorithms for replicated database maintenance. In: Proc. of the Sixth ACM Symp. on Principles of Distributed Computing, pp 1-12, Vancouver, British Columbia, August
3. Feller W (1968) An Introduction to Probability Theory and its Applications. Wiley Series in Probability and Mathematica Statistics, New York, Wiley
4. Frieze AM, Girmmett GR (1985) The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics 10:57-77
5. Golding RA (1992) Weak-Consistency Group Communication and Membership. PhD thesis, UC Santa Cruz, December. Published as technical report UCSC-CRL-92-52
6. Guo K, Hayden M, Renesse R van, Vogels W, Birman KP (1997) GSGC: an efficient gossip-style garbage collection scheme for scalable reliable multicast. Technical report, Cornell University, December
7. Karp R, Shenker S, Schindelhauer C, Vocking B (2000) Randomized rumor spreading. In: 41st Symposium on Foundations of Computer Science, pp 565-574, Portland, Oregon, July
8. Liskov B, Ladin R (1986) Highly-available distributed services and fault-tolerant distributed garbage collection. In: Proc. of the Fifth ACM Symp. on Principles of Distributed Computing, pp 29-39, Calgary, Alberta, August
9. Malkhi D, Mansour Y, Reiter M (1999) On diffusing updates in a byzantine environment. In: Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems, pp 134-143, Lausanne, Switzerland, October. IEEE
10. Malkhi D, Pavlov E, Sella Y (2001) Optimal unconditional information diffusion. In: 15th International Symposium on Distributed Computing, pp 63-77 Lisbon, Portugal, October
11. Malkhi D, Reiter M, Rodeh O, Sella Y (2001) Efficient update diffusion in byzantine environments. In 20th Symposium on Reliable Distributed Systems, pp 90-98, New Orleans, USA, October 2001. IEEE Computer Society
12. Ozkasap O, Renesse R van, Birman KP, Xiao Z (1999) Efficient buffering in reliable multicast protocols. In: Proceedings of the First International Workshop on Networked Group Communication, pp 188-203, Pisa, Italy, November. Berlin Heidelberg New York: Springer
13. Petersen K, Spreitzer MJ, Terry DB, Theimer MM, Demers D (1997) Flexible update propagation for weakly consistent replication. In: Proceedings of the 16th ACM Symposium on Operating Systems Principles, pp 288-301, Saint Malo, France, October, ACM
14. Pittel B (1987) On spreading a rumor. SIAM J Appl Math 47(1):213-224
15. Renesse R van (2000) Scalable and secure resource location. In: Proceedings of the Hawaii International Conference on System Sciences, January 4-7, 2000, Maui, Hawaii, IEEE
16. Renesse R van, Minsky Y, Hayden M (1998) A gossip-style failure detection service. In: Davies N, Raymond K, Seitz J (eds) Middleware '98: IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing, pp55-70, The Lake District, England, September. 1998. Berlin Heidelberg New York: Springer