{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:47:31Z","timestamp":1725619651417},"publisher-location":"London","reference-count":11,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540760702"},{"type":"electronic","value":"9781447109372"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/978-1-4471-0937-2_38","type":"book-chapter","created":{"date-parts":[[2011,10,10]],"date-time":"2011-10-10T15:23:02Z","timestamp":1318260182000},"page":"404-413","source":"Crossref","is-referenced-by-count":1,"title":["Byzantine Agreement with Limited Authentication"],"prefix":"10.1007","author":[{"given":"Malte","family":"Borcherding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","first-page":"42","volume-title":"Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement","author":"DD Amotz Bar-Noy","year":"1987","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, Canada, 1987."},{"key":"38_CR2","first-page":"78","volume-title":"Efficient failure discovery with limited authentication","author":"M Borcherding","year":"1995","unstructured":"Malte Borcherding. Efficient failure discovery with limited authentication. In Proceedings of the 15th International Conference on Distributed Computing Systems (ICDCS), pages 78\u201382, Vancouver, Canada, 1995. IEEE Computer Society Press."},{"issue":"1","key":"38_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D Danny","year":"1982","unstructured":"Danny Dolev. The Byzantine generals strike again. Journal of Algorithms, 3(1):14\u201330, 1982.","journal-title":"Journal of Algorithms"},{"issue":"5","key":"38_CR4","first-page":"656","volume":"12","author":"D Danny","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"},{"key":"38_CR5","volume-title":"A mutiple bus braodcast protocol resilient to non-cooperative Byzantine faults","author":"E Klaus","year":"1996","unstructured":"Klaus Echtle and Asif Masum. A mutiple bus braodcast protocol resilient to non-cooperative Byzantine faults. In Proceedings of the 26th International Symposium on Fault-Tolerant Computing (FTCS). IEEE Computer Society Press, 1996."},{"key":"38_CR6","volume-title":"Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults","author":"G Li","year":"1995","unstructured":"Li Gong, Patrick Lincoln, and John Rushby. Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults. In Proceedings of the Fifth Dependable Computing for Critical Applications (DCCA-5), 1995."},{"key":"38_CR7","first-page":"26","volume-title":"Lower bounds on messages and rounds for network authentication protocols","author":"G Li","year":"1993","unstructured":"Li Gong. Lower bounds on messages and rounds for network authentication protocols. In Proceedings of the 1st Conf. Computer and Comm. Security, pages 26\u201336. ACM, 1993."},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF01187075","volume":"26","author":"H Vassos","year":"1993","unstructured":"Vassos Hadzilacos and Joseph Y. Halpern. The Failure Discovery problem. Math. Systems Theory, 26:103\u2013129, 1993.","journal-title":"Math. Systems Theory"},{"issue":"3","key":"38_CR9","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Leslie","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"},{"issue":"7","key":"38_CR10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/129902.129904","volume":"35","author":"National Institute of Standards and Technology. The Digital Signature Standard","year":"1992","unstructured":"National Institute of Standards and Technology. The Digital Signature Standard. Communications of the ACM, 35(7):36\u201340, July 1992.","journal-title":"Communications of the ACM"},{"issue":"2","key":"38_CR11","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120\u2013126, February 1978.","journal-title":"Communications of the ACM"}],"container-title":["Safe Comp 96"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-0937-2_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:57:35Z","timestamp":1619830655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-0937-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540760702","9781447109372"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-0937-2_38","relation":{},"subject":[],"published":{"date-parts":[[1997]]}}}