{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:19:43Z","timestamp":1738387183298,"version":"3.35.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,8,5]],"date-time":"2008-08-05T00:00:00Z","timestamp":1217894400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00446-008-0069-x","type":"journal-article","created":{"date-parts":[[2008,8,4]],"date-time":"2008-08-04T10:21:29Z","timestamp":1217845289000},"page":"239-248","source":"Crossref","is-referenced-by-count":12,"title":["Lower bound for scalable Byzantine Agreement"],"prefix":"10.1007","volume":"21","author":[{"given":"Dan","family":"Holtby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce M.","family":"Kapron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valerie","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,5]]},"reference":[{"key":"69_CR1","doi-asserted-by":"crossref","unstructured":"Bar-Joseph, Z., Ben-Or, M.: A tight lower bound for randomized synchronous consensus. In: PODC \u201998: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 193\u2013199. ACM Press, New York (1998). doi: 10.1145\/277697.277733","DOI":"10.1145\/277697.277733"},{"key":"69_CR2","doi-asserted-by":"crossref","unstructured":"Christin, N., Weigend, A.S., Chuang, J.: Content availability, pollution and poisoning in file sharing peer-to-peer networks. In: EC \u201905: Proceedings of the 6th ACM Conference on Electronic commerce, pp. 68\u201377. ACM Press, New York (2005). doi: 10.1145\/1064009.1064017","DOI":"10.1145\/1064009.1064017"},{"key":"69_CR3","unstructured":"Cloudmark website. http:\/\/cloudmark.com\/"},{"key":"69_CR4","doi-asserted-by":"crossref","unstructured":"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. In: STOC \u201986: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 370\u2013379. ACM Press, New York (1986). doi: 10.1145\/12130.12169","DOI":"10.1145\/12130.12169"},{"key":"69_CR5","doi-asserted-by":"crossref","unstructured":"Feige, U.: Noncryptographic selection protocols. In: FOCS \u201999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p. 142. IEEE Computer Society, Washington DC (1999)","DOI":"10.1109\/SFFCS.1999.814586"},{"issue":"4","key":"69_CR6","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P. Feldman","year":"1997","unstructured":"Feldman P., Micali S.: An optimal probabilistic protocol for synchronous Byzantine Agreement. SIAM J. Comput. 26(4), 873\u2013933 (1997) doi: 10.1137\/S0097539790187084","journal-title":"SIAM J. Comput."},{"issue":"2\u20133","key":"69_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s00446-003-0091-y","volume":"16","author":"F. Fich","year":"2003","unstructured":"Fich F., Ruppert E.: Hundreds of impossibility results for distributed computing. Distrib. Comput. 16(2\u20133), 121\u2013163 (2003) doi: 10.1007\/s00446-003-0091-y","journal-title":"Distrib. Comput."},{"key":"69_CR8","doi-asserted-by":"crossref","unstructured":"Fischer M.J., Lynch N.A.: A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14(4), 183\u2013186 (1982) http:\/\/citeseer.ist.psu.edu\/fischer81lower.html","DOI":"10.1016\/0020-0190(82)90033-3"},{"key":"69_CR9","unstructured":"Gnutella website. http:\/\/www.gnutella.com\/"},{"key":"69_CR10","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: SODA \u201906: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 990\u2013999. ACM Press, New York (2006). doi: 10.1145\/1109557.1109667","DOI":"10.1145\/1109557.1109667"},{"key":"69_CR11","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 87\u201398 (2006)","DOI":"10.1109\/FOCS.2006.77"},{"key":"69_CR12","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. In: Suri, N., Walter, C.J., Hugue, M.M. (eds.) Advances in Ultra-Dependable Distributed Systems. IEEE Computer Society Press (1995). http:\/\/citeseer.ist.psu.edu\/lamport82byzantine.html"},{"key":"69_CR13","unstructured":"Lewis, C., Saia, J.: Scalable Byzantine Agreement. Tech. rep., University of New Mexico (2004). http:\/\/www.cs.unm.edu\/~saia\/papers\/sba.pdf"},{"key":"69_CR14","doi-asserted-by":"crossref","unstructured":"Russell, A., Saks, M., Zuckerman, D.: Lower bounds for leader election and collective coin-flipping in the perfect information model, pp. 339\u2013347 (1999). http:\/\/citeseer.ist.psu.edu\/russell99lower.html","DOI":"10.1145\/301250.301337"},{"key":"69_CR15","doi-asserted-by":"crossref","unstructured":"Russell, A., Zuckerman, D.: Perfect information leader election in log * n \u00a0+\u00a0 o(1) rounds. In: FOCS \u201998: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p. 576. IEEE Computer Society, Washington, DC (1998)","DOI":"10.1109\/SFCS.1998.743508"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0069-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-008-0069-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0069-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T08:53:31Z","timestamp":1738313611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-008-0069-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,5]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["69"],"URL":"https:\/\/doi.org\/10.1007\/s00446-008-0069-x","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2008,8,5]]}}}