{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:48Z","timestamp":1766281008891},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1990,10]]},"DOI":"10.1016\/0020-0190(90)90185-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"45-49","source":"Crossref","is-referenced-by-count":24,"title":["The best of both worlds: guaranteeing termination in fast randomized byzantine agreement protocols"],"prefix":"10.1016","volume":"36","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[]},{"given":"Erez","family":"Petrank","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90185-Z_BIB1_1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/800221.806707","article-title":"Advantages of free choice: Completely asynchronous agreement protocols","author":"Ben-Or","year":"1983","journal-title":"Proc. ACM Symposium on Principles of Distributed Computing"},{"issue":"4","key":"10.1016\/0020-0190(90)90185-Z_BIB2","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1145\/31846.42229","article-title":"An O(log n) expected rounds randomized Byzantine generals protocol","volume":"34","author":"Bracha","year":"1987","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/0020-0190(90)90185-Z_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1985.232245","article-title":"A simple and efficient randomized Byzantine Agreement algorithm","volume":"11","author":"Chor","year":"1985","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0020-0190(90)90185-Z_BIB4","first-page":"443","article-title":"Randomization in Byzantine Agreement","volume":"Vol. 5","author":"Chor","year":"1989"},{"key":"10.1016\/0020-0190(90)90185-Z_BIB5","doi-asserted-by":"crossref","DOI":"10.1145\/323596.323610","article-title":"Simple constant-time consensus protocols in realistic failure models","author":"Chor","year":"1985","journal-title":"Proc. ACM Symposium on Principles of Distributed Computing"},{"key":"10.1016\/0020-0190(90)90185-Z_BIB6","article-title":"Simultaneity is harder than agreement","author":"Coan","year":"1986","journal-title":"Proc. 5th IEEE Symposium on Reliability in Distributed Software and Database Systems"},{"key":"10.1016\/0020-0190(90)90185-Z_BIB7","first-page":"148","article-title":"Optimal algorithms for Byzantine Agreement","author":"Feldman","year":"1988","journal-title":"Proc. 29th IEEE Annual Symposium on Foundations of Computer Science"},{"issue":"4","key":"10.1016\/0020-0190(90)90185-Z_BIB8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","article-title":"A lower bound for the time to assure interactive consistency","volume":"14","author":"Fischer","year":"1982","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/0020-0190(90)90185-Z_BIB9","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty process","volume":"32","author":"Fischer","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(90)90185-Z_BIB10","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1988.21941","article-title":"Coordinated traversal: (t + 1)-round Byzantine Agreement in polynomial time","author":"Moses","year":"1988","journal-title":"Proc. 29th IEEE Annual Symposium on Foundations of Computer Science"},{"issue":"2","key":"10.1016\/0020-0190(90)90185-Z_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/322186.322188","article-title":"Reaching agreement in the presence of faults","volume":"27","author":"Pease","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(90)90185-Z_BIB12","first-page":"403","article-title":"Randomized Byzantine generals","author":"Rabin","year":"1983","journal-title":"Proc. 24th IEEE Annual Symposium on Foundations of Computer Science"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090185Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090185Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T19:19:31Z","timestamp":1681845571000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090185Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["002001909090185Z"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90185-z","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}