{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T16:55:59Z","timestamp":1725641759453},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258725"},{"type":"electronic","value":"9783642258732"}],"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-25873-2_32","type":"book-chapter","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T10:16:34Z","timestamp":1323339394000},"page":"465-480","source":"Crossref","is-referenced-by-count":1,"title":["Accurate Byzantine Agreement with Feedback"],"prefix":"10.1007","author":[{"given":"Vijay K.","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Bridgman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bharath","family":"Balasubramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/1146381.1146393","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006","author":"I. Abraham","year":"2006","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, pp. 53\u201362. ACM, New York (2006)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Towards optimal distributed consensus. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 410\u2013415 (1989)","DOI":"10.1109\/SFCS.1989.63511"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BFb0035753","volume-title":"Automata, Languages and Programming","author":"P. Berman","year":"1989","unstructured":"Berman, P., Garay, J.A.: Asymptotically Optimal Distributed Consensus (Extended Abstract). In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 80\u201394. Springer, Heidelberg (1989)"},{"issue":"4","key":"32_CR4","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1145\/31846.42229","volume":"34","author":"G. Bracha","year":"1987","unstructured":"Bracha, G.: An O(logn) expected rounds randomized Byzantine generals protocol. Journal of the ACM\u00a034(4), 910\u2013920 (1987)","journal-title":"Journal of the ACM"},{"key":"32_CR5","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Third Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana. USENIX Association, Co-sponsored by IEEE TCOS and ACM SIGOPS (February 1999)"},{"key":"32_CR6","unstructured":"Clement, A., Marchetti, M., Wong, E., Alvisi, L., Dahlin, M.: Making byzantine fault tolerant systems tolerate byzantine faults. In: 6th USENIX Symposium on Networked Systems Design and Implementation (NSDI) (April 2009)"},{"key":"32_CR7","unstructured":"Cowling, J., Myers, D., Liskov, B., Rodrigues, R., Shrira, L.: Hq replication: A hybrid quorum protocol for byzantine fault tolerance. In: Proceedings of the Seventh Symposium on Operating Systems Design and Implementations (OSDI), Seattle, Washington (November 2006)"},{"issue":"4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"Dolev, D., Reischuk, R., Strong, H.R.: Early stopping in byzantine agreement. J. ACM\u00a037(4), 720\u2013741 (1990)","journal-title":"J. ACM"},{"issue":"4","key":"32_CR9","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM J. Comput.\u00a012(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"32_CR10","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."},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BFb0056479","volume-title":"Distributed Computing","author":"M. Fitzi","year":"1998","unstructured":"Fitzi, M., Maurer, U.M.: Efficient Byzantine Agreement Secure Against General Adversaries. In: Kutten, S. (ed.) DISC 1998. LNCS, vol.\u00a01499, pp. 134\u2013148. Springer, Heidelberg (1998)"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/167088.167101","volume-title":"STOC 1993: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing","author":"J.A. Garay","year":"1993","unstructured":"Garay, J.A., Moses, Y.: Fully polynomial byzantine agreement in t + 1 rounds. In: STOC 1993: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 31\u201341. ACM, New York (1993)"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Garg, V.K., Bridgman, J.: The weighted byzantine agreement problem. In: 25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011 Conference Proceedings, Anchorage, Alaska, USA, May 16-20, pp. 524\u2013531. IEEE (2011)","DOI":"10.1109\/IPDPS.2011.57"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/259380.259412","volume-title":"PODC 1997: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing","author":"M. Hirt","year":"1997","unstructured":"Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: PODC 1997: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 25\u201334. ACM, New York (1997)"},{"key":"32_CR15","unstructured":"Kale, S.: Efficient algorithms using the multiplicative weights update method. PhD thesis, Princeton, NJ, USA, AAI3286120 (2007)"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/1835698.1835798","volume-title":"Proceeding of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010","author":"V. King","year":"2010","unstructured":"King, V., Saia, J.: Breaking the o(n2) bit barrier: scalable byzantine agreement with an adaptive adversary. In: Proceeding of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010, pp. 420\u2013429. ACM, New York (2010)"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst.\u00a04, 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"21","key":"32_CR18","doi-asserted-by":"publisher","first-page":"4785","DOI":"10.1016\/j.ins.2007.04.011","volume":"177","author":"K.-W. Lee","year":"2007","unstructured":"Lee, K.-W., Ewe, H.-T.: Performance study of byzantine agreement protocol with artificial neural network. Inf. Sci.\u00a0177(21), 4785\u20134798 (2007)","journal-title":"Inf. Sci."},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Inf. Comput.\u00a0108, 212\u2013261 (1994)","journal-title":"Inf. Comput."},{"issue":"2","key":"32_CR20","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreements in the presence of faults. Journal of the ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized byzantine generals. In: Foundations of Computer Science, pp. 403\u2013409 (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"32_CR22","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/ICOIN.2001.905500","volume-title":"Proceedings of the The International Conference on Information Networking","author":"S.C. Wang","year":"2001","unstructured":"Wang, S.C., Kao, S.H.: A new approach for byzantine agreement. In: Proceedings of the The International Conference on Information Networking, p. 518. IEEE Computer Society, Washington, DC (2001)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25873-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T02:13:51Z","timestamp":1555812831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25873-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258725","9783642258732"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25873-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}