{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:39:10Z","timestamp":1770917950238,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1007\/bf01667080","type":"journal-article","created":{"date-parts":[[2005,5,9]],"date-time":"2005-05-09T07:24:59Z","timestamp":1115623499000},"page":"80-94","source":"Crossref","is-referenced-by-count":152,"title":["Simulating authenticated broadcasts to derive simple fault-tolerant algorithms"],"prefix":"10.1007","volume":"2","author":[{"given":"T. K.","family":"Srikanth","sequence":"first","affiliation":[]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Coan AB (1986) A communication-efficient canonical form for fault-tolerant distributed protocols. Proc Fifth Annu ACM Symp on Principles of Distributed Computing, Calgary, Canada (August 1986), pp. 63\u201372","DOI":"10.1145\/10590.10596"},{"issue":"1","key":"CR2","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 (1):14\u201330","journal-title":"J Algorithms"},{"key":"CR3","unstructured":"Dolev D, Strong HR (1982) Polynomial algorithms for multiple process agreement. Proc 14th Annual ACM Symp Theory Comput, San Francisco, California, (May 1982), pp 404\u2013407"},{"issue":"4","key":"CR4","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"Dolev D, Strong HR (1983) Authenticated algorithms for Byzantine Agreement. SIAM J Comput 12 (4):656\u2013666","journal-title":"SIAM J Comput"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Dolev D, Fischer MJ, Fowler R, Lynch NA, Strong HR (1982) An efficient algorithm for Byzantine Agreement without authentication, Inf Control, vol 52, no 3","DOI":"10.1016\/S0019-9958(82)90776-8"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Fischer MJ (1983) The consensus problem in unreliable distributed systems (A Brief Survey), YALEU\/DCS\/RR-273 (June 1983)","DOI":"10.1007\/3-540-12689-9_99"},{"key":"CR7","unstructured":"Garcia-Molina H, Pittelli F, Davidson S (1984) Applications of Byzantine Agreement in database systems. Tech Rep TR 316, Princeton University (June 1984)"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Halpern JY, Strong HR, Dolev D (1984) Fault-tolerant clock synchronization, Proc Third Annual ACM Symp Principles of Distributed Computing, Vancouver, Canada, (August 1984) pp 89\u2013102","DOI":"10.1145\/800222.806739"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport L, Shostak R, Pease M (1982) The Byzantine Generals problem. ACM Trans Program Lang Syst 4:382\u2013401","journal-title":"ACM Trans Program Lang Syst"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Lundelius J, Lynch N (1984) A new fault-tolerant algorithm for clock synchronization. Proc Third Annual ACM Symp on Principles of Distributed Computing, Vancouver, Canada (August 1984), pp 75\u201388","DOI":"10.1145\/800222.806738"},{"key":"CR11","unstructured":"Lynch N, Fischer M, Fowler R (1982) A simple and efficient lyzantine Generals algorithm. Proc Second IEEE Symp Reliability in Distributed Software and Data Base Systems, Pittsburgh, Pennsylvania, pp 46\u201352"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Merritt M (1984) Elections in the presence of faults. Proc 3rd Symp Principles of Distributed Computing, Vancouver, Canada","DOI":"10.1145\/800222.806741"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Mohan C, Strong HR, Filkenstein S (1983) Method for distributed transaction commit and recovery using Byzantine Agreement within clusters of processors. Proc 2nd Symp Principles of Distributed Computing (August 1983). Montreal, Canada, pp 89\u2013103","DOI":"10.1145\/800221.806712"},{"issue":"2","key":"CR14","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease M, Shostak R, Lamport L (1980) Reaching agreement in the presence of faults. J ACM 27 (2):228\u2013234","journal-title":"J ACM"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"Rabin M (1983) Randomized Byzantine generals. Proc 24th Symp Foundations of Computer Science, Tucson, Arizona (November 1983) pp 403\u2013409","DOI":"10.1109\/SFCS.1983.48"},{"issue":"2","key":"CR16","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21 (2):120\u2013126","journal-title":"Commun ACM"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Srikanth TK, Toueg S (1987) Optimal clock synchronization. Proc 4th Symp Principles of Distributed Computing, Minaki, Canada (August 1985). To appear in the Journal of the ACM (July 1987)","DOI":"10.1145\/28869.28876"},{"key":"CR18","unstructured":"Tanenbaum AS (1981) Computer networks. Prentice-Hall software series"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Toueg S (1984) Randomized asynchronous Byzantine Agreements. Proc 3rd Symp Principles of Distributed Computing, Vancouver, Canada (August 1984)","DOI":"10.1145\/800222.806744"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"Toueg S, Perry KJ, Srikanth TK (1987) Fast distributed agreement. Proc 4th Symp Principles of Distributed Computing, Minaki, Canada (August 1985). Also appeared in SIAM J Comput vol. 16, No. 3, June 1987","DOI":"10.1137\/0216031"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01667080.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01667080\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01667080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T08:36:19Z","timestamp":1586248579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01667080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["BF01667080"],"URL":"https:\/\/doi.org\/10.1007\/bf01667080","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}