{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T06:26:27Z","timestamp":1766298387277,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000761","name":"Imperial College London","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000761","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10623-018-0578-y","type":"journal-article","created":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T11:57:31Z","timestamp":1541073451000},"page":"1777-1796","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Nearly optimal robust secret sharing"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8957-0306","authenticated-orcid":false,"given":"Mahdi","family":"Cheraghchi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,1]]},"reference":[{"key":"578_CR1","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. In: National Computer Conference, vol.\u00a048, pp. 313\u2013317. Springer (1979)."},{"key":"578_CR2","doi-asserted-by":"crossref","unstructured":"Bishop A., Pastro V.: Robust secret sharing schemes against local adversaries. In: Proceedings of Public-Key Cryptography (PKC), pp. 327\u2013356 (2016).","DOI":"10.1007\/978-3-662-49387-8_13"},{"key":"578_CR3","doi-asserted-by":"crossref","unstructured":"Bishop A., Pastro V., Rajaraman R., Wichs D.: Essentially optimal robust secret sharing with maximal corruptions. In: Proceedings of the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT\u00a02016), pp. 58\u201386 (2016).","DOI":"10.1007\/978-3-662-49890-3_3"},{"key":"578_CR4","unstructured":"Bellare M., Tessaro S., Vardy A.: Semantic security for the wiretap channel. In: Proceedings of Advances in Cryptology CRYPTO 2012, Lecture Notes in Computer Science, vol. 7417, pp. 294\u2013311. Springer (2012)."},{"key":"578_CR5","unstructured":"Chen H., Cramer R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: Advances in Cryptology\u2014CRYPTO 2006, Lecture Notes in Computer Science, vol. 4117, pp. 521\u2013536. Springer (2006)."},{"key":"578_CR6","unstructured":"Cramer R., Damg\u00e5rd I., D\u00f6ttling N., Fehr S., Spini G.: Linear secret sharing schemes from error correcting codes and universal hash functions. In: Advances in Cryptology\u2014EUROCRYPT 2015, Lecture Notes in Computer Science, vol. 9057, pp. 313\u2013336. Springer (2015)."},{"key":"578_CR7","unstructured":"Cramer R., Damg\u00e5rd I., Fehr S.: On the cost of reconstructing a secret, or VSS with optimal reconstruction phase. In: Proceedings of Advances in Cryptology CRYPTO 2001, Lecture Notes in Computer Science, vol. 2139, pp. 503\u2013523. Springer (2001)."},{"key":"578_CR8","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: Advances in Cryptology - EUROCRYPT 2008, Lecture Notes in Computer Science, vol. 4965, pp. 471\u2013488. Springer (2008)."},{"key":"578_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"R Cramer","year":"2015","unstructured":"Cramer R., Damg\u00e5rd I., Nielsen J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press, Cambridge (2015)."},{"key":"578_CR10","unstructured":"Cevallos A., Fehr S., Ostrovsky R., Rabani Y.: Unconditionally-secure robust secret sharing with compact shares. In: Proceedings of Advances in Cryptology EUROCRYPT 2012, Lecture Notes in Computer Science, vol. 7237, pp. 195\u2013208. Springer (2012)."},{"issue":"3","key":"578_CR11","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1109\/TIT.1978.1055892","volume":"24","author":"I Csisz\u00e1r","year":"1978","unstructured":"Csisz\u00e1r I., K\u00f6rner J.: Broadcast channels with confidential messages. IEEE Trans. Inf. Theory 24(3), 339\u2013348 (1978).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"578_CR12","unstructured":"Cabello S., Padr\u00f3 C., S\u00e1ez G.: Secret sharing schemes with detection of cheaters for a general access structure. In: Proceedings of Fundamentals of Computation Theory, Lecture Notes in Computer Science, vol. 1684, pp. 185\u2013194. Springer (1999)."},{"key":"578_CR13","first-page":"481","volume-title":"Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model","author":"R Cramer","year":"2015","unstructured":"Cramer R., Padr\u00f3 C., Xing C.: Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model, pp. 481\u2013501. Springer, Berlin (2015)."},{"issue":"1","key":"578_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/18.61123","volume":"37","author":"P Elias","year":"1991","unstructured":"Elias P.: Error-correcting codes for list decoding. IEEE Trans. Inf. Theory 37(1), 5\u201312 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"578_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TIT.2007.911222","volume":"54","author":"V Guruswami","year":"2008","unstructured":"Guruswami V., Rudra A.: Explicit codes achieving list decoding capacity: error-correction with optimal redundancy. IEEE Trans. Inf. Theory 54(1), 135\u2013150 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"578_CR16","doi-asserted-by":"crossref","unstructured":"Guruswami V., Smith A.: Codes for computationally simple channels: explicit constructions with optimal rate. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 723\u2013732 (2010).","DOI":"10.1109\/FOCS.2010.74"},{"issue":"2","key":"578_CR17","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1561\/0400000007","volume":"2","author":"V Guruswami","year":"2007","unstructured":"Guruswami V.: Algorithmic results in list decoding. Found. Trends Theor. Comput. Sci. 2(2), 107\u2013195 (2007).","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"578_CR18","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Xing, C.: Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets. In: SODA, pp. 1858\u20131866 (2014).","DOI":"10.1137\/1.9781611973402.134"},{"key":"578_CR19","unstructured":"Ishai Y., Ostrovsky R., Seyalioglu H.: Identifying cheaters without an honest majority. In: Proceedings of Theory of Cryptography (TCC\u00a02012), Lecture Notes in Computer Science, vol. 7194, pp. 21\u201338. Springer (2012)."},{"issue":"5","key":"578_CR20","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1109\/TIT.1977.1055763","volume":"23","author":"S Leung-Yan-Cheong","year":"1977","unstructured":"Leung-Yan-Cheong S.: On a special class of wiretap channels (corresp.). IEEE Trans. Inf. Theory 23(5), 625\u2013627 (1977).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"578_CR21","doi-asserted-by":"crossref","unstructured":"Rabin T., Ben-Or M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing (STOC \u201989), pp. 73\u201385 (1989).","DOI":"10.1145\/73007.73014"},{"key":"578_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968","volume-title":"Introduction to Coding Theory","author":"RM Roth","year":"2006","unstructured":"Roth R.M.: Introduction to Coding Theory. Cambridge University Press, Cambridge (2006)."},{"issue":"11","key":"578_CR23","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":"5","key":"578_CR24","first-page":"554","volume":"23","author":"R Safavi-Naini","year":"2015","unstructured":"Safavi-Naini R., Wang P.: A model for adversarial wiretap channels and its applications. J. Inf. Process. 23(5), 554\u2013561 (2015).","journal-title":"J. Inf. Process."},{"issue":"4","key":"578_CR25","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"DR Stinson","year":"1992","unstructured":"Stinson D.R.: An explication of secret sharing schemes. Des. Codes Cryptogr. 2(4), 357\u2013390 (1992).","journal-title":"Des. Codes Cryptogr."},{"key":"578_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-76878-4","volume-title":"Algebraic Function Fields and Codes","author":"H Stichtenoth","year":"2009","unstructured":"Stichtenoth H.: Algebraic Function Fields and Codes, 2nd edn. Springer, Berlin (2009).","edition":"2"},{"key":"578_CR27","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"AD Wyner","year":"1975","unstructured":"Wyner A.D.: The wire-tap channel. Bell Syst. Tech. J. 54, 1355\u20131387 (1975).","journal-title":"Bell Syst. Tech. J."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0578-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0578-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0578-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T01:16:59Z","timestamp":1662340619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0578-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,1]]},"references-count":27,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["578"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0578-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2018,11,1]]},"assertion":[{"value":"23 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}