{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:58:19Z","timestamp":1778065099040,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642176784","type":"print"},{"value":"9783642176791","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-17679-1_18","type":"book-chapter","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T13:44:30Z","timestamp":1294235070000},"page":"203-214","source":"Crossref","is-referenced-by-count":30,"title":["Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information"],"prefix":"10.1007","author":[{"given":"Valerie","family":"King","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Lonargan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitabh","family":"Trehan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: SODA, pp. 384\u2013393 (2003)"},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons, Chichester (2004)"},{"key":"18_CR3","unstructured":"Awerbuch, B., Scheideler, C.: Provably secure distributed name service. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142. Springer, Heidelberg (2004)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-30183-7_23","volume-title":"Peer-to-Peer Systems III","author":"B. Awerbuch","year":"2005","unstructured":"Awerbuch, B., Scheideler, C.: Robust distributed name service. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol.\u00a03279, pp. 237\u2013249. Springer, Heidelberg (2005)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Scheideler, C.: Towards a Scalable and Robust DHT. In: SPAA, pp. 318\u2013327 (2006)","DOI":"10.1145\/1148109.1148163"},{"issue":"2","key":"18_CR6","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s00224-008-9099-9","volume":"45","author":"B. Awerbuch","year":"2009","unstructured":"Awerbuch, B., Scheideler, C.: Towards a scalable and robust DHT. Theory Comput. Syst.\u00a045(2), 234\u2013260 (2009)","journal-title":"Theory Comput. Syst."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. In: STOC, pp. 370\u2013379 (1986)","DOI":"10.1145\/12130.12169"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11561071_71","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Fiat","year":"2005","unstructured":"Fiat, A., Saia, J., Young, M.: Making chord robust to byzantine attacks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 803\u2013814. Springer, Heidelberg (2005)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11818175_25","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"R. Gradwohl","year":"2006","unstructured":"Gradwohl, R., Vadhan, S.P., Zuckerman, D.: Random selection with an adversarial majority. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 409\u2013426. Springer, Heidelberg (2006)"},{"key":"18_CR10","unstructured":"Kapron, B.M., Kempe, D., King, V., Saia, J., Sanwalani, V.: Fast asynchronous byzantine agreement and leader election with full information. In: SODA, pp. 1038\u20131047 (2008)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-642-04355-0_47","volume-title":"Distributed Computing","author":"V. King","year":"2009","unstructured":"King, V., Saia, J.: From almost everywhere to everywhere: Byzantine agreement with $\\tilde{O}(n^{3\/2})$ bits. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 464\u2013478. Springer, Heidelberg (2009)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J.: Breaking the O(n 2) bit barrier: Scalable byzantine agreement with an adaptive adversary. In: PODC, pp. 420\u2013429 (2010)","DOI":"10.1145\/1835698.1835798"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: SODA, pp. 990\u2013999 (2006)","DOI":"10.1145\/1109557.1109667"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: FOCS, pp. 87\u201398 (2006)","DOI":"10.1109\/FOCS.2006.77"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Scheideler, C.: How to Spread Adversarial Nodes? Rotate! In: STOC, pp. 704\u2013713 (2005)","DOI":"10.1145\/1060590.1060694"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Upfal, E.: Tolerating linear number of faults in networks of bounded degree. In: PODC, pp. 83\u201389 (1992)","DOI":"10.1145\/135419.135437"},{"key":"18_CR17","first-page":"263","volume-title":"ICDCS","author":"M. Young","year":"2010","unstructured":"Young, M., Kate, A., Goldberg, I., Karsten, M.: Practical robust communication in DHTs tolerating a byzantine adversary. In: ICDCS, pp. 263\u2013272. IEEE, Los Alamitos (2010)"},{"issue":"4","key":"18_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<345::AID-RSA4>3.0.CO;2-Z","volume":"11","author":"D. Zuckerman","year":"1997","unstructured":"Zuckerman, D.: Randomness-optimal oblivious sampling. Random Struct. Algorithms\u00a011(4), 345\u2013367 (1997)","journal-title":"Random Struct. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17679-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T12:09:15Z","timestamp":1559909355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17679-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642176784","9783642176791"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17679-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}