{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:44:14Z","timestamp":1749825854833},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_3","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T05:48:44Z","timestamp":1282628924000},"page":"4-19","source":"Crossref","is-referenced-by-count":5,"title":["Fast Asynchronous Consensus with Optimal Resilience"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[]},{"given":"Marcos K.","family":"Aguilera","sequence":"additional","affiliation":[]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/1400751.1400804","volume-title":"ACM Symposium on Principles of Distributed Computing","author":"I. Abraham","year":"2008","unstructured":"Abraham, I., Dolev, D., Halpern, J.Y.: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience. In: ACM Symposium on Principles of Distributed Computing, pp. 405\u2013414. ACM, New York (2008)"},{"key":"3_CR2","doi-asserted-by":"crossref","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 (March 2004)","edition":"2"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/800221.806707","volume-title":"ACM Symposium on Principles of Distributed Computing","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols. In: ACM Symposium on Principles of Distributed Computing, pp. 27\u201330. ACM, New York (1983)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A.: Randomized distributed agreement revisited. In: FTCS, pp. 412\u2013419 (1993)","DOI":"10.1109\/FTCS.1993.627344"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1145\/800222.806743","volume-title":"ACM Symposium on Principles of Distributed Computing","author":"G. Bracha","year":"1984","unstructured":"Bracha, G.: An asynchronous [(n - 1)\/3]-resilient consensus protocol. In: ACM Symposium on Principles of Distributed Computing, pp. 154\u2013162. ACM, New York (1984)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/586110.586124","volume-title":"CCS \u201902: Proceedings of the 9th ACM Conference on Computer and Communications Security","author":"C. Cachin","year":"2002","unstructured":"Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: CCS \u201902: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 88\u201397. ACM, New York (2002)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-44647-8_31","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"C. Cachin","year":"2001","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 524\u2013541. Springer, Heidelberg (2001)"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/343477.343531","volume-title":"ACM Symposium on Principles of Distributed Computing","author":"C. Cachin","year":"2000","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography (extended abstract). In: ACM Symposium on Principles of Distributed Computing, pp. 123\u2013132. ACM, New York (2000)"},{"key":"3_CR9","first-page":"42","volume-title":"ACM Symposium on Theory of Computing","author":"R. Canetti","year":"1993","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: ACM Symposium on Theory of Computing, pp. 42\u201351. ACM, New York (1993)"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/65950.65956","volume":"36","author":"B. Chor","year":"1989","unstructured":"Chor, B., Merritt, M., Shmoys, D.B.: Simple constant-time consensus protocols in realistic failure models. J. ACM\u00a036(3), 591\u2013614 (1989)","journal-title":"J. ACM"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/1294261.1294280","volume-title":"SOSP \u201907: Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles","author":"B.-G. Chun","year":"2007","unstructured":"Chun, B.-G., Maniatis, P., Shenker, S., Kubiatowicz, J.: Attested append-only memory: making adversaries stick to their word. In: SOSP \u201907: Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, pp. 189\u2013204. ACM, New York (2007)"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00446-004-0110-7","volume":"17","author":"M. Correia","year":"2005","unstructured":"Correia, M., Neves, N.F., Lung, L.C., Ver\u00edssimo, P.: Low complexity byzantine-resilient consensus. Distrib. Comput.\u00a017(3), 237\u2013249 (2005)","journal-title":"Distrib. Comput."},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. J. ACM\u00a034(1), 77\u201397 (1987)","journal-title":"J. ACM"},{"key":"3_CR15","first-page":"401","volume-title":"ACM Symposium on Theory of Computing","author":"D. Dolev","year":"1982","unstructured":"Dolev, D., Strong, H.R.: Polynomial algorithms for multiple processor agreement. In: ACM Symposium on Theory of Computing, pp. 401\u2013407. ACM, New York (1982)"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"3_CR17","unstructured":"Feldman, P.: Asynchronous byzantine agreement in constant expected time (copy availbale from M. Ben-Or) (1989) (unpublished)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: ACM Symposium on Theory of Computing, pp. 148\u2013161 (1988)","DOI":"10.1145\/62212.62225"},{"issue":"4","key":"3_CR19","doi-asserted-by":"publisher","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.\u00a026(4), 873\u2013933 (1997)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"M.J. Fischer","year":"1986","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distributed Computing\u00a01(1), 26\u201339 (1986)","journal-title":"Distributed Computing"},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty processor. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"3_CR22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF00196791","volume":"3","author":"S. Haber","year":"1991","unstructured":"Haber, S., Stornetta, W.S.: How to time-stamp a digital document. Journal of Cyptology\u00a03(2), 99\u2013111 (1991)","journal-title":"Journal of Cyptology"},{"key":"3_CR23","unstructured":"Hadzilacos, V., Toueg, S.: A modular approach to fault-tolerant broadcasts and related problems. Technical Report 94-1425, Computer Science Department, Cornell University, Ithaca, New York (May 1994)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11818175_27","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J. Katz","year":"2006","unstructured":"Katz, J., Koo, C.-Y.: On expected constant-round protocols for byzantine agreement. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 445\u2013462. Springer, Heidelberg (2006)"},{"key":"3_CR25","unstructured":"Kotla, R., Roy, I.: Personal Communication (2010)"},{"issue":"3","key":"3_CR26","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/2402.322398","volume":"30","author":"L. Lamport","year":"1983","unstructured":"Lamport, L.: The weak byzantine generals problem. J. ACM\u00a030(3), 668\u2013676 (1983)","journal-title":"J. ACM"},{"key":"3_CR27","first-page":"1","volume-title":"NSDI\u201909: Proceedings of the 6th USENIX symposium on Networked systems design and implementation","author":"D. Levin","year":"2009","unstructured":"Levin, D., Douceur, J.R., Lorch, J.R., Moscibroda, T.: Trinc: small trusted hardware for large distributed systems. In: NSDI\u201909: Proceedings of the 6th USENIX symposium on Networked systems design and implementation, pp. 1\u201314. USENIX Association, Berkeley (2009)"},{"key":"3_CR28","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Francisco (1996)"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/1582716.1582736","volume-title":"PODC","author":"A. Patra","year":"2009","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Simple and efficient asynchronous byzantine agreement with optimal resilience. In: PODC, pp. 92\u2013101. ACM, New York (2009)"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Stadler","year":"1996","unstructured":"Stadler, M.: Publicly verifiable secret sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 190\u2013199. Springer, Heidelberg (1996)"},{"key":"3_CR31","unstructured":"http:\/\/www.trustedcomputinggroup.org\/resources\/tpm_main_specification (February 2010)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,6]],"date-time":"2021-11-06T22:57:40Z","timestamp":1636239460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}