{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T18:25:44Z","timestamp":1787163944550,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662498897","type":"print"},{"value":"9783662498903","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49890-3_3","type":"book-chapter","created":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T00:40:46Z","timestamp":1461717646000},"page":"58-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Essentially Optimal Robust Secret Sharing with Maximal Corruptions"],"prefix":"10.1007","author":[{"given":"Allison","family":"Bishop","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valerio","family":"Pastro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: International Workshop on Managing Requirements Knowledge, pp. 313\u2013317. IEEE Computer Society (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bishop, A., Pastro, V., Rajaraman, R., Wichs, D.: Essentially optimal robust secret sharing with maximal corruptions. IACR Cryptology ePrint Archive, 2015:1032 (2015)","DOI":"10.1007\/978-3-662-49890-3_3"},{"issue":"6","key":"3_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0020-0190(97)00135-X","volume":"63","author":"C Blundo","year":"1997","unstructured":"Blundo, C., De Santis, A.: Lower bounds for robust secret sharing schemes. Inf. Process. Lett. 63(6), 317\u2013321 (1997)","journal-title":"Inf. Process. Lett."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-662-46803-6_11","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damg\u00e5rd, I.B., D\u00f6ttling, N., Fehr, S., Spini, G.: Linear secret sharing schemes from error correcting codes and universal hash functions. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 313\u2013336. Springer, Heidelberg (2015)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/3-540-44647-8_30","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Fehr, S.: On the cost of reconstructing a secret, or VSS with optimal reconstruction phase. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 503\u2013523. Springer, Heidelberg (2001)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R Cramer","year":"2008","unstructured":"Cramer, R., Dodis, Y., Fehr, S., Padr\u00f3, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 471\u2013488. Springer, Heidelberg (2008)"},{"key":"3_CR7","unstructured":"Cevallos, A.: Reducing the share size in robust secret sharing (2011). http:\/\/www.algant.eu\/documents\/theses\/cevallos.pdf"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-29011-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Cevallos","year":"2012","unstructured":"Cevallos, A., Fehr, S., Ostrovsky, R., Rabani, Y.: Unconditionally-secure robust secret sharing with compact shares. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 195\u2013208. Springer, Heidelberg (2012)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M.: Nearly optimal robust secret sharing. IACR Cryptology ePrint Archive, 2015:951 (2015)","DOI":"10.1109\/ISIT.2016.7541751"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-48285-7_10","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"M Carpentieri","year":"1994","unstructured":"Carpentieri, M., De Santis, A., Vaccaro, U.: Size of shares and probability of cheating in threshold schemes. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 118\u2013125. Springer, Heidelberg (1994)"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1137\/S0097539701387660","volume":"31","author":"U Feige","year":"2002","unstructured":"Feige, U., Krauthgamer, R.: A polylogarithmic approximation of the minimum bisection. SIAM J. Comput. 31(4), 1090\u20131118 (2002)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified np-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-39884-1_9","volume-title":"Financial Cryptography and Data Security","author":"MP Jhanwar","year":"2013","unstructured":"Jhanwar, M.P., Safavi-Naini, R.: Unconditionally-secure robust secret sharing with minimum share size. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 96\u2013110. Springer, Heidelberg (2013)"},{"key":"3_CR14","unstructured":"Lewko, A.B., Pastro, V.: Robust secret sharing schemes against local adversaries. IACR Cryptology ePrint Archive, 2014:909 (2014)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: Dwork, C. (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, 17\u201320 May 2008, pp. 255\u2013264. ACM (2008)","DOI":"10.1145\/1374376.1374415"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: Johnson, D.S. (ed.) Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, Washigton, USA, 14\u201317 May 1989, pp. 73\u201385. ACM (1989)","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"3_CR17","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 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M Sudan","year":"1997","unstructured":"Sudan, M.: Decoding of reed solomon codes beyond the error-correction bound. J. Complex. 13(1), 180\u2013193 (1997)","journal-title":"J. Complex."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49890-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T18:03:28Z","timestamp":1748887408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49890-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662498897","9783662498903"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49890-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}