{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,19]],"date-time":"2026-10-19T07:11:21Z","timestamp":1792393881584,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642253843","type":"print"},{"value":"9783642253850","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25385-0_32","type":"book-chapter","created":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T18:18:18Z","timestamp":1322763498000},"page":"590-609","source":"Crossref","is-referenced-by-count":53,"title":["Computational Verifiable Secret Sharing Revisited"],"prefix":"10.1007","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Backes, M., Kate, A., Patra, A.: Computational Verifiable Secret Sharing Revisited. Cryptology ePrint Archive, Report 2011\/281 (2011)","DOI":"10.1007\/978-3-642-25385-0_32"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding Cryptographic Keys. In: The National Computer Conference, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems. In: ACM CCS 2002, pp. 88\u201397 (2002)","DOI":"10.1145\/586110.586124"},{"key":"32_CR4","unstructured":"Canetti, R.: Studies in Secure Multiparty Computation and Applications. Ph.D. thesis, The Weizmann Institute of Science (1996)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast Asynchronous Byzantine Agreement with Optimal Resilience. In: ACM STOC 1993, pp. 42\u201351 (1993)","DOI":"10.1145\/167088.167105"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In: IEEE FOCS 1985, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-36178-2_22","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"P. D\u2019Arco","year":"2002","unstructured":"D\u2019Arco, P., Stinson, D.R.: On Unconditionally Secure Robust Distributed Key Distribution Centers. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 346\u2013363. Springer, Heidelberg (2002)"},{"issue":"1","key":"32_CR8","doi-asserted-by":"crossref","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. J. ACM 40(1), 17\u201347 (1993)","journal-title":"J. ACM"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A Practical Scheme for Non-interactive Verifiable Secret Sharing. In: IEEE FOCS 1987, pp. 427\u2013437 (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"32_CR10","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.A., Gollakota, S., Rangan, C.P., 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":"32_CR11","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: ACM STOC 2001, pp. 580\u2013589 (2001)","DOI":"10.1145\/380752.380853"},{"issue":"1","key":"32_CR12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R. Gennaro","year":"2007","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. J. of Cryptology 20(1), 51\u201383 (2007)","journal-title":"J. of Cryptology"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and Fact-Track Multiparty Computations with Applications to Threshold Cryptography. In: ACM PODC 1998, pp. 101\u2013111 (1998)","DOI":"10.1145\/277697.277716"},{"issue":"3","key":"32_CR14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. J. Cryptology 9(3), 167\u2013190 (1996)","journal-title":"J. Cryptology"},{"issue":"3","key":"32_CR15","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity for all languages in np have zero-knowledge proof systems. J. ACM 38(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O.: Statistically-hiding commitment from any one-way function. In: ACM STOC 2007, pp. 1\u201310 (2007)","DOI":"10.1145\/1250790.1250792"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-68697-5_16","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"S. Halevi","year":"1996","unstructured":"Halevi, S., Micali, S.: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 201\u2013215. Springer, Heidelberg (1996)"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"A. Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive Secret Sharing or: How to Cope with Perpetual Leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 339\u2013352. Springer, Heidelberg (1995)"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Kate, A., Goldberg, I.: Distributed Key Generation for the Internet. In: Proc. Intl. Conf. on Distributed Computing Systems (ICDCS), pp. 119\u2013128 (2009)","DOI":"10.1109\/ICDCS.2009.21"},{"key":"32_CR20","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.-Y., 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":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-17373-8_25","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"R. Kumaresan","year":"2010","unstructured":"Kumaresan, R., Patra, A., Rangan, C.P.: The Round Complexity of Verifiable Secret Sharing: The Statistical Case. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 431\u2013447. Springer, Heidelberg (2010)"},{"issue":"2","key":"32_CR22","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M. Naor","year":"1998","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect Zero-Knowledge Arguments for P Using Any One-Way Permutation. J. Cryptology 11(2), 87\u2013108 (1998)","journal-title":"J. Cryptology"},{"key":"32_CR23","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., Rangan, C.P.: The Round Complexity of Verifiable Secret Sharing Revisited. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 487\u2013504. Springer, Heidelberg (2009)"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Efficient Asynchronous Byzantine Agreement with Optimal Resilience. In: ACM PODC 2009, pp. 92\u2013101 (2009)","DOI":"10.1145\/1582716.1582736"},{"key":"32_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-14496-7_7","volume-title":"Information Theoretic Security","author":"A. Patra","year":"2010","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience. In: Kurosawa, K. (ed.) Information Theoretic Security. LNCS, vol.\u00a05973, pp. 74\u201392. Springer, Heidelberg (2010)"},{"key":"32_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T.P. Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A Threshold Cryptosystem Without a Trusted Party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)"},{"key":"32_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"32_CR28","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). In: ACM STOC 1989, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"issue":"4","key":"32_CR29","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/1880022.1880028","volume":"13","author":"D.A. Schultz","year":"2010","unstructured":"Schultz, D.A., Liskov, B., Liskov, M.: MPSS: Mobile Proactive Secret Sharing. ACM Trans. Inf. Syst. Secur. 13(4), 34 (2010)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"11","key":"32_CR30","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"},{"issue":"3","key":"32_CR31","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1145\/1085126.1085127","volume":"8","author":"L. Zhou","year":"2005","unstructured":"Zhou, L., Schneider, F.B., van Renesse, R.: APSS: Proactive Secret Sharing in Asynchronous Systems. ACM Trans. Inf. Syst. Secur. 8(3), 259\u2013286 (2005)","journal-title":"ACM Trans. Inf. Syst. Secur."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25385-0_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T11:51:51Z","timestamp":1620042711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25385-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642253843","9783642253850"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25385-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}