{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:51:31Z","timestamp":1761292291458,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020438","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:21:02Z","timestamp":1131862862000},"page":"253-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Reaching (and maintaining) agreement in the presence of mobile faults"],"prefix":"10.1007","author":[{"given":"Juan A.","family":"Garay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, D. Dolev, C. Dwork and H.R. Strong, \u201cShifting gears: changing algorithms on the fly to expedite Byzantine Agreement,\u201d Proc. 6th PODC, pp. 42\u201351, August 1987.","DOI":"10.1145\/41840.41844"},{"key":"19_CR2","first-page":"80","volume":"372","author":"P. Berman","year":"1989","unstructured":"P. Berman and J.A. Garay, \u201cAsymptotically Optimal Distributed Consensus,\u201d Proc. ICALP 89, LNCS Vol. 372, pp. 80\u201394, July 1989.","journal-title":"LNCS"},{"key":"19_CR3","unstructured":"R. Canetti and A. Herzberg, \u201cMaintaining Security in the Presence of Transient Faults,\u201d to appear in Proc. Crypto 94."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"T.D. Chandra and S. Toueg, \u201cUnreliable Failure Detectors for Asynchronous Systems, \u201d Proc. 10th PODC, pp. 325\u2013340, August 1991.","DOI":"10.1145\/112600.112627"},{"issue":"11","key":"19_CR5","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"E.W. Dijkstra, \u201cSelf-stabilizing systems in spite of distributed control,\u201d Communications of the ACM, 17(11), pp. 643\u2013644, 1974.","journal-title":"Communications of the ACM"},{"issue":"No.2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0890-5401(90)90014-9","volume":"88","author":"C. Dwork","year":"1990","unstructured":"C. Dwork and Y. Moses, \u201cKnowledge and Common Knowledge in a in Byzantine Environment: Crash Failures,\u201d Information and Computation, Vol. 88, No. 2 (1990), pp. 156\u2013186.","journal-title":"Information and Computation"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"D. Dolev and H.R. Strong, \u201cPolynomial Algorithms for Multiple Processor Agreement,\u201d Proc. 14th STOC, pp. 401\u2013407, May 1982.","DOI":"10.1145\/800070.802215"},{"issue":"No.4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M. J. Fischer","year":"1982","unstructured":"M. J. Fischer and N. A. Lynch, \u201cA Lower Bound for the Time to Assure Interactive Consistency,\u201d Information Processing Letters, Vol. 14, No. 4 (1982), pp. 183\u2013186.","journal-title":"Information Processing Letters"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"P. Feldman and S. Micali, \u201cOptimal Algorithms for Byzantine Agreement,\u201d Proc. 20th STOC, pp. 148\u2013161, May 1988.","DOI":"10.1145\/62212.62225"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"M. Franklin and M. Yung, \u201cEavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems,\u201d Proc. 34th FOCS, pp. 670\u2013679, November 1993.","DOI":"10.1109\/SFCS.1993.366820"},{"issue":"No.3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"L. Lamport, R.E. Shostak and M. Pease, \u201cThe Byzantine Generals Problem,\u201d ACM ToPLaS, Vol. 4, No. 3 (1982), pp. 382\u2013401.","journal-title":"ACM ToPLaS"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and M. Yung, \u201cHow to withstand mobile virus attacks,\u201d Proc. 10th PODC, pp. 51\u201359, 1991.","DOI":"10.1145\/112600.112605"},{"issue":"No.2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"M. Pease, R. Shostak and L. Lamport, \u201cReaching Agreement in the Presence of Faults,\u201d JACM, Vol. 27, No. 2 (1980), pp. 121\u2013169.","journal-title":"JACM"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0019-9958(85)80042-5","volume":"64","author":"R. Reischuk","year":"1985","unstructured":"R. Reischuk, \u201cA New Solution for the Byzantine Generals Problem,\u201d Information and Control, Vol. 64 (1985), pp. 23\u201342.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:01:37Z","timestamp":1736082097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020438"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0020438","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}