{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:05:49Z","timestamp":1764133549129},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T00:00:00Z","timestamp":1646352000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T00:00:00Z","timestamp":1646352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00145-022-09421-7","type":"journal-article","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T18:02:43Z","timestamp":1646416963000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Round Complexity of Randomized Byzantine Agreement"],"prefix":"10.1007","volume":"35","author":[{"given":"Ran","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iftach","family":"Haitner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Makriyannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matan","family":"Orland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Samorodnitsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,4]]},"reference":[{"key":"9421_CR1","doi-asserted-by":"crossref","unstructured":"I. Abraham, T.H. Chan, D. Dolev, K. Nayak, R. Pass, L. Ren, E. Shi, Communication complexity of Byzantine agreement, revisited, in Proceedings of the 38th Annual ACM Symposium on Principles of Distributed Computing (PODC) (2019a), pp. 317\u2013326)","DOI":"10.1145\/3293611.3331629"},{"key":"9421_CR2","doi-asserted-by":"crossref","unstructured":"I. Abraham, S. Devadas, D. Dolev, K. Nayak, L. Ren, Synchronous Byzantine agreement with expected O(1) rounds, expected o(n$${}^{\\text{2)}}$$ communication, and optimal resilience, in Financial Cryptography and Data Security (2019b)","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"9421_CR3","doi-asserted-by":"crossref","unstructured":"H. Attiya, K. Censor, Tight bounds for asynchronous randomized consensus. J. ACM, 55(5):20:1\u201320:26 (2008)","DOI":"10.1145\/1411509.1411510"},{"issue":"8","key":"9421_CR4","doi-asserted-by":"publisher","first-page":"3885","DOI":"10.1137\/090751906","volume":"39","author":"H Attiya","year":"2010","unstructured":"H. Attiya, K. Censor-Hillel, Lower bounds for randomized consensus under a weak adversary. SIAM J. Comput. 39(8):3885\u20133904 (2010)","journal-title":"SIAM J. Comput."},{"key":"9421_CR5","doi-asserted-by":"crossref","unstructured":"Z. Bar-Joseph, M. Ben-Or, A tight lower bound for randomized synchronous consensus, in Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 193\u2013199 (1998)","DOI":"10.1145\/277697.277733"},{"key":"9421_CR6","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, Another advantage of free choice: completely asynchronous agreement protocols (extended abstract), in Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"9421_CR7","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, N. Linial, Collective coin flipping, robust voting schemes and minima of banzhaf values, in Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS), pp. 408\u2013416 (1985)","DOI":"10.1109\/SFCS.1985.15"},{"key":"9421_CR8","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"9421_CR9","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, E. Pavlov, V. Vaikuntanathan, Byzantine agreement in the full-information model in o(log n) rounds, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 179\u2013186 (2006)","DOI":"10.1145\/1132516.1132543"},{"key":"9421_CR10","doi-asserted-by":"crossref","unstructured":"E. Ben-Sasson, A. Chiesa, M. Green, E. Tromer, M. Virza, Secure sampling of public parameters for succinct zero knowledge proofs, in IEEE Symposium on Security and Privacy, pp. 287\u2013304 (2015)","DOI":"10.1109\/SP.2015.25"},{"key":"9421_CR11","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, S. Micali, Non-interactive zero-knowledge and its applications (extended abstract), in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 103\u2013112 (1988)","DOI":"10.1145\/62212.62222"},{"key":"9421_CR12","unstructured":"J. Bourgain, J. Kahn, G. Kalai, Influential coalitions for Boolean functions, in CoRR, 2014. arXiv:1409.3033"},{"key":"9421_CR13","doi-asserted-by":"crossref","unstructured":"S. Bowe, A. Gabizon, M.D. Green, A multi-party protocol for constructing the public parameters of the pinocchio zk-snark, in Financial Cryptography and Data Security FC, pp. 64\u201377 (2018)","DOI":"10.1007\/978-3-662-58820-8_5"},{"key":"9421_CR14","doi-asserted-by":"crossref","unstructured":"E. Boyle, R. Cohen, A. Goel, Breaking the o($$\\surd $$ n)-bit barrier: Byzantine agreement with polylog bits per party, in Proceedings of the 40th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 319\u2013330 (2021)","DOI":"10.1145\/3465084.3467897"},{"key":"9421_CR15","doi-asserted-by":"crossref","unstructured":"G. Bracha, An asynchronou [(n-1)\/3]-resilient consensus protocol, in Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 154\u2013162 (1984)","DOI":"10.1145\/800222.806743"},{"key":"9421_CR16","unstructured":"M. Castro, B. Liskov. Practical Byzantine fault tolerance, in Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), pp. 173\u2013186 (1999)"},{"key":"9421_CR17","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols (extended abstract), in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"9421_CR18","unstructured":"J. Chen, S. Micali, Algorand, in CoRR, 2016. arXiv:1607.01341"},{"key":"9421_CR19","unstructured":"B. Chor, B.A. Coan, A simple and efficient randomized Byzantine agreement algorithm, in Fourth Symposium on Reliability in Distributed Software and Database Systems, SRDS, pp. 98\u2013106 (1984)"},{"issue":"3","key":"9421_CR20","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/65950.65956","volume":"36","author":"B Chor","year":"1989","unstructured":"B. Chor, M. Merritt, D.B. Shmoys, Simple constant-time consensus protocols in realistic failure models. J. ACM, 36(3):591\u2013614 (1989)","journal-title":"J. ACM"},{"key":"9421_CR21","doi-asserted-by":"crossref","unstructured":"R. Cohen, S. Coretti, J.A. Garay, V. Zikas, Probabilistic termination and composability of cryptographic protocols, in Advances in Cryptology \u2013 CRYPTO 2016, part III, pp. 240\u2013269 (2016)","DOI":"10.1007\/978-3-662-53015-3_9"},{"key":"9421_CR22","unstructured":"R. Cohen, S. Coretti, J. Garay, V. Zikas, Round-preserving parallel composition of probabilistic-termination cryptographic protocols, in Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 37:1\u201337:15 (2017)"},{"key":"9421_CR23","unstructured":"R. Cohen, I. Haitner, N. Makriyannis, M. Orland, A. Samorodnitsky, On the round complexity of randomized byzantine agreement, in Proceedings of the 33st International Symposium on Distributed Computing (DISC), pp. 12:1\u201312:17 (2019)"},{"issue":"4","key":"9421_CR24","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"D. Dolev, R. Strong, Authenticated algorithms for Byzantine agreement. SIAM J. Comput. 12(4):656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9421_CR25","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D Dolev","year":"1990","unstructured":"D. Dolev, R. Reischuk, H.R. Strong, Early stopping in Byzantine agreement. J. ACM, 37(4):720\u2013741 (1990)","journal-title":"J. ACM"},{"issue":"4","key":"9421_CR26","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P Feldman","year":"1997","unstructured":"P. Feldman, S. Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J. Comput. 26(4):873\u2013933 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9421_CR27","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"MJ Fischer","year":"1982","unstructured":"M.J. Fischer, N.A. Lynch, A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14(4):183\u2013186 (1982)","journal-title":"Inf. Process. Lett."},{"key":"9421_CR28","doi-asserted-by":"crossref","unstructured":"M.J. Fischer, N.A. Lynch, M. Merritt, Easy impossibility proofs for distributed consensus problems, in Proceedings of the 23th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 59\u201370 (1985)","DOI":"10.1145\/323596.323602"},{"key":"9421_CR29","doi-asserted-by":"crossref","unstructured":"M. Fitzi, J.A. Garay. Efficient player-optimal protocols for strong and differential consensus, in Proceedings of the 22th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 211\u2013220 (2003)","DOI":"10.1145\/872035.872066"},{"key":"9421_CR30","doi-asserted-by":"crossref","unstructured":"M. Fitzi, J.B. Nielsen, On the number of synchronous rounds sufficient for authenticated Byzantine agreement, in Proceedings of the 23th International Symposium on Distributed Computing (DISC), pp. 449\u2013463 (2009)","DOI":"10.1007\/978-3-642-04355-0_46"},{"issue":"1","key":"9421_CR31","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/PL00009809","volume":"18","author":"E Friedgut","year":"1998","unstructured":"E. Friedgut, Boolean functions with low average sensitivity depend on few coordinates. Combinatorica 18(1):27\u201335 (1998)","journal-title":"Combinatorica"},{"key":"9421_CR32","doi-asserted-by":"crossref","unstructured":"J.A. Garay, Y. Moses, Fully polynomial Byzantine agreement in t+1 rounds, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 31\u201341 (1993)","DOI":"10.1145\/167088.167101"},{"key":"9421_CR33","doi-asserted-by":"crossref","unstructured":"J.A. Garay, J. Katz, C. Koo, R. Ostrovsky, Round complexity of authenticated broadcast with a dishonest majority, in Proceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS), pp. 658\u2013668 (2007)","DOI":"10.1109\/FOCS.2007.44"},{"key":"9421_CR34","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems, in Advances in Cryptology \u2013 EUROCRYPT \u201999, pp. 295\u2013310 (1999)","DOI":"10.1007\/3-540-48910-X_21"},{"key":"9421_CR35","doi-asserted-by":"crossref","unstructured":"Y. Gilad, R. Hemo, S. Micali, G. Vlachos, N. Zeldovich, Algorand: Scaling Byzantine agreements for cryptocurrencies, in Proceedings of the 26th Symposium on Operating Systems Principles (SOSP), pp. 51\u201368 (2017)","DOI":"10.1145\/3132747.3132757"},{"key":"9421_CR36","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"2","key":"9421_CR37","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1137\/S0097539793246689","volume":"27","author":"O Goldreich","year":"1998","unstructured":"O. Goldreich, S. Goldwasser, N. Linial, Fault-tolerant computation in the full information model. SIAM J. Comput. 27(2):506\u2013544 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9421_CR38","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, R.L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2):281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"key":"9421_CR39","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, E. Pavlov, V. Vaikuntanathan, Fault-tolerant distributed computing in full-information networks, in Proceedings of the 47th Annual Symposium on Foundations of Computer Science (FOCS), pp. 15\u201326 (2006)","DOI":"10.1109\/FOCS.2006.30"},{"key":"9421_CR40","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, Y.T. Kalai, S. Park, Adaptively secure coin-flipping, revisited, in Proceedings of the 42th International Colloquium on Automata, Languages, and Programming (ICALP), part II, pp. 663\u2013674 (2015)","DOI":"10.1007\/978-3-662-47666-6_53"},{"key":"9421_CR41","doi-asserted-by":"crossref","unstructured":"J. Groth, R. Ostrovsky, A. Sahai, New techniques for noninteractive zero-knowledge. J. ACM 59(3):11:1\u201311:35 (2012)","DOI":"10.1145\/2220357.2220358"},{"issue":"2","key":"9421_CR42","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01667081","volume":"2","author":"V Hadzilacos","year":"1987","unstructured":"V. Hadzilacos, Connectivity requirements for Byzantine agreement under restricted types of failures. Distrib. Comput. 2(2):95\u2013103 (1987)","journal-title":"Distrib. Comput."},{"key":"9421_CR43","doi-asserted-by":"crossref","unstructured":"D. Hofheinz, T. Jager, Verifiable random functions from standard assumptions, in Proceedings of the 13th Theory of Cryptography Conference, TCC 2016-A, part I, pp. 336\u2013362 (2016)","DOI":"10.1007\/978-3-662-49096-9_14"},{"key":"9421_CR44","doi-asserted-by":"crossref","unstructured":"J. Kahn, G. Kalai, N. Linial, The influence of variables on Boolean functions (extended abstract), in Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS), pp. 68\u201380 (1988)","DOI":"10.1109\/SFCS.1988.21923"},{"key":"9421_CR45","unstructured":"B.M. Kapron, D. Kempe, V. King, J. Saia, V. Sanwalani, Fast asynchronous Byzantine agreement and leader election with full information, in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1038\u20131047 (2008)"},{"key":"9421_CR46","unstructured":"A.R. Karlin, A.C. Yao, Probabilistic lower bounds for Byzantine agreement and clock synchronization. Unpublished manuscript (1984)"},{"key":"9421_CR47","first-page":"445","volume":"2006","author":"J Katz","year":"2006","unstructured":"J. Katz, C. Koo, On expected constant-round protocols for Byzantine agreement, in Advances in Cryptology \u2013 CRYPTO 2006, pp. 445\u2013462 (2006)","journal-title":"Advances in Cryptology - CRYPTO"},{"key":"9421_CR48","doi-asserted-by":"crossref","unstructured":"V. King, J. Saia, Byzantine agreement in polynomial expected time: [extended abstract], in Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC), pp. 401\u2013410 (2013)","DOI":"10.1145\/2488608.2488658"},{"key":"9421_CR49","doi-asserted-by":"crossref","unstructured":"J. Kubiatowicz, D. Bindel, Y. Chen, S.E. Czerwinski, P.R. Eaton, D. Geels, R. Gummadi, S.C. Rhea, H. Weatherspoon, W. Weimer, C. Wells, B.Y. Zhao, Oceanstore: An architecture for global-scale persistent storage, in ASPLOS-IX Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 190\u2013201 (2000)","DOI":"10.1145\/384264.379239"},{"issue":"3","key":"9421_CR50","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"L. Lamport, R.E. Shostak, M.C. Pease, The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3):382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9421_CR51","doi-asserted-by":"crossref","unstructured":"A.B. Lewko, The contest between simplicity and efficiency in asynchronous Byzantine agreement, in Proceedings of the 25th International Symposium on Distributed Computing (DISC), pp. 348\u2013362 (2011)","DOI":"10.1007\/978-3-642-24100-0_35"},{"key":"9421_CR52","doi-asserted-by":"crossref","unstructured":"A.B. Lewko, M. Lewko, On the complexity of asynchronous agreement against powerful adversaries, in Proceedings of the 32th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 280\u2013289 (2013)","DOI":"10.1145\/2484239.2484250"},{"issue":"6","key":"9421_CR53","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1145\/1217856.1217857","volume":"53","author":"Y Lindell","year":"2006","unstructured":"Y. Lindell, A. Lysyanskaya, T. Rabin, On the composition of authenticated Byzantine agreement. J. ACM, 53(6):881\u2013917 (2006)","journal-title":"J. ACM"},{"key":"9421_CR54","unstructured":"S. Micali, Very simple and efficient Byzantine agreement, in Proceedings of the 8th Annual Innovations in Theoretical Computer Science (ITCS) conference, pp. 6:1\u20136:1 (2017)"},{"key":"9421_CR55","unstructured":"S. Micali, V. Vaikuntanathan, Optimal and player-replaceable consensus with an honest majority. Unpublished manuscript (2017)"},{"key":"9421_CR56","unstructured":"S. Micali, M.O. Rabin, S.P. Vadhan, Verifiable random functions, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), pp. 120\u2013130 (1999)"},{"issue":"1","key":"9421_CR57","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF02773611","volume":"154","author":"E Mossel","year":"2006","unstructured":"E. Mossel, R. O\u2019Donnell, O. Regev, J. E. Steif, and B. Sudakov. Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality. Israel Journal of Mathematics, 154(1):299\u2013336 (2006)","journal-title":"Israel Journal of Mathematics"},{"issue":"3","key":"9421_CR58","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1007\/s00039-013-0229-4","volume":"23","author":"E Mossel","year":"2013","unstructured":"E. Mossel, K. Oleszkiewicz, A. Sen, On reverse hypercontractivity. Geom. Funct. Anal. 23(3):1062\u20131097 (2013)","journal-title":"Geom. Funct. Anal."},{"issue":"3","key":"9421_CR59","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G Neiger","year":"1990","unstructured":"G. Neiger, S. Toueg, Automatically increasing the fault-tolerance of distributed algorithms. J. Algorithms 11(3):374\u2013419 (1990)","journal-title":"J. Algorithms"},{"key":"9421_CR60","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782","volume-title":"Analysis of Boolean Functions","author":"R O\u2019Donnell","year":"2014","unstructured":"R. O\u2019Donnell, Analysis of Boolean Functions (Cambridge University Press, Cambridge, 2014)"},{"key":"9421_CR61","unstructured":"R. Pass and E. Shi. Hybrid consensus: Efficient consensus in the permissionless model, in Proceedings of the 31st International Symposium on Distributed Computing (DISC), pp. 39:1\u201339:16 (2017)"},{"key":"9421_CR62","doi-asserted-by":"crossref","unstructured":"R. Pass, E. Shi, Thunderella: Blockchains with optimistic instant confirmation, in Advances in Cryptology \u2013 EUROCRYPT 2018, part II, pp. 3\u201333 (2018)","DOI":"10.1007\/978-3-319-78375-8_1"},{"issue":"2","key":"9421_CR63","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"M.C. Pease, R.E. Shostak, L. Lamport, Reaching agreement in the presence of faults. J. ACM 27(2):228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"9421_CR64","doi-asserted-by":"crossref","unstructured":"T.P. Pedersen, Non-interactive and information-theoretic secure verifiable secret sharing, in Advances in Cryptology \u2013 CRYPTO \u201991, pp. 129\u2013140 (1991)","DOI":"10.1007\/3-540-46766-1_9"},{"key":"9421_CR65","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann, M. Waidner, Unconditional Byzantine agreement for any number of faulty processors, in Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 339\u2013350 (1992)","DOI":"10.1007\/3-540-55210-3_195"},{"key":"9421_CR66","doi-asserted-by":"crossref","unstructured":"M.O. Rabin, Randomized Byzantine generals, in Proceedings of the 24th Annual Symposium on Foundations of Computer Science (FOCS), pp. 403\u2013409 (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"9421_CR67","unstructured":"M. Santha, U.V. Vazirani, Generating quasi-random sequences from slightly-random sources (extended abstract), in Proceedings of the 25th Annual Symposium on Foundations of Computer Science (FOCS), pp. 434\u2013440 (1984)"},{"issue":"2","key":"9421_CR68","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R Turpin","year":"1984","unstructured":"R. Turpin, B.A. Coan, Extending binary Byzantine agreement to multivalued Byzantine agreement. Inf. Process. Lett. 18(2):73\u201376 (1984)","journal-title":"Inf. Process. Lett."},{"key":"9421_CR69","doi-asserted-by":"crossref","unstructured":"A.C. Yao, Protocols for secure computations (extended abstract), in Proceedings of the 23th Annual Symposium on Foundations of Computer Science (FOCS), pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09421-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-022-09421-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09421-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T20:04:43Z","timestamp":1726776283000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-022-09421-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,4]]},"references-count":69,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9421"],"URL":"https:\/\/doi.org\/10.1007\/s00145-022-09421-7","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2022,3,4]]},"assertion":[{"value":"16 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"10"}}