{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:10:49Z","timestamp":1742400649501},"reference-count":29,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3760,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0304-3975(02)00325-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"289-306","source":"Crossref","is-referenced-by-count":22,"title":["Diffusion without false rumors: on propagating updates in a Byzantine environment"],"prefix":"10.1016","volume":"299","author":[{"given":"Dahlia","family":"Malkhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael K.","family":"Reiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(02)00325-0_BIB1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/312203.312207","article-title":"Bimodal multicast","volume":"17","author":"Birman","year":"1999","journal-title":"ACM Trans. Comput. Systems"},{"issue":"4","key":"10.1016\/S0304-3975(02)00325-0_BIB2","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/358468.358487","article-title":"Grapevine, An exercise in distributed computing","volume":"25","author":"Birrell","year":"1982","journal-title":"Commun. ACM"},{"issue":"4","key":"10.1016\/S0304-3975(02)00325-0_BIB3","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1145\/4221.214134","article-title":"Asynchronous consensus and broadcast protocols","volume":"32","author":"Bracha","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00325-0_BIB4","unstructured":"M. Castro, B. Liskov, Practical Byzantine fault tolerance, in: Proc. 3rd Symp. on Operating Systems Design and Implementation, 1999."},{"issue":"1","key":"10.1016\/S0304-3975(02)00325-0_BIB5","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1006\/inco.1995.1060","article-title":"Atomic broadcast","volume":"18","author":"Cristian","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(02)00325-0_BIB6","doi-asserted-by":"crossref","unstructured":"S.E. Deering, Host extensions for IP multicasting, SRI Network Information Center, RFC 1112, 1989.","DOI":"10.17487\/rfc1112"},{"key":"10.1016\/S0304-3975(02)00325-0_BIB7","doi-asserted-by":"crossref","unstructured":"A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, D. Terry, Epidemic algorithms for replicated database maintenance, in: Proc. 6th ACM Symp. Principles of Distributed Computing, 1987, pp. 1\u201312.","DOI":"10.1145\/41840.41841"},{"issue":"4","key":"10.1016\/S0304-3975(02)00325-0_BIB8","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","article-title":"Authenticated algorithms for Byzantine agreement","volume":"12","author":"Dolev","year":"1983","journal-title":"SIAM J. Comput."},{"issue":"301","key":"10.1016\/S0304-3975(02)00325-0_BIB9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/S0304-3975(02)00325-0_BIB10","series-title":"An Introduction to Computational Learning Theory","author":"Kearns","year":"1994"},{"key":"10.1016\/S0304-3975(02)00325-0_BIB11","doi-asserted-by":"crossref","unstructured":"K.P. Kihlstrom, L.E. Moser, P.M. Melliar-Smith, The SecureRing protocols for securing group communication, in: Proc. 31st IEEE Ann. Hawaii Internat. Conf. on System Sciences, Vol. 3, 1998, pp. 317\u2013326.","DOI":"10.1109\/HICSS.1998.656294"},{"issue":"3","key":"10.1016\/S0304-3975(02)00325-0_BIB12","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The Byzantine generals problem","volume":"4","author":"Lamport","year":"1982","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"10.1016\/S0304-3975(02)00325-0_BIB13","unstructured":"K. Lidl, J. Osborne, J. Malcome, Drinking from the firehose: multicast USENET news, in: Proc. Usenix Winter Conf., 1994, pp. 33\u201345."},{"key":"10.1016\/S0304-3975(02)00325-0_BIB14","doi-asserted-by":"crossref","unstructured":"D. Malkhi, Y. Mansour, M. Reiter, On diffusing updates in a Byzantine environment, in: Proc. 18th IEEE Symp. on Reliable Distributed Systems, 1999, pp. 134\u2013143.","DOI":"10.1109\/RELDIS.1999.805090"},{"key":"10.1016\/S0304-3975(02)00325-0_BIB15","doi-asserted-by":"crossref","unstructured":"D. Malkhi, E. Pavlov, Y. Sella, Optimal unconditional information diffusion, in: Proc. 15th Internat. Symp. on Distributed Computing, October 2001.","DOI":"10.1007\/3-540-45414-4_5"},{"key":"10.1016\/S0304-3975(02)00325-0_BIB16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.3233\/JCS-1997-5203","article-title":"A high-throughput secure reliable multicast protocol","volume":"5","author":"Malkhi","year":"1997","journal-title":"J. Comput. Security"},{"issue":"4","key":"10.1016\/S0304-3975(02)00325-0_BIB17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s004460050050","article-title":"Byzantine quorum systems","volume":"11","author":"Malkhi","year":"1998","journal-title":"Distributed Comput."},{"issue":"2","key":"10.1016\/S0304-3975(02)00325-0_BIB18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/69.842262","article-title":"An architecture for survivable coordination in large distributed systems","volume":"12","author":"Malkhi","year":"2000","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/S0304-3975(02)00325-0_BIB19","doi-asserted-by":"crossref","unstructured":"D. Malkhi, M. Reiter, O. Rodeh, Y. Sella, Efficient update diffusion in Byzantine environments, in: Proc. 20th Symp. on Reliable Distributed Systems (SRDS 2001), October 2001.","DOI":"10.1109\/RELDIS.2001.969758"},{"key":"10.1016\/S0304-3975(02)00325-0_BIB20","doi-asserted-by":"crossref","unstructured":"D. Malkhi, M.K. Reiter, D. Tulone, E. Ziskind, Persistent objects in the Fleet system, in: Proc. 2nd DARPA Inform. Survivability Conf. and Exposition, June 2001.","DOI":"10.1109\/DISCEX.2001.932165"},{"issue":"2","key":"10.1016\/S0304-3975(02)00325-0_BIB21","doi-asserted-by":"crossref","DOI":"10.1006\/inco.2001.3054","article-title":"Probabilistic quorum systems","volume":"170","author":"Malkhi","year":"2001","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(02)00325-0_BIB22","unstructured":"D. Malkhi, Y. Sella, Replication by diffusion in large networks, in: European Research Seminar on Advances in Distributed Systems (Ersads 2001), Bologna, Italy, 2001."},{"key":"10.1016\/S0304-3975(02)00325-0_BIB23","unstructured":"Y. Minsky, Spreading rumors cheaply, quickly, and reliably, Ph.D. Thesis, Department of Computer Science, Cornell University, 2002."},{"key":"10.1016\/S0304-3975(02)00325-0_BIB24","doi-asserted-by":"crossref","unstructured":"L.E. Moser, P.M. Melliar-Smith, Total ordering algorithms for asynchronous Byzantine systems, in: Proc. 9th Internat. Workshop on Distributed Algorithms, Springer, 1995.","DOI":"10.1007\/BFb0022151"},{"key":"10.1016\/S0304-3975(02)00325-0_BIB25","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0304-3975(02)00325-0_BIB26","unstructured":"D.C. Oppen, Y.K. Dalal, The Clearinghouse: a decentralized agent for locating named objects in a distributed environment, Xerox Technical Report: OPD-T8103, 1981."},{"issue":"1","key":"10.1016\/S0304-3975(02)00325-0_BIB27","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1137\/0147013","article-title":"On spreading a rumor","volume":"47","author":"Pittel","year":"1987","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(02)00325-0_BIB28","doi-asserted-by":"crossref","unstructured":"M.K. Reiter, Secure agreement protocols: reliable and atomic group multicast in Rampart, in: Proc. 2nd ACM Conf. on Computer and Communications Security, November 1994, pp. 68\u201380.","DOI":"10.1145\/191177.191194"},{"key":"10.1016\/S0304-3975(02)00325-0_BIB29","unstructured":"G.J. Simmons, A survey of information authentication, in: Contemporary Cryptology, The Science of Information Integrity, Wiley-IEEE Press, New York, 1999."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502003250?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502003250?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T08:59:25Z","timestamp":1583744365000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502003250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0304397502003250"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00325-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}