{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:12:58Z","timestamp":1725541978210},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108761"},{"type":"electronic","value":"9783642108778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10877-8_12","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T02:11:04Z","timestamp":1259719864000},"page":"129-143","source":"Crossref","is-referenced-by-count":2,"title":["Enhanced Fault-Tolerance through Byzantine Failure Detection"],"prefix":"10.1007","author":[{"given":"Rida A.","family":"Bazzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Fischer, M., Lynch, N., Paterson, M.: Impossibility of distributed commit with one faulty process. Journal of the ACM\u00a032(2) (April 1985)","DOI":"10.1145\/3149.214121"},{"issue":"4","key":"12_CR2","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."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols. In: PODC, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: STOC, pp. 148\u2013161 (1988)","DOI":"10.1145\/62212.62225"},{"key":"12_CR5","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)"},{"issue":"2","key":"12_CR6","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. JACM\u00a043(2), 225\u2013267 (1996)","journal-title":"JACM"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D. Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. JACM\u00a033(3), 499\u2013516 (1986)","journal-title":"JACM"},{"key":"12_CR8","first-page":"102","volume":"0","author":"J. Widder","year":"2007","unstructured":"Widder, J., Gridling, G., Weiss, B., Blanquart, J.-P.: Synchronous consensus with mortal byzantines. DSN\u00a00, 102\u2013112 (2007)","journal-title":"DSN"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"J.R. Douceur","year":"2002","unstructured":"Douceur, J.R.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 251\u2013260. Springer, Heidelberg (2002)"},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00446-006-0012-y","volume":"19","author":"R.A. Bazzi","year":"2007","unstructured":"Bazzi, R.A., Konjevod, G.: On the establishment of distinct identities in overlay networks. Distributed Computing\u00a019(4), 267\u2013287 (2007)","journal-title":"Distributed Computing"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Yu, H., Gibbons, P.B., Kaminsky, M., Xiao, F.: Sybillimit: A near-optimal social network defense against sybil attacks. In: IEEE Symposium on Security and Privacy, pp. 3\u201317 (2008)","DOI":"10.1109\/SP.2008.13"},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M.C. Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. JACM\u00a027(2), 228\u2013234 (1980)","journal-title":"JACM"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BFb0035753","volume-title":"ICALP","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)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-48046-3_3","volume-title":"Reliable Software Technologies - Ada-Europe 2002","author":"A. Doudou","year":"2002","unstructured":"Doudou, A., Garbinato, B., Guerraoui, R.: Encapsulating failure detection: From crash to byzantine failures. In: Blieberger, J., Strohmeier, A. (eds.) Ada-Europe 2002. LNCS, vol.\u00a02361, pp. 24\u201350. Springer, Heidelberg (2002)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Herlihy, M., Kouznetsov, P., Lynch, N.A., Newport, C.C.: On the weakest failure detector ever. In: PODC, pp. 235\u2013243 (2007)","DOI":"10.1145\/1281100.1281135"},{"key":"12_CR16","unstructured":"Li, J., Mazi\u00e8res, D.: Beyond one-third faulty replicas in byzantine fault tolerant systems. In: NSDI (2007)"},{"issue":"6","key":"12_CR17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1145\/1323293.1294280","volume":"41","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. SIGOPS Oper. Syst. Rev.\u00a041(6), 189\u2013204 (2007)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Thambidurai, P.M., Park, Y.-K.: Interactive consistency with multiple failure modes. In: SRDS, pp. 93\u2013100 (1988)","DOI":"10.1109\/RELDIS.1988.25784"},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/71.491575","volume":"7","author":"H.S. Siu","year":"1996","unstructured":"Siu, H.S., Chin, Y.H., Yang, W.P.: A note on consensus on dual failure modes. IEEE Transactions on Parallel and Distributed Systems\u00a07(3), 225\u2013230 (1996)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Anceaume, E., Delporte-Gallet, C., Fauconnier, H., Hurfin, M., Le Lann, G.: Designing modular services in the scattered byzantine failure model. In: ISPDC, pp. 262\u2013269 (2004)","DOI":"10.1109\/ISPDC.2004.18"}],"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-10877-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:36:19Z","timestamp":1606167379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10877-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108761","9783642108778"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10877-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}