{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T20:57:36Z","timestamp":1791493056193,"version":"4.3.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642043543","type":"print"},{"value":"9783642043550","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04355-0_47","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T22:44:15Z","timestamp":1253659455000},"page":"464-478","source":"Crossref","is-referenced-by-count":30,"title":["From Almost Everywhere to Everywhere: Byzantine Agreement with $\\tilde{O}(n^{3\/2})$ Bits"],"prefix":"10.1007","author":[{"given":"Valerie","family":"King","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"47_CR1","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, 2nd edn. John Wiley Interscience, Chichester (2004)","edition":"2"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Pavlov, E., Vaikuntanathan, V.: Byzantine agreement in the full-information model in o(log n) rounds. In: STOC, pp. 179\u2013186 (2006)","DOI":"10.1145\/1132516.1132543"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/1400751.1400772","volume-title":"PODC 2008: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, Toronto, Canada","author":"E. Bortnikov","year":"2008","unstructured":"Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: Byzantine resilient random membership sampling. In: PODC 2008: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, Toronto, Canada, pp. 145\u2013154. ACM, New York (2008)"},{"issue":"1","key":"47_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D. Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for byzantine agreement. J. ACM\u00a032(1), 191\u2013204 (1985)","journal-title":"J. ACM"},{"key":"47_CR5","first-page":"142","volume-title":"FOCS 1999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science","author":"U. Feige","year":"1999","unstructured":"Feige, U.: Noncryptographic selection protocols. In: FOCS 1999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p. 142. IEEE Computer Society, Washington (1999)"},{"key":"47_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-78967-3_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J.A. Garay","year":"2008","unstructured":"Garay, J.A., Ostrovsky, R.: Almost-everywhere secure computation. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 307\u2013323. Springer, Heidelberg (2008)"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Gilbert, S., Guerraoui, R., Kowalski, D.R.: On the complexity of asynchronous gossip. In: Proceedings of the ACM symposium on Principles of distributed computing (PODC), pp. 135\u2013144 (2008)","DOI":"10.1145\/1400751.1400771"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Pavlov, E., Vaikuntanathan, V.: Fault-tolerant distributed computing in full-information networks. In: FOCS, pp. 15\u201326 (2006)","DOI":"10.1109\/FOCS.2006.30"},{"key":"47_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)"},{"issue":"4","key":"47_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00446-008-0069-x","volume":"21","author":"D. Holtby","year":"2008","unstructured":"Holtby, D., Kapron, B.M., King, V.: Lower bound for scalable byzantine agreement. Distributed Computing\u00a021(4), 239\u2013248 (2008)","journal-title":"Distributed Computing"},{"key":"47_CR11","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":"47_CR12","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1145\/1109557.1109667","volume-title":"SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm","author":"V. King","year":"2006","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 990\u2013999. ACM Press, New York (2006)"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/FOCS.2006.77","volume-title":"FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006)","author":"V. King","year":"2006","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 87\u201398. IEEE Computer Society, Washington (2006)"},{"issue":"6","key":"47_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/1323293.1294267","volume":"41","author":"R. Kotla","year":"2007","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. SIGOPS Oper. Syst. Rev.\u00a041(6), 45\u201358 (2007)","journal-title":"SIGOPS Oper. Syst. Rev."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:44:14Z","timestamp":1558539854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}