{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:46:01Z","timestamp":1764132361798},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650669"},{"type":"electronic","value":"9783540496939"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/bfb0056479","type":"book-chapter","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T04:37:41Z","timestamp":1154234261000},"page":"134-148","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Efficient Byzantine agreement secure against general adversaries"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Fitzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"key":"12_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, pages 42\u201351, 1987.","DOI":"10.1145\/41840.41844"},{"key":"12_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, pages 410\u2013415. IEEE, 1989.","DOI":"10.1109\/SFCS.1989.63511"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pages 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pages 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, and U. Maurer. Span programs and general secure multi-party computation, Manuscript, 1998.","DOI":"10.7146\/brics.v4i28.18954"},{"issue":"3","key":"12_CR6","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, March 1982.","journal-title":"Information and Control"},{"issue":"4","key":"12_CR7","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. A lower bound on the time to assure interactive consistency. Information Processing Letters, 14(4):183\u2013186, 1982.","journal-title":"Information Processing Letters"},{"key":"12_CR8","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), pages 148\u2013161, 1988.","DOI":"10.1145\/62212.62225"},{"key":"12_CR9","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, pages 31\u201341, 1993.","DOI":"10.1145\/167088.167101"},{"key":"12_CR10","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), pages 25\u201334, August 1997.","DOI":"10.1145\/259380.259412"},{"issue":"3","key":"12_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"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"D. Malkhi and M. Reiter. Byzantine quorum systems. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 569\u2013578, 1997.","DOI":"10.1145\/258533.258650"},{"issue":"2","key":"12_CR13","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, April 1980.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T14:43:07Z","timestamp":1578494587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056479"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650669","9783540496939"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0056479","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"2 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}