{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T06:54:05Z","timestamp":1758264845584},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf01187076","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T14:19:50Z","timestamp":1108736390000},"page":"131-154","source":"Crossref","is-referenced-by-count":8,"title":["Modular construction of an efficient 1-bit Byzantine agreement protocol"],"prefix":"10.1007","volume":"26","author":[{"given":"Brian A.","family":"Coan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer L.","family":"Welch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01798957","volume":"4","author":"A. Bar-Noy","year":"1991","unstructured":"Bar-Noy, A., and Dolov, D. (1991), Consensus algorithms with one-bit messages,Distrib. Comput.4, 105?110.","journal-title":"Distrib. Comput"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Herman, P., Garay, J. A., and Perry, K. J. (1989), Recursive Phase King Protocols for Distributed Consensus, Technical Report CS-89-24, Department of Computer Science, Pennsylvania State University.","DOI":"10.1109\/SFCS.1989.63511"},{"key":"CR3","unstructured":"Coan, B. A. (1988), Efficient agreement using fault diagnosis, inProceedings of the 26th Allerton Conference on Communication, Control, and Computing, pp. 663?672."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0890-5401(92)90004-Y","volume":"97","author":"B. A. Coan","year":"1992","unstructured":"Coan, B. A., and Welch, J. L. (1992), Modular construction of a Byzantine agreement protocol with optimal message bit complexity,Inform, and Comput.97, 61?85.","journal-title":"Inform, and Comput"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D. (1982), The Byzantine generals strike again,J. Algorithms 3, 14?30.","journal-title":"J. Algorithms"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D. Dolev","year":"1985","unstructured":"Dolev, D., and Reischuk, R. (1985), Bounds on information exchange for Byzantine agreement,J. Assoc. Comput. Mach. 32, 191?204.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M. J. Fischer","year":"1982","unstructured":"Fischer, M. J., and Lynch, N. A. (1982), A lower bound for the time to assure interactive consistency,Inform, Process. Lett. 14, 183?186.","journal-title":"Inform, Process. Lett."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"M. J. Fischer","year":"1986","unstructured":"Fischer, M. J., Lynch, N. A., and Merritt, M. (1986), Easy impossibility proofs for distributed consensus problems,Distrib. Comput. 1, 26?39.","journal-title":"Distrib. Comput."},{"key":"CR9","unstructured":"Hadzilacos, V., and Halpern, J. Y. (1993), Message-optimal protocols for Byzantine Agreement,Math. Systems Theory, this issue, pp. 41?102."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R. E., and Pease, M. (1982), The Byzantine generals problem,ACM Trans. Program. Lang. Systems 4, 382?401.","journal-title":"ACM Trans. Program. Lang. Systems"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R. E., and Lamport, L. (1980), Reaching agreement in the presence of faults,J Assoc. Comput. Mach. 27, 228?234.","journal-title":"J Assoc. Comput. Mach."},{"key":"CR12","unstructured":"Perry, K. (1985), Early Stopping Protocols for Fault-Tolerant Distributed Agreement, Ph.D. Thesis, Department of Computer Science, Cornell University. (Also available as technical report TR-85-662.)"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R. Turpin","year":"1984","unstructured":"Turpin, R., and Coan, B. A. (1984), Extending binary Byzantine agreement to multivalued Byzantine agreement,Inform. Process. Lett. 18, 73?76.","journal-title":"Inform. Process. Lett."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01187076\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:07:25Z","timestamp":1586120845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01187076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01187076"],"URL":"https:\/\/doi.org\/10.1007\/bf01187076","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}