{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:08Z","timestamp":1740109268639,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T00:00:00Z","timestamp":1623283200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T00:00:00Z","timestamp":1623283200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100018707","name":"Technion Hiroshi Fujiwara cyber security research center","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100018707","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["2061\/19"],"award-info":[{"award-number":["2061\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]},{"name":"U.S.-Israel Binational Science Foundation","award":["2015820"],"award-info":[{"award-number":["2015820"]}]},{"name":"Jacobs fellowship"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s00446-021-00393-8","type":"journal-article","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T07:07:21Z","timestamp":1623308841000},"page":"395-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimistically tuning synchronous byzantine consensus: another win for null messages"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2158-161X","authenticated-orcid":false,"given":"Guy","family":"Goren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoram","family":"Moses","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,10]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D.: Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity. In: Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing (STOC), pp. 605\u2013614. ACM, (2015)","key":"393_CR1","DOI":"10.1145\/2746539.2746581"},{"issue":"4","key":"393_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02277665","volume":"5","author":"ES Amdur","year":"1992","unstructured":"Amdur, E.S., Weber, S.M., Hadzilacos, V.: On the message complexity of binary byzantine agreement under crash failures. Distrib. Comput. 5(4), 175\u2013186 (1992)","journal-title":"Distrib. Comput."},{"issue":"2","key":"393_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0890-5401(92)90035-E","volume":"97","author":"A Bar-Noy","year":"1992","unstructured":"Bar-Noy, A., Dolev, D., Dwork, C., Raymond Strong, H.: Shifting gears: Changing algorithms on the fly to expedite byzantine agreement. Inf. Comput. 97(2), 205\u2013233 (1992)","journal-title":"Inf. Comput."},{"issue":"2","key":"393_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2542181","volume":"61","author":"I Ben-Zvi","year":"2014","unstructured":"Ben-Zvi, I.: Moses, Yoram: Beyond lamport\u2019s happened-before: On time bounds and the ordering of events in distributed systems. J. ACM (JACM) 61(2), 13 (2014)","journal-title":"J. ACM (JACM)"},{"doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Optimal early stopping in distributed consensus. In: Proceedings of the International Workshop on Distributed Algorithms (WDAG), pp. 221\u2013237. Springer (1992)","key":"393_CR5","DOI":"10.1007\/3-540-56188-9_15"},{"unstructured":"Castro, M., Liskov, B., et\u00a0al.: Practical byzantine fault tolerance. In: OSDI, vol. 99, pp. 173\u2013186 (1999)","key":"393_CR6"},{"issue":"1","key":"393_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/BF01843569","volume":"1","author":"KM Chandy","year":"1986","unstructured":"Chandy, K.M., Misra, J.: How processes learn. Distrib. Comput. 1(1), 40\u201352 (1986)","journal-title":"Distrib. Comput."},{"issue":"1","key":"393_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s00446-008-0056-2","volume":"21","author":"G Chockler","year":"2008","unstructured":"Chockler, G., Demirbas, M., Gilbert, S., Lynch, N., Newport, C., Nolte, T.: Consensus and collision detectors in radio networks. Distrib. Comput. 21(1), 55\u201384 (2008)","journal-title":"Distrib. Comput."},{"key":"393_CR9","volume-title":"The Wondrous Tale of Alroy: The Rise of Iskander","author":"B Disraeli","year":"1833","unstructured":"Disraeli, B.: The Wondrous Tale of Alroy: The Rise of Iskander, vol. 2. Carey, Lea and Blanchard, Philadelphia (1833)"},{"issue":"1","key":"393_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for byzantine agreement. J. ACM (JACM) 32(1), 191\u2013204 (1985)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"393_CR11","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D Dolev","year":"1990","unstructured":"Dolev, D., Reischuk, R., Raymond Strong, H.: Early stopping in byzantine agreement. J. ACM (JACM) 37(4), 720\u2013741 (1990)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"393_CR12","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Raymond Strong, H.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Dwork, C., Skeen, D.: The inherent cost of nonblocking commitment. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 1\u201311. ACM, (1983)","key":"393_CR13","DOI":"10.1145\/800221.806705"},{"key":"393_CR14","volume-title":"Reasoning About Knowledge","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge, Mass (2003)"},{"issue":"4","key":"393_CR15","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P Feldman","year":"1997","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J. Comput. 26(4), 873\u2013933 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"393_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"MJ Fischer","year":"1982","unstructured":"Fischer, M.J., Lynch, N.A.: A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14(4), 183\u2013186 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"6\u20137","key":"393_CR17","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.tcs.2008.10.008","volume":"410","author":"S Gilbert","year":"2009","unstructured":"Gilbert, S., Guerraoui, R., Newport, C.: Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks. Theoret. Comput. Sci. 410(6\u20137), 546\u2013569 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"393_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3377883","volume":"67","author":"G Goren","year":"2020","unstructured":"Goren, G., Moses, Y.: Silence. J. ACM (JACM) 67(1), 1\u201326 (2020)","journal-title":"J. ACM (JACM)"},{"doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Wang, J.: How fast can a distributed transaction commit? In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS), pp. 107\u2013122. ACM, (2017)","key":"393_CR19","DOI":"10.1145\/3034786.3034799"},{"issue":"1","key":"393_CR20","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF01187075","volume":"26","author":"V Hadzilacos","year":"1993","unstructured":"Hadzilacos, V., Halpern, J.Y.: The failure discovery problem. Math. Syst. Theory 26(1), 103\u2013129 (1993)","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"393_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01187074","volume":"26","author":"V Hadzilacos","year":"1993","unstructured":"Hadzilacos, V., Halpern, J.Y.: Message-optimal protocols for byzantine agreement. Math. Syst. Theory 26(1), 41\u2013102 (1993)","journal-title":"Math. Syst. Theory"},{"issue":"3","key":"393_CR22","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"JY Halpern","year":"1990","unstructured":"Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. J. ACM 37(3), 549\u2013587 (1990). A preliminary version appeared in Proc. 3rd ACM PODC, 1984","journal-title":"J. ACM"},{"unstructured":"IEEE: IEEE standard for ethernet. IEEE 802.3, (2012)","key":"393_CR23"},{"issue":"2","key":"393_CR24","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/504192.504195","volume":"32","author":"I Keidar","year":"2001","unstructured":"Keidar, I., Rajsbaum, S.: On the cost of fault-tolerant consensus when there are no faults: preliminary version. ACM SIGACT News 32(2), 45\u201363 (2001)","journal-title":"ACM SIGACT News"},{"doi-asserted-by":"crossref","unstructured":"Kogan, A., Petrank, E.: A methodology for creating fast wait-free data structures. In: ACM SIGPLAN Notices, Vol.\u00a047, pp. 141\u2013150. ACM (2012)","key":"393_CR25","DOI":"10.1145\/2370036.2145835"},{"issue":"6","key":"393_CR26","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/1323293.1294267","volume":"41","author":"R Kotla","year":"2007","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. ACM SIGOPS Operat. Syst. Rev. 41(6), 45\u201358 (2007)","journal-title":"ACM SIGOPS Operat. Syst. Rev."},{"unstructured":"Kursawe, K.: Optimistic byzantine agreement. In: Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, p. 262. IEEE Computer Society (2002)","key":"393_CR27"},{"doi-asserted-by":"crossref","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM (CACM) 21(7), 558\u2013565 (1978)","key":"393_CR28","DOI":"10.1145\/359545.359563"},{"issue":"2","key":"393_CR29","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1145\/2993.2994","volume":"6","author":"L Lamport","year":"1984","unstructured":"Lamport, L.: Using time instead of timeout for fault-tolerant distributed systems. ACM Trans. Program. Languages Syst. (TOPLAS) 6(2), 254\u2013280 (1984)","journal-title":"ACM Trans. Program. Languages Syst. (TOPLAS)"},{"issue":"1","key":"393_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L Lamport","year":"1987","unstructured":"Lamport, L.: A fast mutual exclusion algorithm. ACM Trans. Computer Syst. (TOCS) 5(1), 1\u201311 (1987)","journal-title":"ACM Trans. Computer Syst. (TOCS)"},{"issue":"2","key":"393_CR31","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00446-006-0005-x","volume":"19","author":"L Lamport","year":"2006","unstructured":"Lamport, L.: Fast paxos. Distrib. Comput. 19(2), 79\u2013103 (2006)","journal-title":"Distrib. Comput."},{"issue":"3","key":"393_CR32","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Languages Syst. (TOPLAS) 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Languages Syst. (TOPLAS)"},{"issue":"3","key":"393_CR33","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TDSC.2006.35","volume":"3","author":"J-P Martin","year":"2006","unstructured":"Martin, J.-P.: Fast byzantine consensus. IEEE Trans. Dependable Secure Comput. 3(3), 202\u2013215 (2006)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"doi-asserted-by":"crossref","unstructured":"Moses, Y., Waarts, O.: Coordinated traversal:(t+1)-round byzantine agreement in polynomial time. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS), pp. 246\u2013255. IEEE, (1988)","key":"393_CR34","DOI":"10.1109\/SFCS.1988.21941"},{"unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system, (2008)","key":"393_CR35"},{"issue":"4","key":"393_CR36","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(94)90011-6","volume":"49","author":"G Neiger","year":"1994","unstructured":"Neiger, G.: Distributed consensus revisited. Inf. Process. Lett. 49(4), 195\u2013201 (1994)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Parv\u00e9dy, P.R., Raynal, M.: Optimal early stopping uniform consensus in synchronous systems with process omission failures. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 302\u2013310. ACM (2004)","key":"393_CR37","DOI":"10.1145\/1007912.1007963"},{"issue":"2","key":"393_CR38","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM (JACM) 27(2), 228\u2013234 (1980)","journal-title":"J. ACM (JACM)"},{"unstructured":"Timnat, S.: Practical Parallel Data Structures. PhD Thesis, Technion - Computer Science Department, Haifa, Israel (2015)","key":"393_CR39"},{"issue":"2","key":"393_CR40","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R Turpin","year":"1984","unstructured":"Turpin, R., Coan, B.A.: Extending binary byzantine agreement to multivalued byzantine agreement. Inf. Process. Lett. 18(2), 73\u201376 (1984)","journal-title":"Inf. Process. Lett."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-021-00393-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-021-00393-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-021-00393-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T04:11:04Z","timestamp":1632197464000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-021-00393-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,10]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["393"],"URL":"https:\/\/doi.org\/10.1007\/s00446-021-00393-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2021,6,10]]},"assertion":[{"value":"24 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}