{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:25:41Z","timestamp":1726410341941},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176784"},{"type":"electronic","value":"9783642176791"}],"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-17679-1_19","type":"book-chapter","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T18:44:30Z","timestamp":1294253070000},"page":"215-226","source":"Crossref","is-referenced-by-count":0,"title":["A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus in Symmetric Networks"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Baldellon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Achour","family":"Most\u00e9faoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/DSN.2006.22","volume-title":"Int\u2019l Conference on Dependable Systems and Networks (DSN 2006)","author":"M.K. Aguilera","year":"2006","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Consensus with Byzantine Failures and Little System Synchrony. In: Int\u2019l Conference on Dependable Systems and Networks (DSN 2006), pp. 147\u2013155. IEEE Computer Press, Los Alamitos (2006)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"414","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., 414 pages. Wiley-Interscience, Hoboken (2004)","edition":"2"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography. In: Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC 2000), pp. 123\u2013132 (2000)","DOI":"10.1145\/343477.343531"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra, T., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-13284-1_11","volume-title":"Structural Information and Communication Complexity","author":"C. Delporte-Gallet","year":"2010","unstructured":"Delporte-Gallet, C., Devismes, S., Fauconnnier, H., Larrea, M.: Algorithms for Extracting Timeliness Graphs. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol.\u00a06058, pp. 127\u2013141. Springer, Heidelberg (2010)"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the Presence of Partial Synchrony. Journal of the ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of the ACM"},{"issue":"2","key":"19_CR7","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"},{"issue":"1-2","key":"19_CR8","first-page":"162","volume":"15","author":"R. Friedman","year":"2005","unstructured":"Friedman, R., Most\u00e9faoui, A., Raynal, M.: \u22c4 $ {\\cal P}_{mute}$ -Based Consensus for Asynchronous Byzantine Systems. Parallel Processing Letters\u00a015(1-2), 162\u2013182 (2005)","journal-title":"Parallel Processing Letters"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/TDSC.2005.13","volume":"2","author":"R. Friedman","year":"2005","unstructured":"Friedman, R., Most\u00e9faoui, A., Raynal, M.: Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems. IEEE Transactions on Dependable and Secure Computing\u00a02(1), 46\u201356 (2005)","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-77096-1_6","volume-title":"Principles of Distributed Systems","author":"M. Hamouna","year":"2007","unstructured":"Hamouna, M., Most\u00e9faoui, A., Tr\u00e9dan, G.: Byzantine Consensus with Few Synchronous Links. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol.\u00a04878, pp. 76\u201389. Springer, Heidelberg (2007)"},{"key":"19_CR11","unstructured":"Hamouna, M., Most\u00e9faoui, A., Tr\u00e9dan, G.: Byzantine Consensus in Signature-free Systems. Submitted to publication"},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostack, 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"},{"key":"19_CR13","first-page":"872","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms, 872 pages. Morgan Kaufmann Pub., San Francisco (1996)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Okun, M.: Byzantine Agreement. Springer Encyclopedia of Algorithms, pp. 116\u2013119 (2008)","DOI":"10.1007\/978-0-387-30162-4_60"},{"key":"19_CR15","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. JACM\u00a027, 228\u2013234 (1980)","journal-title":"JACM"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Fault-tolerant Agreement in Synchronous Message-passing Systems. In: Morgan & Claypool, 167 pages (September 2010)","DOI":"10.2200\/S00294ED1V01Y201009DCT003"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17679-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T16:09:11Z","timestamp":1559923751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17679-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642176784","9783642176791"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17679-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}