{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:52Z","timestamp":1725455692539},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602743"},{"type":"electronic","value":"9783540447832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0022150","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:19:52Z","timestamp":1131862792000},"page":"230-241","source":"Crossref","is-referenced-by-count":3,"title":["On the number of authenticated rounds in Byzantine Agreement"],"prefix":"10.1007","author":[{"given":"Malte","family":"Borcherding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, and H. Raymond Strong. Shifting gears: Changing algorithms on the fly to expedite Byzantine Agreement. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC), pages 42\u201351, Vancouver, 1987.","DOI":"10.1145\/41840.41844"},{"issue":"5","key":"16_CR2","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D. Dolev","year":"1983","unstructured":"Danny Dolev and Raymond Strong. Authenticated algorithms for Byzantine Agreement. SIAM Journal of Computing, 12(5):656\u2013666, November 1983.","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M. J. Fischer","year":"1982","unstructured":"Michael J. Fischer and Nancy A. Lynch. A lower bound for the time to assure interactive consistency. Information Processing Letters, 14(4):183\u2013186, 1982.","journal-title":"Information Processing Letters"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine Generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382\u2013401, 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022150","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T10:54:22Z","timestamp":1549277662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602743","9783540447832"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/bfb0022150","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}