Diffusion without false rumors: on propagating updates in a Byzantine environment
暂无分享,去创建一个
[1] J. van Leeuwen,et al. Theoretical Computer Science , 2003, Lecture Notes in Computer Science.
[2] Fred B. Schneider,et al. Spreading rumors cheaply, quickly, and reliably , 2002 .
[3] D. Malkhi,et al. Optimal Unconditional Information Diffusion , 2001, DISC.
[4] Michael K. Reiter,et al. Persistent objects in the Fleet system , 2001, Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01.
[5] Yaron,et al. Repli ation by Di usion in Large Networks , 2001 .
[6] Michael K. Reiter,et al. Efficient update diffusion in byzantine environments , 2001, Proceedings 20th IEEE Symposium on Reliable Distributed Systems.
[7] Michael K. Reiter,et al. An Architecture for Survivable Coordination in Large Distributed Systems , 2000, IEEE Trans. Knowl. Data Eng..
[8] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[9] Yishay Mansour,et al. On diffusing updates in a Byzantine environment , 1999, Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems.
[10] Kenneth P. Birman,et al. Bimodal multicast , 1999, TOCS.
[11] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[12] Louise E. Moser,et al. The SecureRing protocols for securing group communication , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.
[13] Michael K. Reiter,et al. Probabilistic quorum systems , 1997, PODC '97.
[14] Michael K. Reiter,et al. Byzantine quorum systems , 1997, STOC '97.
[15] Michael K. Reiter,et al. A high-throughput secure reliable multicast protocol , 1996, Proceedings 9th IEEE Computer Security Foundations Workshop.
[16] Louise E. Moser,et al. Total Ordering Algorithms for Asynchronous Byzantine Systems , 1995, WDAG.
[17] F. Cristian,et al. ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT , 1995 .
[18] H. R. Strong,et al. ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'..
[19] Michael K. Reiter,et al. Secure agreement protocols: reliable and atomic group multicast in rampart , 1994, CCS '94.
[20] Kurt J. Lidl,et al. Drinking from the Firehose: Multicast USENET News , 1994, USENIX Winter.
[21] N. Fisher,et al. Probability Inequalities for Sums of Bounded Random Variables , 1994 .
[22] Gustavus J. Simmons,et al. Contemporary Cryptology: The Science of Information Integrity , 1994 .
[23] Umesh V. Vazirani,et al. An Introduction to Computational Learning Theory , 1994 .
[24] Gustavus J. Simmons,et al. A survey of information authentication , 1988, Proc. IEEE.
[25] Scott Shenker,et al. Epidemic algorithms for replicated database maintenance , 1988, OPSR.
[26] B. Pittel. On spreading a rumor , 1987 .
[27] Stephen E. Deering,et al. Host extensions for IP multicasting , 1986, RFC.
[28] Sam Toueg,et al. Asynchronous consensus and broadcast protocols , 1985, JACM.
[29] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[30] Yogen K. Dalal,et al. The clearinghouse: a decentralized agent for locating named objects in a distributed environment , 1983, TOIS.
[31] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[32] Roger M. Needham,et al. Grapevine: an exercise in distributed computing , 1982, CACM.
[33] David K. Gifford,et al. Weighted voting for replicated data , 1979, SOSP '79.
[34] W. Hoeffding. Probability inequalities for sum of bounded random variables , 1963 .
[35] B. Harshbarger. An Introduction to Probability Theory and its Applications, Volume I , 1958 .
[36] W. Feller. An Introduction to Probability Theory and Its Applications , 1959 .