{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:37:43Z","timestamp":1770917863909,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,11,10]],"date-time":"2013-11-10T00:00:00Z","timestamp":1384041600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00446-013-0200-5","type":"journal-article","created":{"date-parts":[[2013,11,9]],"date-time":"2013-11-09T07:41:33Z","timestamp":1383982893000},"page":"111-146","source":"Crossref","is-referenced-by-count":24,"title":["Asynchronous Byzantine Agreement with optimal resilience"],"prefix":"10.1007","volume":"27","author":[{"given":"Arpita","family":"Patra","sequence":"first","affiliation":[]},{"given":"Ashish","family":"Choudhury","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,10]]},"reference":[{"key":"200_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Halpern, J. Y.: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience. In: Bazzi, R. A., Patt-Shamir, B. (eds.), Proceedings of the Twenty-seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, pp. 405\u2013414. ACM Press, 18\u201321 August 2008","DOI":"10.1145\/1400751.1400804"},{"key":"200_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed computing: fundamentals, simulations and advanced topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed computing: fundamentals, simulations and advanced topics. Wiley, New York (2004)"},{"key":"200_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic Fault-Tolerant distributed computation (extended abstract). In: Proceedings of the 20th Annual ACM symposium on theory of computing, Chicago, Illinois, USA. pp. 1\u201310. ACM Press, 2\u20134 May 1988","DOI":"10.1145\/62212.62213"},{"issue":"6","key":"200_CR4","doi-asserted-by":"crossref","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"CH Bennett","year":"1995","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Maurer, U.M.: Generalized privacy amplification. IEEE Trans. Inf. Theory 41(6), 1915\u20131923 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"200_CR5","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"CH Bennett","year":"1988","unstructured":"Bennett, C.H., Brassard, G., Robert, J.: Privacy amplification by public discussion. SIAM J. Comput. 17(2), 210\u2013229 (1988)","journal-title":"SIAM J. Comput."},{"key":"200_CR6","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An asynchronous $$\\lfloor (n - 1)\/3 \\rfloor $$ \u230a ( n - 1 ) \/ 3 \u230b -resilient consensus protocol. In: Proceedings of the third annual ACM symposium on principles of distributed computing, Vancouver, B.C., Canada, pp. 154\u2013162. ACM Press, 27\u201329 August 1984","DOI":"10.1145\/800222.806743"},{"key":"200_CR7","unstructured":"Canetti, R.: Studies in Secure Multiparty Computation and Applications. Ph.D. thesis, Weizmann Institute, Israel (1995)"},{"key":"200_CR8","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: Proceedings of the Twenty-fifth annual ACM symposium on theory of computing. pp. 42\u201351. ACM Press (1993). Full version available at http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.8.8120"},{"key":"200_CR9","doi-asserted-by":"crossref","unstructured":"Choudhury, A., Patra, A.: Brief announcement: rfficient optimally resilient statistical AVSS and its applications. In: Kowalski, D., Panconesi, A. (eds.), Proceedings of the 31st Annual ACM Symposium on Principles of Distributed Computing, PODC 2012, Funchal, Portugal, pp. 103\u2013104. ACM Press, 16\u201318 July 2012","DOI":"10.1145\/2332432.2332454"},{"key":"200_CR10","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I.: Multiparty Computation, an Introduction. Contemporary Cryptography, Birkhauser, Basel (2005)","DOI":"10.1007\/3-7643-7394-6_2"},{"key":"200_CR11","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.), Advances in Cryptology\u2014EUROCRYPT\u201999, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, Proceeding, volume 1592 of Lecture Notes in Computer Science, pp. 311\u2013326. Springer, Berlin, 2\u20136 May 1999","DOI":"10.1007\/3-540-48910-X_22"},{"key":"200_CR12","unstructured":"Feldman, P., Micali, S.: An optimal algorithm for synchronous Byzantine agreement. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA. pp. 639\u2013648. ACM Press, 2\u20134 May 1988"},{"issue":"4","key":"200_CR13","doi-asserted-by":"crossref","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":"2","key":"200_CR14","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. JACM 32(2), 374\u2013382 (1985)","journal-title":"JACM"},{"key":"200_CR15","unstructured":"Fitzi, M.: Generalized Communication and Security Models in Byzantine Agreement. Ph.D. thesis, ETH Zurich (2002)"},{"key":"200_CR16","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J., Gollakota, S., Pandu Rangan, C., Srinathan, K.: Round-Optimal and Efficient Verifiable Secret Sharing. In: Halevi, S., Rabin, T. (eds.), Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, Proceedings, volume 3876 of Lecture Notes in Computer Science, pp. 329\u2013342. Springer, Berlin, 4\u20137 March 2006","DOI":"10.1007\/11681878_17"},{"key":"200_CR17","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Crete, Greece. ACM, pp. 580\u2013589. ACM Press, 6\u20138 July 2001","DOI":"10.1145\/380752.380853"},{"key":"200_CR18","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure sistributed key generation for discrete-log based cryptosystems. J. Cryptol. 20(1), 51\u201383 (2007)","DOI":"10.1007\/s00145-006-0347-3"},{"key":"200_CR19","doi-asserted-by":"crossref","unstructured":"Katz, J., Koo, C., Kumaresan, R.: Improving the round complexity of VSS in point-to-point networks. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L. A., Halld\u00f3rsson, M. M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.), Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, volume 5126 of Lecture Notes in Computer Science, pp. 499\u2013510. Springer, Berlin, 7\u201311 July 2008","DOI":"10.1007\/978-3-540-70583-3_41"},{"key":"200_CR20","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Los Altos (1996)"},{"key":"200_CR21","doi-asserted-by":"crossref","unstructured":"Patra, A., Choudhary, A., Rabin, T., Pandu Rangan, C.: The round complexity of verifiable secret sharing revisited. In: Halevi, S., (ed.), Advances in Cryptology\u2014CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA. Proceedings, volume 5677 of Lecture Notes in Computer Science, pp. 487\u2013504. Springer, Berlin, 16\u201320 August 2009","DOI":"10.1007\/978-3-642-03356-8_29"},{"key":"200_CR22","doi-asserted-by":"crossref","unstructured":"Patra, A., Choudhary, A., Pandu Rangan, C.: Simple and efficient asynchronous Byzantine agreement with optimal resilience. In: Tirthapura, S., Alvisi, L. (eds.), Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, pp. 92\u2013101. ACM Press, 10\u201312 August 2009","DOI":"10.1145\/1582716.1582736"},{"issue":"2","key":"200_CR23","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. JACM 27(2), 228\u2013234 (1980)","journal-title":"JACM"},{"key":"200_CR24","doi-asserted-by":"crossref","unstructured":"Pedersen, T. P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.), Advances in Cryptology\u2014CRYPTO\u201991, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, Proceedings, volume 576 of Lecture Notes in Computer Science, pp. 129\u2013140. Springer, Berlin, 11\u201315 August 1991","DOI":"10.1007\/3-540-46766-1_9"},{"key":"200_CR25","doi-asserted-by":"crossref","unstructured":"Rabin, M. O.: Randomized byzantine generals. In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto California, pp. 403\u2013409. IEEE Computer Society, 3\u20135 November 1993","DOI":"10.1109\/SFCS.1983.48"},{"key":"200_CR26","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, Washigton, USA, pp. 73\u201385. ACM Press, 14\u201317 May 1989","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"200_CR27","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0200-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-013-0200-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0200-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T20:02:30Z","timestamp":1746043350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-013-0200-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,10]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["200"],"URL":"https:\/\/doi.org\/10.1007\/s00446-013-0200-5","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,10]]}}}