{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:07:00Z","timestamp":1763968020344,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144950"},{"type":"electronic","value":"9783642144967"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14496-7_7","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T11:51:35Z","timestamp":1284119495000},"page":"74-92","source":"Crossref","is-referenced-by-count":26,"title":["Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience"],"prefix":"10.1007","author":[{"given":"Arpita","family":"Patra","sequence":"first","affiliation":[]},{"given":"Ashish","family":"Choudhary","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_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: PODC, pp. 311\u2013322 (2008)","DOI":"10.1145\/1400751.1400804"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D. Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 420\u2013432. Springer, Heidelberg (1992)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/11681878_16","volume-title":"Theory of Cryptography","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2006","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Efficient multi-party computation with dispute control. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 305\u2013328. Springer, Heidelberg (2006)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-540-76900-2_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2007","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Simple and efficient perfectly-secure asynchronous MPC. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 376\u2013392. Springer, Heidelberg (2007)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 213\u2013230. Springer, Heidelberg (2008)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: STOC, pp. 52\u201361 (1993)","DOI":"10.1145\/167088.167109"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"BenOr, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience. In: PODC, pp. 183\u2013192 (1994)","DOI":"10.1145\/197917.198088"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An asynchronous $\\lfloor (n - 1) \/ 3 \\rfloor$-resilient consensus protocol. In: PODC, pp. 154\u2013162 (1984)","DOI":"10.1145\/800222.806743"},{"key":"7_CR10","unstructured":"Canetti, R.: Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute, Israel (1995)"},{"key":"7_CR11","first-page":"42","volume-title":"Proc. of STOC 1993","author":"R. Canetti","year":"1993","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous Byzantine Agreement with optimal resilience. In: Proc. of STOC 1993, pp. 42\u201351. ACM, New York (1993)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Chaum, D., Crpeau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: STOC, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"7_CR14","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 - EUROCRYPT \u201999","author":"R. Cramer","year":"1999","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 311\u2013326. Springer, Heidelberg (1999)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.M.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. JACM\u00a040(1), 17\u201347 (1993)","journal-title":"JACM"},{"key":"7_CR17","first-page":"639","volume-title":"Proc. of STOC 1988","author":"P. Feldman","year":"1988","unstructured":"Feldman, P., Micali, S.: An optimal algorithm for synchronous Byzantine Agreemet. In: Proc. of STOC 1988, pp. 639\u2013648. ACM, New York (1988)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11681878_17","volume-title":"Theory of Cryptography","author":"M. Fitzi","year":"2006","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.) TCC 2006. LNCS, vol.\u00a03876, pp. 329\u2013342. Springer, Heidelberg (2006)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: STOC, pp. 580\u2013589 (2001)","DOI":"10.1145\/380752.380853"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U., Przydatek, B.: Efficient secure multiparty computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 143\u2013161. Springer, Heidelberg (2000)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-540-70583-3_41","volume-title":"Automata, Languages and Programming","author":"J. Katz","year":"2008","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.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 499\u2013510. Springer, Heidelberg (2008)"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11818175_27","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J. Katz","year":"2006","unstructured":"Katz, J., Koo, C.Y.: On expected constant round protocols for Byzantine Agreement. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 445\u2013462. Springer, Heidelberg (2006)"},{"key":"7_CR24","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 - CRYPTO 2009","author":"A. Patra","year":"2009","unstructured":"Patra, A., Choudhary, A., Rabin, T., Pandu Rangan, C.: The round complexity of verifiable secret sharing re-visited. In: Halevi, S. (ed.) Advances in Cryptology - CRYPTO 2009. LNCS, vol.\u00a05677, pp. 487\u2013504. Springer, Heidelberg (2009)"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Patra, A., Choudhary, A., Pandu Rangan, C.: Efficient statistical asynchronous verifiable secret sharing and multiparty computation with optimal resilience. Cryptology ePrint Archive (2009)","DOI":"10.1007\/978-3-642-14496-7_7"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Patra, A., Choudhary, A., Pandu Rangan, C.: Simple and efficient asynchronous Byzantine Agreement with optimal resilience. In: PODC, pp. 92\u2013101 (2009)","DOI":"10.1145\/1582716.1582736"},{"issue":"6","key":"7_CR27","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1145\/195613.195621","volume":"41","author":"T. Rabin","year":"1994","unstructured":"Rabin, T.: Robust sharing of secrets when the dealer is honest or cheating. J. ACM\u00a041(6), 1089\u20131109 (1994)","journal-title":"J. ACM"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14496-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T22:58:19Z","timestamp":1675724299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14496-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144950","9783642144967"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14496-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}