{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:56Z","timestamp":1759638416917},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662451731"},{"type":"electronic","value":"9783662451748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45174-8_6","type":"book-chapter","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T15:28:20Z","timestamp":1412004500000},"page":"76-90","source":"Crossref","is-referenced-by-count":6,"title":["Tight Bound on Mobile Byzantine Agreement"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"D\u00e9fago","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanh Dang","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"22","key":"6_CR1","first-page":"1","volume":"43","author":"N. Banu","year":"2012","unstructured":"Banu, N., Souissi, S., Izumi, T., Wada, K.: An improved byzantine agreement algorithm for synchronous systems with mobile faults. International Journal of Computer Applications\u00a043(22), 1\u20137 (2012)","journal-title":"International Journal of Computer Applications"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bonnet, F., D\u00e9fago, X., Nguyen, T.D., Potop-Butucaru, M.: Tight bound on mobile byzantine agreement. Research Report IS-RR-2014-004, Japan Advanced Institute of Science and Technology (JAIST) (May 2014)","DOI":"10.1007\/978-3-662-45174-8_6"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1145\/31846.42229","volume":"34","author":"G. Bracha","year":"1987","unstructured":"Bracha, G.: An o(log n) expected rounds randomized byzantine generals protocol. Journal of the ACM\u00a034(4), 910\u2013920 (1987)","journal-title":"Journal of the ACM"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Garay, J.A., Hoepman, J.H.: Optimal resiliency against mobile faults. In: Proceedings of the 25th International Symposium on Fault-Tolerant Computing (FTCS 1995), pp. 83\u201388 (1995)","DOI":"10.1109\/FTCS.1995.466995"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Correia, M., Veronese, G.S., Lung, L.C.: Asynchronous byzantine consensus with 2f\u2009+\u20091 processes. In: Proceedings of the 25th ACM Symposium on Applied Computing, SAC 2010, pp. 475\u2013480 (2010)","DOI":"10.1145\/1774088.1774187"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Daliot, A., Dolev, D.: Self-stabilizing Byzantine agreement. In: Proc. 25th ACM Symp. on Principles of Distributed Computing (PODC 2006), pp. 143\u2013152 (2006)","DOI":"10.1145\/1146381.1146405"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D.: The byzantine generals strike again. Journal of Algorithms\u00a03(1), 14\u201330 (1982)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0019-9958(82)90776-8","volume":"52","author":"D. Dolev","year":"1982","unstructured":"Dolev, D., Fischer, M.J., Fowler, T.R., Lynch, N.A., Strong, H.R.: An efficient algorithm for byzantine agreement without authentication. Information and Control\u00a052(3), 257\u2013274 (1982)","journal-title":"Information and Control"},{"issue":"4","key":"6_CR9","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 Journal on Computing\u00a026(4), 873\u2013933 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"6_CR10","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 process. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BFb0020438","volume-title":"Distributed Algorithms","author":"J.A. Garay","year":"1994","unstructured":"Garay, J.A.: Reaching (and maintaining) agreement in the presence of mobile faults. In: Tel, G., Vit\u00e1nyi, P. (eds.) WDAG 1994. LNCS, vol.\u00a0857, pp. 253\u2013264. Springer, Heidelberg (1994)"},{"issue":"3","key":"6_CR12","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 Transactions on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TDSC.2006.35","volume":"3","author":"J.P. Martin","year":"2006","unstructured":"Martin, J.P., Alvisi, L.: Fast byzantine consensus. IEEE Transactions on Dependable and Secure Computing\u00a03(3), 202\u2013215 (2006)","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/s00224-007-9006-9","volume":"42","author":"M. Okun","year":"2008","unstructured":"Okun, M., Barak, A.: Efficient algorithms for anonymous byzantine agreement. Theory of Computing Systems\u00a042(2), 222\u2013238 (2008)","journal-title":"Theory of Computing Systems"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks (extended abstract). In: Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing (PODC 1991), pp. 51\u201359 (1991)","DOI":"10.1145\/112600.112605"},{"issue":"2","key":"6_CR16","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 agreement in the presence of faults. Journal of the ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Fault-tolerant Agreement in Synchronous Message-passing Systems. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2010)","DOI":"10.2200\/S00294ED1V01Y201009DCT003"},{"issue":"1-3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0019-9958(85)80042-5","volume":"64","author":"R. Reischuk","year":"1985","unstructured":"Reischuk, R.: A new solution for the byzantine generals problem. Information and Control\u00a064(1-3), 23\u201342 (1985)","journal-title":"Information and Control"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BFb0028994","volume-title":"STACS 89","author":"N. Santoro","year":"1989","unstructured":"Santoro, N., Widmayer, P.: Time is not a healer. In: Cori, R., Monien, B. (eds.) STACS 1989. LNCS, vol.\u00a0349, pp. 304\u2013313. Springer, Heidelberg (1989)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11429647_21","volume-title":"Structural Information and Communication Complexity","author":"N. Santoro","year":"2005","unstructured":"Santoro, N., Widmayer, P.: Majority and unanimity in synchronous networks with ubiquitous dynamic faults. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 262\u2013276. Springer, Heidelberg (2005)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-03850-6_17","volume-title":"Principles of Distributed Systems","author":"T. Sasaki","year":"2013","unstructured":"Sasaki, T., Yamauchi, Y., Kijima, S., Yamashita, M.: Mobile byzantine agreement on arbitrary network. In: Baldoni, R., Nisse, N., van Steen, M. (eds.) OPODIS 2013. LNCS, vol.\u00a08304, pp. 236\u2013250. Springer, Heidelberg (2013)"},{"issue":"5","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1137\/S009753970443999X","volume":"38","author":"U. Schmid","year":"2009","unstructured":"Schmid, U., Weiss, B., Keidar, I.: Impossibility results and lower bounds for consensus under link failures. SIAM Journal on Computing\u00a038(5), 1912\u20131951 (2009)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45174-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T03:21:17Z","timestamp":1598325677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45174-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662451731","9783662451748"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45174-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}