{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T23:14:35Z","timestamp":1763507675680},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T00:00:00Z","timestamp":1386720000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s00145-013-9172-7","type":"journal-article","created":{"date-parts":[[2013,12,10]],"date-time":"2013-12-10T16:27:13Z","timestamp":1386692833000},"page":"49-109","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation"],"prefix":"10.1007","volume":"28","author":[{"given":"Arpita","family":"Patra","sequence":"first","affiliation":[]},{"given":"Ashish","family":"Choudhury","sequence":"additional","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,11]]},"reference":[{"key":"9172_CR1","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/1400751.1400804","volume-title":"Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing\u2014PODC 2008","author":"I. Abraham","year":"2008","unstructured":"I. Abraham, D. Dolev, J.Y. Halpern, An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience, in Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing\u2014PODC 2008, Toronto, Canada, August 18\u201321, 2008, ed. by R.A. Bazzi, B. Patt-Shamir (ACM, New York, 2008), pp. 405\u2013414"},{"key":"9172_CR2","series-title":"Lecture Notes in Computer Science","first-page":"420","volume-title":"Advances in Cryptology\u2014CRYPTO \u201991, Proceedings of 11th Annual International Cryptology Conference","author":"D. Beaver","year":"1991","unstructured":"D. Beaver, Efficient multiparty protocols using circuit randomization, in Advances in Cryptology\u2014CRYPTO \u201991, Proceedings of 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11\u201315, 1991, ed. by J. Feigenbaum. Lecture Notes in Computer Science, vol. 576 (Springer, Berlin, 1991), pp. 420\u2013432"},{"issue":"4","key":"9172_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"D. Beaver, Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. J. Cryptol. 4(4), 75\u2013122 (1991)","journal-title":"J. Cryptol."},{"key":"9172_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/11681878_16","volume-title":"Theory of Cryptography, Proceedings of 3rd Theory of Cryptography Conference\u2014TCC 2006","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2006","unstructured":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1, M. Hirt, Efficient multi-party computation with dispute control, in Theory of Cryptography, Proceedings of 3rd Theory of Cryptography Conference\u2014TCC 2006, New York, NY, USA, March 4\u20137, 2006, ed. by S. Halevi, T. Rabin. Lecture Notes in Computer Science, vol. 3876 (Springer, Berlin, 2006), pp. 305\u2013328"},{"key":"9172_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/978-3-540-76900-2_23","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2007, Proceedings of 13th International Conference on the Theory and Application of Cryptology and Information Security","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2007","unstructured":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1, M. Hirt, Simple and efficient perfectly-secure asynchronous MPC, in Advances in Cryptology\u2014ASIACRYPT 2007, Proceedings of 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2\u20136, 2007, ed. by K. Kurosawa. Lecture Notes in Computer Science, vol. 4833 (Springer, Berlin, 2007), pp. 376\u2013392"},{"key":"9172_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography, 5th Theory of Cryptography Conference\u2014TCC 2008","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1, M. Hirt, Perfectly-secure MPC with linear communication complexity, in Theory of Cryptography, 5th Theory of Cryptography Conference\u2014TCC 2008, New York, USA, March 19\u201321, 2008, ed. by R. Canetti. Lecture Notes in Computer Science, vol. 4948 (Springer, Berlin, 2008), pp. 213\u2013230"},{"key":"9172_CR7","first-page":"52","volume-title":"Proceedings of the 25th Annual ACM Symposium on Theory of Computing","author":"M. Ben-Or","year":"1993","unstructured":"M. Ben-Or, R. Canetti, O. Goldreich, Asynchronous secure computation, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing (ACM, New York, 1993), pp. 52\u201361"},{"key":"9172_CR8","first-page":"1","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing","author":"M. Ben-Or","year":"1988","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, Chicago, Illinois, USA, May 2\u20134, 1988 (ACM, New York, 1988), pp. 1\u201310"},{"key":"9172_CR9","first-page":"183","volume-title":"Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing","author":"M. Ben-Or","year":"1994","unstructured":"M. Ben-Or, B. Kelmer, T. Rabin, Asynchronous secure computations with optimal resilience, in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14\u201317 (ACM, New York, 1994), pp. 183\u2013192"},{"key":"9172_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-642-32009-5_39","volume-title":"Proceedings 32nd Annual Cryptology Conference of Advances in Cryptology\u2014CRYPTO 2012","author":"E. Ben-Sasson","year":"2012","unstructured":"E. Ben-Sasson, S. Fehr, R. Ostrovsky, Near-linear unconditionally-secure multiparty computation with a dishonest minority, in Proceedings 32nd Annual Cryptology Conference of Advances in Cryptology\u2014CRYPTO 2012, Santa Barbara, CA, USA, August 19\u201323, 2012, ed. by R. Safavi-Naini, R. Canetti. Lecture Notes in Computer Science, vol. 7417 (Springer, Berlin, 2012), pp. 663\u2013680"},{"issue":"6","key":"9172_CR11","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"C.H. Bennett","year":"1995","unstructured":"C.H. Bennett, G. Brassard, C. Cr\u00e9peau, U.M. Maurer, Generalized privacy amplification. IEEE Trans. Inf. Theory 41(6), 1915\u20131923 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9172_CR12","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C.H. Bennett","year":"1988","unstructured":"C.H. Bennett, G. Brassard, J. Robert, Privacy amplification by public discussion. SIAM J. Comput. 17(2), 210\u2013229 (1988)","journal-title":"SIAM J. Comput."},{"key":"9172_CR13","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1145\/800222.806743","volume-title":"Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing","author":"G. Bracha","year":"1984","unstructured":"G. Bracha, An asynchronous \u230a(n\u22121)\/3\u230b-resilient consensus protocol, in Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B.C., Canada, August 27\u201329, 1984 (ACM, New York, 1984), pp. 154\u2013162"},{"key":"9172_CR14","unstructured":"R. Canetti, Studies in secure multiparty computation and applications. Ph.D. thesis, Weizmann Institute, Israel, 1995"},{"key":"9172_CR15","first-page":"42","volume-title":"Proceedings of the 25th Annual ACM Symposium on Theory of Computing","author":"R. Canetti","year":"1993","unstructured":"R. Canetti, T. Rabin, Fast asynchronous Byzantine agreement with optimal resilience, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing (ACM, New York, 1993), pp. 42\u201351"},{"key":"9172_CR16","first-page":"11","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing\u2014ACM 1988","author":"D. Chaum","year":"1988","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\u2014ACM 1988, Chicago, Illinois, USA, May 2\u20134, 1988 (ACM Press, New York, 1988), pp. 11\u201319"},{"key":"9172_CR17","first-page":"383","volume-title":"Proceedings of the 17th Annual ACM Symposium on Theory of Computing","author":"B. Chor","year":"1985","unstructured":"B. Chor, S. Goldwasser, S. Micali, B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract), in Proceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence, Rhode Island, USA, 6\u20138 May, 1985 (ACM, New York, 1985), pp. 383\u2013395"},{"key":"9172_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/978-3-642-41527-2_27","volume-title":"Distributed Computing\u2014DISC 2013, Proceedings of 27th International Symposium","author":"A. Choudhury","year":"2013","unstructured":"A. Choudhury, M. Hirt, A. Patra, Asynchronous multiparty computation with linear communication complexity, in Distributed Computing\u2014DISC 2013, Proceedings of 27th International Symposium, Jerusalem, Israel, October 14\u201318, 2013, ed. by Y. Afek. Lecture Notes in Computer Science, vol. 8205 (Springer, Berlin, 2013), pp. 388\u2013402"},{"key":"9172_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology\u2014EUROCRYPT 99, Proceeding of International Conference on the Theory and Application of Cryptographic Techniques","author":"R. Cramer","year":"1999","unstructured":"R. Cramer, I. Damg\u00e5rd, S. Dziembowski, M. Hirt, T. Rabin, Efficient multiparty computations secure against an adaptive adversary, in Advances in Cryptology\u2014EUROCRYPT 99, Proceeding of International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2\u20136, 1999, ed. by J. Stern. Lecture Notes in Computer Science, vol. 1592 (Springer, Berlin, 1999), pp. 311\u2013326"},{"key":"9172_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/978-3-642-00468-1_10","volume-title":"Public Key Cryptography\u2014PKC 2009, Proceeding of 12th International Conference on Practice and Theory in Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2009","unstructured":"I. Damg\u00e5rd, M. Geisler, M. Kr\u00f8igaard, J.B. Nielsen, Asynchronous multiparty computation: theory and implementation, in Public Key Cryptography\u2014PKC 2009, Proceeding of 12th International Conference on Practice and Theory in Public Key Cryptography, Irvine, CA, USA, March 18\u201320, 2009, ed. by S. Jarecki, G. Tsudik. Lecture Notes in Computer Science, vol. 5443 (Springer, Berlin, 2009), pp. 160\u2013179"},{"key":"9172_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11818175_30","volume-title":"Advances in Cryptology\u2014CRYPTO 2006, Proceedings of 26th Annual International Cryptology Conference","author":"I. Damg\u00e5rd","year":"2006","unstructured":"I. Damg\u00e5rd, Y. Ishai, Scalable secure multiparty computation, in Advances in Cryptology\u2014CRYPTO 2006, Proceedings of 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20\u201324, 2006, ed. by C. Dwork. Lecture Notes in Computer Science, vol. 4117 (Springer, Berlin, 2006), pp. 501\u2013520"},{"key":"9172_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"Advances in Cryptology\u2014CRYPTO 2007, 27th Annual International Cryptology Conference","author":"I. Damg\u00e5rd","year":"2007","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, Scalable and unconditionally secure multiparty computation, in Advances in Cryptology\u2014CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2007, Proceedings, ed. by A. Menezes. Lecture Notes in Computer Science, vol. 4622 (Springer, Berlin, 2007), pp. 572\u2013590"},{"issue":"1","key":"9172_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"D. Dolev, C. Dwork, O. Waarts, M. Yung, Perfectly secure message transmission. J. ACM 40(1), 17\u201347 (1993)","journal-title":"J. ACM"},{"key":"9172_CR24","first-page":"639","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing","author":"P. Feldman","year":"1988","unstructured":"P. Feldman, S. Micali, An optimal algorithm for synchronous Byzantine agreement, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, May 2\u20134, 1988 (ACM, New York, 1988), pp. 639\u2013648"},{"key":"9172_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/11681878_17","volume-title":"Theory of Cryptography\u2014TCC 2006, Proceedings of 3rd Theory of Cryptography Conference","author":"M. Fitzi","year":"2006","unstructured":"M. Fitzi, J. Garay, S. Gollakota, C. Pandu Rangan, K. Srinathan, Round-optimal and efficient verifiable secret sharing, in Theory of Cryptography\u2014TCC 2006, Proceedings of 3rd Theory of Cryptography Conference, New York, NY, USA, March 4\u20137, 2006, ed. by S. Halevi, T. Rabin. Lecture Notes in Computer Science, vol. 3876 (Springer, Berlin, 2006), pp. 329\u2013342"},{"key":"9172_CR26","first-page":"699","volume-title":"Proceedings of the 24th Annual ACM Symposium on Theory of Computing","author":"M.K. Franklin","year":"1992","unstructured":"M.K. Franklin, M. Yung, Communication complexity of secure computation (extended abstract), in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 4\u20136, 1992, ed. by S.R. Kosaraju, M. Fellows, A. Wigderson, J.A. Ellis (ACM, New York, 1992), pp. 699\u2013710"},{"key":"9172_CR27","first-page":"580","volume-title":"Proceedings on 33rd Annual ACM Symposium on Theory of Computing","author":"R. Gennaro","year":"2001","unstructured":"R. Gennaro, Y. Ishai, E. Kushilevitz, T. Rabin, The round complexity of verifiable secret sharing and secure multicast, in Proceedings on 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Crete, Greece, July 6\u20138, 2001 (ACM, New York, 2001), pp. 580\u2013589"},{"key":"9172_CR28","first-page":"218","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","author":"O. Golderich","year":"1987","unstructured":"O. Golderich, S. Micali, A. Wigderson, How to play a mental game or a completeness theorem for protocols with honest majority, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, NY, USA (ACM, New York, 1987), pp. 218\u2013229"},{"key":"9172_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2000, Proceedings of 6th International Conference on the Theory and Application of Cryptology and Information Security","author":"M. Hirt","year":"2000","unstructured":"M. Hirt, U. Maurer, B. Przydatek, Efficient secure multiparty computation, in Advances in Cryptology\u2014ASIACRYPT 2000, Proceedings of 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, Japan, December 3\u20137, 2000, ed. by T. Okamoto. Lecture Notes in Computer Science, vol. 1976 (Springer, Berlin, 2000), pp. 143\u2013161"},{"key":"9172_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/978-3-642-02617-1_16","volume-title":"Proceedings of Advances in Information Security and Assurance\u2014ISA 2009, 3rd International Conference and Workshops","author":"Z. Huang","year":"2009","unstructured":"Z. Huang, W. Qiu, Q. Li, K. Chen, Efficient secure multiparty computation protocol in asynchronous network, in Proceedings of Advances in Information Security and Assurance\u2014ISA 2009, 3rd International Conference and Workshops, Seoul, Korea, ed. by J.H. Park, H. Chen, M. Atiquzzaman, C. Lee, T. Kim, S. Yeo. Lecture Notes in Computer Science, vol. 5576 (Springer, Berlin, 2009), pp. 152\u2013158"},{"key":"9172_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/978-3-540-70583-3_41","volume-title":"Automata, Languages and Programming\u2014ICALP 2008, Proceedings of 35th International Colloquium, Part II, Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations","author":"J. Katz","year":"2008","unstructured":"J. Katz, C. Koo, R. Kumaresan, Improving the round complexity of VSS in point-to-point networks, in Automata, Languages and Programming\u2014ICALP 2008, Proceedings of 35th International Colloquium, Part II, Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, Reykjavik, Iceland, July 7\u201311, 2008, ed. by L. Aceto, I. Damg\u00e5rd, L.A. Goldberg, M.M. Halld\u00f3rsson, A. Ing\u00f3lfsd\u00f3ttir, I. Walukiewicz. Lecture Notes in Computer Science, vol. 5126 (Springer, Berlin, 2008), pp. 499\u2013510"},{"key":"9172_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11818175_27","volume-title":"Advances in Cryptology\u2014CRYPTO 2006, Proceedings of 26th Annual International Cryptology Conference","author":"J. Katz","year":"2006","unstructured":"J. Katz, C.Y. Koo, On expected constant-round protocols for Byzantine agreement, in Advances in Cryptology\u2014CRYPTO 2006, Proceedings of 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20\u201324, 2006, Lecture Notes in Computer Science, ed. by C. Dwork (Springer, Berlin, 2006), pp. 445\u2013462"},{"key":"9172_CR33","volume-title":"The Theory of Error Correcting Codes","author":"F.J. MacWilliams","year":"1978","unstructured":"F.J. MacWilliams, N.J.A. Sloane, The Theory of Error Correcting Codes (North-Holland, Amsterdam, 1978)"},{"key":"9172_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-03356-8_29","volume-title":"Advances in Cryptology\u2014CRYPTO 2009, Proceedings of 29th Annual International Cryptology Conference","author":"A. Patra","year":"2009","unstructured":"A. Patra, A. Choudhary, T. Rabin, C. Pandu Rangan, The round complexity of verifiable secret sharing revisited, in Advances in Cryptology\u2014CRYPTO 2009, Proceedings of 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16\u201320, 2009, ed. by S. Halevi. Lecture Notes in Computer Science, vol. 5677 (Springer, Berlin, 2009), pp. 487\u2013504"},{"key":"9172_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-89754-5_15","volume-title":"Progress in Cryptology\u2014INDOCRYPT 2008, Proceedings of 9th International Conference on Cryptology in India","author":"A. Patra","year":"2008","unstructured":"A. Patra, A. Choudhary, C. Pandu Rangan, Round efficient unconditionally secure multiparty computation protocol, in Progress in Cryptology\u2014INDOCRYPT 2008, Proceedings of 9th International Conference on Cryptology in India, Kharagpur, India, December 14\u201317, 2008, ed. by D.R. Chowdhury, V. Rijmen, A. Das. Lecture Notes in Computer Science, vol. 5365 (Springer, Berlin, 2008), pp. 185\u2013199"},{"key":"9172_CR36","doi-asserted-by":"crossref","unstructured":"A. Patra, A. Choudhary, C. Pandu Rangan, Efficient asynchronous Byzantine agreement with optimal resilience. (accepted for publication) Distr. Comput. J. A preliminary version of this article appeared in Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing\u2014PODC 2009, Calgary, Alberta, Canada, 10\u201312 August, pp. 92\u2013101 (2009)","DOI":"10.1145\/1582716.1582736"},{"key":"9172_CR37","doi-asserted-by":"crossref","unstructured":"A. Patra, A. Choudhary, C. Pandu Rangan, Efficient statistical asynchronous verifiable secret sharing and multiparty computation with optimal resilience. Cryptology ePrint Archive, Report 2009\/492, 2009","DOI":"10.1007\/978-3-642-14496-7_7"},{"key":"9172_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-12678-9_12","volume-title":"Advances in Cryptology\u2014AFRICACRYPT\u201910, Proceedings of 3rd International Conference in Cryptology in Africa","author":"A. Patra","year":"2010","unstructured":"A. Patra, A. Choudhary, C. Pandu Rangan, Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience, in Advances in Cryptology\u2014AFRICACRYPT\u201910, Proceedings of 3rd International Conference in Cryptology in Africa, Stellenbosch, South Africa, May 3\u20136, 2009, ed. by D.J. Bernstein, T. Lange. Lecture Notes in Computer Science, vol. 6055 (Springer, Berlin, 2010), pp. 184\u2013202"},{"key":"9172_CR39","series-title":"Lecture Notes in Computer Science","first-page":"342","volume-title":"3rd International Conference on Security in Communication Networks\u2014SCN 2002","author":"B. Prabhu","year":"2002","unstructured":"B. Prabhu, K. Srinathan, C. Pandu Rangan, Trading players for efficiency in unconditional multiparty computation, in 3rd International Conference on Security in Communication Networks\u2014SCN 2002, Amalfi, Italy, September 11\u201313, 2002, ed. by S. Cimato, C. Galdi, G. Persiano. Lecture Notes in Computer Science, vol. 2576 (Springer, Berlin, 2002), pp. 342\u2013353. Revised papers"},{"issue":"6","key":"9172_CR40","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1145\/195613.195621","volume":"41","author":"T. Rabin","year":"1994","unstructured":"T. Rabin, Robust sharing of secrets when the dealer is honest or cheating. J. ACM 41(6), 1089\u20131109 (1994)","journal-title":"J. ACM"},{"key":"9172_CR41","first-page":"73","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing","author":"T. Rabin","year":"1989","unstructured":"T. Rabin, M. Ben-Or, 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, May 14\u201317, 1989 (ACM, New York, 1989), pp. 73\u201385"},{"issue":"11","key":"9172_CR42","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9172_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-44495-5_11","volume-title":"Progress in Cryptology\u2014INDOCRYPT 2000, Proceedings of 1st International Conference in Cryptology in India","author":"K. Srinathan","year":"2000","unstructured":"K. Srinathan, C. Pandu Rangan, Efficient asynchronous secure multiparty distributed computation, in Progress in Cryptology\u2014INDOCRYPT 2000, Proceedings of 1st International Conference in Cryptology in India, Calcutta, India, December 10\u201313, 2000, ed. by B.K. Roy, E. Okamoto. Lecture Notes in Computer Science, vol. 1977 (Springer, Berlin, 2000), pp. 117\u2013129"},{"key":"9172_CR44","series-title":"IEEE Computer Society","first-page":"160","volume-title":"Proceedings of 23rd Annual Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1982","unstructured":"A.C. Yao, Protocols for secure computations, in Proceedings of 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, 3\u20135 November 1982, IEEE Computer Society (1982), pp. 160\u2013164"},{"issue":"1","key":"9172_CR45","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/s12204-009-0112-5","volume":"14","author":"H. Zheng","year":"2009","unstructured":"H. Zheng, G. Zheng, L. Qiang, Batch secret sharing for secure multi-party computation in asynchronous network. J. Shanghai Jiaotong Univ. 14(1), 112\u2013116 (2009)","journal-title":"J. Shanghai Jiaotong Univ."}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9172-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-013-9172-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9172-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9172-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,19]],"date-time":"2022-03-19T12:23:49Z","timestamp":1647692629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-013-9172-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,11]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9172"],"URL":"https:\/\/doi.org\/10.1007\/s00145-013-9172-7","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,11]]},"assertion":[{"value":"29 November 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2013","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}