{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:46:18Z","timestamp":1777376778039,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642176524","type":"print"},{"value":"9783642176531","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17653-1_13","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T05:50:47Z","timestamp":1291614647000},"page":"143-158","source":"Crossref","is-referenced-by-count":9,"title":["Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value"],"prefix":"10.1007","author":[{"given":"Achour","family":"Most\u00e9faoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Frolund, S., Hadzilacos, V., Horn, S., Toueg, S.: Abortable and Query-abortable Objects and their Efficient Implementation. In: Proc. 26th Annual ACM Symposium on Principles of Distributed Computing (PODC 2007), pp. 23\u201332 (2007)","DOI":"10.1145\/1281100.1281107"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/278298.278304","volume":"45","author":"J. Aspnes","year":"1998","unstructured":"Aspnes, J.: Lower Bounds for Distributed Coin Flipping and Randomized Consensus. JACM\u00a045(3), 420\u2013450 (1998)","journal-title":"JACM"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/800221.806707","volume-title":"Proc. 2nd ACM Symposium on Principles of Distributed Computing (PODC 1983)","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. In: Proc. 2nd ACM Symposium on Principles of Distributed Computing (PODC 1983), pp. 27\u201330. ACM Press, New York (1983)"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G. Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous Byzantine Agreement Protocols. Information & Computation\u00a075(2), 130\u2013143 (1987)","journal-title":"Information & Computation"},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G. Bracha","year":"1985","unstructured":"Bracha, G., Toueg, S.: Asynchronous Consensus and Broadcast Protocols. Journal of the ACM\u00a032(4), 824\u2013840 (1985)","journal-title":"Journal of the ACM"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-44743-1_4","volume-title":"Parallel Computing Technologies","author":"F. Brasileiro","year":"2001","unstructured":"Brasileiro, F., Greve, F., Most\u00e9faoui, A., Raynal, M.: Consensus in One Communication Step. In: Malyshkin, V.E. (ed.) PaCT 2001. LNCS, vol.\u00a02127, pp. 42\u201350. Springer, Heidelberg (2001)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography. In: Proc. 19th Annual ACM Symp. on Principles of Distributed Computing (PODC 2000), pp. 123\u2013132 (2000)","DOI":"10.1145\/343477.343531"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-44647-8_31","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"C. Cachin","year":"2001","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 524\u2013541. Springer, Heidelberg (2001)"},{"issue":"2","key":"13_CR9","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. JACM\u00a043(2), 225\u2013267 (1996)","journal-title":"JACM"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1093\/comjnl\/bxh145","volume":"49","author":"M. Correia","year":"2006","unstructured":"Correia, M., Ferreira Neves, N., Verissimo, P.: From Consensus to Atomic Broadcast: Time-free Byzantine-Resistant Protocols without Signatures. The Computer J.\u00a049(1), 82\u201396 (2006)","journal-title":"The Computer J."},{"issue":"2","key":"13_CR11","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. JACM\u00a035(2), 288\u2013323 (1988)","journal-title":"JACM"},{"issue":"2","key":"13_CR12","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":"13_CR13","first-page":"162","volume":"20","author":"R. Friedman","year":"2005","unstructured":"Friedman, R., Most\u00e9faoui, A., Raynal, M.: $\\Diamond {\\cal P}_{mute}$ -Based Consensus for Asynchronous Byzantine Systems. Parallel Processing Letters\u00a020(1-2), 162\u2013182 (2005)","journal-title":"Parallel Processing Letters"},{"issue":"1","key":"13_CR14","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"},{"issue":"3","key":"13_CR15","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"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1093\/comjnl\/46.1.16","volume":"46","author":"K.P. Kihlstrom","year":"2003","unstructured":"Kihlstrom, K.P., Moser, L.E., Melliar-Smith, P.M.: Byzantine Fault Detectors for Solving Consensus. The Computer Journal\u00a046(1), 16\u201335 (2003)","journal-title":"The Computer Journal"},{"issue":"3","key":"13_CR17","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., Alvizi, L.: Fast Byzantine Consensus. IEEE Transactions on Dependable and Secure Computing\u00a03(3), 202\u2013220 (2006)","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-48169-9_4","volume-title":"Distributed Computing","author":"A. Most\u00e9faoui","year":"1999","unstructured":"Most\u00e9faoui, A., Raynal, M.: Solving Consensus Using Chandra-Toueg\u2019s Unreliable Failure Detectors: a General Quorum-Based Approach. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol.\u00a01693, pp. 49\u201363. Springer, Heidelberg (1999)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui, A., Raynal, M.: Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value. Tech. Report #1954, IRISA, Universit\u00e9 de Rennes, France (2010)","DOI":"10.1007\/978-3-642-17653-1_13"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0020-0190(00)00027-2","volume":"73","author":"A. Most\u00e9faoui","year":"2000","unstructured":"Most\u00e9faoui, A., Raynal, M., Tronel, F.: From Binary Consensus to Multivalued Consensus in Asynchronous Message-Passing Systems. Inf. Processing Letters\u00a073, 207\u2013213 (2000)","journal-title":"Inf. Processing Letters"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Okun, M.: Byzantine Agreement. In: Springer Encyclopedia of Algorithms, pp. 116\u2013119 (2008)","DOI":"10.1007\/978-0-387-30162-4_60"},{"key":"13_CR22","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":"13_CR23","first-page":"116","volume-title":"Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS 1983)","author":"M. Rabin","year":"1983","unstructured":"Rabin, M.: Randomized Byzantine Generals. In: Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS 1983), pp. 116\u2013124. IEEE Computer Society Press, Los Alamitos (1983)"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-87779-0_30","volume-title":"Distributed Computing","author":"Y.J. Song","year":"2008","unstructured":"Song, Y.J., van Renesse, R.: Bosco: One-Step Byzantine Asynchronous Consensus. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 438\u2013450. Springer, Heidelberg (2008)"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T.K. Srikanth","year":"1987","unstructured":"Srikanth, T.K., Toueg, S.: Simulating Authenticated Broadcasts to Derive Simple Fault-tolerant Algorithms. Distributed Computing\u00a02, 80\u201394 (1987)","journal-title":"Distributed Computing"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Toueg, S.: Randomized Byzantine Agreement. In: Proc. 3rd Annual ACM Symposium on Principles of Distributed Computing (PODC 1984), pp. 163\u2013178 (1984)","DOI":"10.1145\/800222.806744"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R. Turpin","year":"1984","unstructured":"Turpin, R., Coan, B.A.: Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement. Information Processing Letters\u00a018, 73\u201376 (1984)","journal-title":"Information Processing Letters"}],"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-17653-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T20:51:35Z","timestamp":1559854295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}