{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:03:10Z","timestamp":1783008190445,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642360947","type":"print"},{"value":"9783642360954","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36095-4_17","type":"book-chapter","created":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T05:56:11Z","timestamp":1360562171000},"page":"259-276","source":"Crossref","is-referenced-by-count":29,"title":["Asynchronous Computational VSS with Reduced Communication Complexity"],"prefix":"10.1007","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amit","family":"Datta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_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: Proceedings of ACM PODC 2008, pp. 405\u2013414 (2008)","DOI":"10.1145\/1400751.1400804"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-85230-8_26","volume-title":"Financial Cryptography and Data Security","author":"M.H. Au","year":"2008","unstructured":"Au, M.H., Susilo, W., Mu, Y.: Practical Anonymous Divisible E-Cash from Bounded Accumulators. In: Tsudik, G. (ed.) FC 2008. LNCS, vol.\u00a05143, pp. 287\u2013301. Springer, Heidelberg (2008)"},{"key":"17_CR3","unstructured":"Backes, M., Datta, A., Kate, A.: Asynchronous Computational VSS with Reduced Communication Complexity. Cryptology ePrint Archive, Report 2012\/619 (2012), http:\/\/eprint.iacr.org\/2012\/619"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-642-25385-0_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"M. Backes","year":"2011","unstructured":"Backes, M., Kate, A., Patra, A.: Computational Verifiable Secret Sharing Revisited. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 590\u2013609. Springer, Heidelberg (2011)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous Secure Computation. In: Proceedings of ACM STOC 1993, pp. 52\u201361 (1993)","DOI":"10.1145\/167088.167109"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding Cryptographic Keys. In: Proceedings of the National Computer Conference, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short Signatures Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 56\u201373. Springer, Heidelberg (2004)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An Asynchronous [(n-1)\/3]-Resilient Consensus Protocol. In: Proceedings of PODC 1984, pp. 154\u2013162 (1984)","DOI":"10.1145\/800222.806743"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems. In: Proceedings of ACM CCS 2002, pp. 88\u201397 (2002)","DOI":"10.1145\/586110.586124"},{"key":"17_CR10","unstructured":"Canetti, R.: Studies in Secure Multiparty Computation and Applications. Ph.D. thesis, The Weizmann Institute of Science (1996)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast Asynchronous Byzantine Agreement with Optimal Resilience. In: Proceedings of ACM STOC 1993, pp. 42\u201351 (1993)","DOI":"10.1145\/167088.167105"},{"key":"17_CR12","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: Proceedings of IEEE FOCS 1985, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S.: On the Complexity of Verifiable Secret Sharing and Multiparty Computation. In: Proceedings of STOC 2000, pp. 325\u2013334 (2000)","DOI":"10.1145\/335305.335343"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D. Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on Information Exchange for Byzantine Agreement. Journal of ACM\u00a032(1), 191\u2013204 (1985)","journal-title":"Journal of ACM"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A Practical Scheme for Non-interactive Verifiable Secret Sharing. In: Proceedings of IEEE FOCS 1987, pp. 427\u2013437 (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"17_CR16","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":"17_CR17","doi-asserted-by":"crossref","unstructured":"Kate, A., Goldberg, I.: Distributed Key Generation for the Internet. In: Proceedings of 29th IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 119\u2013128 (2009)","DOI":"10.1109\/ICDCS.2009.21"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A. Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-Size Commitments to Polynomials and Their Applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 177\u2013194. Springer, Heidelberg (2010)"},{"key":"17_CR19","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":"17_CR20","doi-asserted-by":"crossref","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Efficient Asynchronous Byzantine Agreement with Optimal Resilience. In: Proceedings of ACM PODC 2009, pp. 92\u2013101 (2009)","DOI":"10.1145\/1582716.1582736"},{"key":"17_CR21","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":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"issue":"4","key":"17_CR23","doi-asserted-by":"publisher","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.\u00a013(4), 34 (2010)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"11","key":"17_CR24","doi-asserted-by":"publisher","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\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"3","key":"17_CR25","doi-asserted-by":"publisher","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 (TISSec)\u00a08(3), 259\u2013286 (2005)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSec)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36095-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T06:52:46Z","timestamp":1688021566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36095-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360947","9783642360954"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36095-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}