{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:25:51Z","timestamp":1769297151414,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540426059","type":"print"},{"value":"9783540454144","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45414-4_5","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T15:12:40Z","timestamp":1184944360000},"page":"63-77","source":"Crossref","is-referenced-by-count":8,"title":["Optimal Unconditional Information Diffusion"],"prefix":"10.1007","author":[{"given":"Dahlia","family":"Malkhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elan","family":"Pavlov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaron","family":"Sella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/312203.312207","volume":"17","author":"K. P. Birman","year":"1999","unstructured":"K. P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budio and Y. Minsky. Bimodal multicast. ACM Transactions on Computer Systems 17(2):41\u201388, 1999.","journal-title":"ACM Transactions on Computer Systems"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/358468.358487","volume":"25","author":"A. D. Birrell","year":"1982","unstructured":"A. D. Birrell, R. Levin, R. M. Needham, and M. D. Schroeder. Grapevine, An exercise in distributed computing. Communications of the ACM 25(4):260\u2013274, 1982.","journal-title":"Communications of the ACM"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G. Bracha","year":"1985","unstructured":"G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM 32(4):824\u2013840, October 1985.","journal-title":"Journal of the ACM"},{"key":"5_CR4","unstructured":"M. Castro and B. Liskov. Practical Byzantine fault tolerance. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation, 1999."},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1006\/inco.1995.1060","volume":"18","author":"F. Cristian","year":"1995","unstructured":"F. Cristian, H. Aghili, R. Strong, and D. Dolev. Atomic broadcast: From simple message diffusion to Byzantine agreement. Information and Computation 18(1), pages 158\u2013179, 1995.","journal-title":"Information and Computation"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"S. E. Deering. Host extensions for IP multicasting. SRI Network Information Center, RFC 1112, August 1989.","DOI":"10.17487\/rfc1112"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, pages 1\u201312, 1987.","DOI":"10.1145\/41840.41841"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D. Dolev","year":"1983","unstructured":"D. Dolev and R. Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal of Computing 12(4):656\u2013666, 1983.","journal-title":"SIAM Journal of Computing"},{"key":"5_CR9","first-page":"317","volume":"3","author":"K. P. Kihlstrom","year":"1998","unstructured":"K. P. Kihlstrom, L. E. Moser and P. M. Melliar-Smith. The SecureRing protocols for securing group communication. In Proceedings of the 31st IEEE Annual Hawaii International Conference on System Sciences, vol. 3, pages 317\u2013326, January 1998.","journal-title":"Proceedings of the 31st IEEE Annual Hawaii International Conference on System Sciences"},{"key":"5_CR10","unstructured":"K. Lidl, J. Osborne and J. Malcome. Drinking from the firehose: Multicast USENET news. In Proceedings of the Usenix Winter Conference, pages 33\u201345, January 1994."},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3):382\u2013401, July 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"L. E. Moser and P. M. Melliar-Smith. Total ordering algorithms for asynchronous Byzantine systems. In Proceedings of the 9th International Workshop on Distributed Algorithms, Springer-Verlag, September 1995.","DOI":"10.1007\/BFb0022151"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"D. Malkhi, Y. Mansour, and M. K. Reiter. On diffusing updates in a Byzantine environment. In Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems, pages 134\u2013143, October 1999.","DOI":"10.1109\/RELDIS.1999.805090"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.3233\/JCS-1997-5203","volume":"5","author":"D. Malkhi","year":"1997","unstructured":"D. Malkhi and M. Reiter. A high-throughput secure reliable multicast protocol. Journal of Computer Security 5:113\u2013127, 1997.","journal-title":"Journal of Computer Security"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"D. Malkhi, M. Reiter, O. Rodeh and Y. Sella. Efficient update diffusion in Byzantine environments. To appear in Proceedings of the 20th IEEE Symposium on Reliable Distributed Systems, 2001.","DOI":"10.1109\/RELDIS.2001.969758"},{"key":"5_CR16","unstructured":"Y. Minsky and F. B. Schneider. Tolerating malicious gossip. Private communication."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"M. K. Reiter. Secure agreement protocols: Reliable and atomic group multicast in Rampart. In Proceedings of the 2nd ACM Conference on Computer and Communications Security, pages 68\u201380, November 1994.","DOI":"10.1145\/191177.191194"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45414-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T07:02:19Z","timestamp":1556694139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45414-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426059","9783540454144"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45414-4_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}