{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:51:30Z","timestamp":1725493890637},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665311"},{"type":"electronic","value":"9783540481690"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48169-9_9","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T05:36:33Z","timestamp":1194240993000},"page":"123-139","source":"Crossref","is-referenced-by-count":9,"title":["Byzantine Agreement Secure against General Adversaries in the Dual Failure Model"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Altmann","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Fitzi","sequence":"additional","affiliation":[]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, D. Dolev, C. Dwork, and H. R. Strong. Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 42\u201351, Vancouver, British Columbia, Canada, 10\u201312 Aug. 1987.","DOI":"10.1145\/41840.41844"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"P. Berman, J. A. Garay, and K. J. Perry. Towards optimal distributed consensus (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, pp. 410\u2013415, Research Triangle Park, North Carolina, 30 Oct.\u20131 Nov. 1989. IEEE.","DOI":"10.1109\/SFCS.1989.63511"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0890-5401(92)90004-Y","volume":"97","author":"B. A. Coan","year":"1992","unstructured":"B. A. Coan and J. L. Welch. Modular construction of a Byzantine agreement protocol with optimal message bit complexity. Information and Computation, 97(1):61\u201385, Mar. 1992.","journal-title":"Information and Computation"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0019-9958(82)90776-8","volume":"52","author":"D. Dolev","year":"1982","unstructured":"D. Dolev, M. J. Fischer, R. Fowler, N. A. Lynch, and H. R. Strong. An efficient algorithm for Byzantine agreement without authentication. Information and Control, 52(3):257\u2013274, Mar. 1982.","journal-title":"Information and Control"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"P. Feldman and S. Micali. Optimal algorithms for Byzantine agreement. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 148\u2013161, 1988.","DOI":"10.1145\/62212.62225"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BFb0056479","volume":"1499","author":"M. Fitzi","year":"1998","unstructured":"M. Fitzi and U. Maurer. Efficient Byzantine agreement secure against general adversaries. In Distributed Computing \u2014 DISC, volume 1499, pp. 134\u2013148, 1998.","journal-title":"Distributed Computing \u2014 DISC"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"J. A. Garay and Y. Moses. Fully polynomial Byzantine agreement in t + 1 rounds (extended abstract). In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 31\u201341, San Diego, California, 16\u201318 May 1993.","DOI":"10.1145\/167088.167101"},{"key":"9_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-56188-9_11","volume-title":"Distributed Algorithms, 6th International Workshop, WDAG\u2019 92","author":"J. A. Garay","year":"1992","unstructured":"J. A. Garay and K. J. Perry. A continuum of failure models for distributed computing. In A. Segall and S. Zaks, editors, Distributed Algorithms, 6th International Workshop, WDAG\u2019 92, volume 647 of Lecture Notes in Computer Science, pp. 153\u2013165, Haifa, Israel, 2\u20134 Nov. 1992. Springer."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation. In Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC), pp. 25\u201334, Aug. 1997.","DOI":"10.1145\/259380.259412"},{"key":"9_CR10","volume-title":"Byzantine generals and transaction commit protocols","author":"L. Lamport","year":"1982","unstructured":"L. Lamport and M. J. Fischer. Byzantine generals and transaction commit protocols. Technical report, SRI International (Menlo Park CA), TR, 1982."},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382\u2013401, July 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228\u2013234, Apr. 1980.","journal-title":"Journal of the ACM"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/0216031","volume":"16","author":"S. Toueg","year":"1987","unstructured":"S. Toueg, K. J. Perry, and T. K. Srikanth. Fast distributed agreement. SIAM Journal on Computing, 16(3):445\u2013457, June 1987.","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\/3-540-48169-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T05:05:54Z","timestamp":1556946354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48169-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665311","9783540481690"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48169-9_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}