{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T01:54:53Z","timestamp":1778291693114,"version":"3.51.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031780226","type":"print"},{"value":"9783031780233","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-78023-3_13","type":"book-chapter","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T10:51:32Z","timestamp":1733136692000},"page":"395-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Improvement Upon the\u00a0Bounds for\u00a0the\u00a0Local Leakage Resilience of\u00a0Shamir\u2019s Secret Sharing Scheme"],"prefix":"10.1007","author":[{"given":"Dustin","family":"Kasser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Balister, P., et al.: Flat littlewood polynomials exist. Ann. Math. 192(3)977\u20131004 (2020). https:\/\/doi.org\/10.4007\/annals.2020.192.3.6","DOI":"10.4007\/annals.2020.192.3.6"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing. STOC \u201988. Chicago, Illinois, USA: Association for Computing Machinery, 1988, pp. 1\u201310. isbn: 0897912640. https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., et al.: On the Local Leakage Resilience of Linear Secret Sharing Schemes. In: J. Cryptology 34 (2018). https:\/\/api.semanticscholar.org\/CorpusID:206716311","DOI":"10.1007\/s00145-021-09375-2"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Benhamouda, F., et al.: On the local leakage resilience of linear secret sharing schemes. In: J. Cryptology 34(2) (2021). Publisher Copyright: 2021, The Author(s), under exclusive licence to International Association for Cryptologic Research. issn: 0933-2790. https:\/\/doi.org\/10.1007\/s00145-021-09375-2","DOI":"10.1007\/s00145-021-09375-2"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing. STOC \u201988. Chicago, Illinois, USA: Association for Computing Machinery, 1988, pp. 11\u201319 (1988). isbn: 0897912640. https:\/\/doi.org\/10.1145\/62212.62214.","DOI":"10.1145\/62212.62214."},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"De Santis, A., et al.: How to share a function securely. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing. STOC \u201994. Montreal, Quebec, Canada: Association for Computing Machinery, 1994, pp. 522\u2013533 (1994). isbn: 0897916638. https:\/\/doi.org\/10.1145\/195058.195405.","DOI":"10.1145\/195058.195405."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Advances in Cryptology - CRYPTO\u2019 89 Proceedings. Ed. by Gilles Brassard. New York, NY: Springer New York, 1990, pp. 307\u2013315 (1990). isbn: 978-0-387-34805-6","DOI":"10.1007\/0-387-34805-0_28"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Faust, S., et al.: Protecting circuits from leakage: the computationally- bounded and noisy cases. In: Advances in Cryptology - EUROCRYPT 2010. Ed. by Henri Gilbert. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 135\u2013156 (2010). isbn: 978-3-642-13190-5","DOI":"10.1007\/978-3-642-13190-5_7"},{"key":"13_CR9","unstructured":"Frankel, Y.: A practical protocol for large group oriented networks. In: Advances in Cryptology - EUROCRYPT \u201989. Ed. by Jean-Jacques Quisquater and Joos Vandewalle. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990, pp. 56\u201361 (1990). isbn: 978-3-540-46885-1"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing. STOC \u201987. New York, New York, USA: Association for Computing Machinery, 1987, pp. 218\u2013229 (1987). isbn: 0897912217. https:\/\/doi.org\/10.1145\/28395.28420.","DOI":"10.1145\/28395.28420."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Advances in Cryptology - CRYPTO 2003. Ed. by Dan Boneh. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 463\u2013481 (2003). isbn: 978-3-540-45146-4","DOI":"10.1007\/978-3-540-45146-4_27"},{"key":"13_CR12","unstructured":"Klein, O., Komargodski, I.: New bounds on the local leakage resilience of Shamir\u2019s secret sharing scheme. Cryptology ePrint Archive, Paper 2023\/805 (2023). https:\/\/eprint.iacr.org\/2023\/805"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Lev, V.F.: Linear equations over Fp and moments of exponential sums. Duke Math. J. 107(2), 239\u2013263 (2001). https:\/\/doi.org\/10.1215\/S0012-7094-01-10722-9","DOI":"10.1215\/S0012-7094-01-10722-9"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Maji, H.K., et al.: Constructing locally leakage-resilient linear secret-sharing schemes. In: Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Proceedings. Ed. by Tal Malkin and Chris Peikert. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Publisher Copyright: 2021, International Association for Cryptologic Research.; 41st Annual International Cryptology Conference, CRYPTO 2021 ; Conference date: 16-08- 2021 Through 20-08-2021. Springer Science and Business Media Deutschland GmbH, 2021, pp. 779\u2013808 (2021). isbn: 9783030842512. https:\/\/doi.org\/10.1007\/978-3-030-84252-9_26","DOI":"10.1007\/978-3-030-84252-9_26"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Maji, H.K., et al.: Improved bound on the local leakage-resilience of shamir\u2019s secret sharing. In: 2022 IEEE International Symposium on Information Theory (ISIT). Espoo, Finland: IEEE Press, 2022, pp. 2678\u2013 2683. https:\/\/doi.org\/10.1109\/ISIT50566.2022.9834695","DOI":"10.1109\/ISIT50566.2022.9834695"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Nielsen, J.B., Simkin, M.: Lower bounds for leakage-resilient secret sharing. In: Advances in Cryptology - EUROCRYPT (2020). https:\/\/eprint.iacr.org\/2019\/181","DOI":"10.1007\/978-3-030-45721-1_20"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Rothblum, G.N.: How to compute under AC0 leakage without secure hardware. In: Advances in Cryptology - CRYPTO 2012. Ed. by Reihaneh Safavi-Naini and Ran Canetti. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 552\u2013569 (2012). isbn: 978-3-642-32009-5","DOI":"10.1007\/978-3-642-32009-5_32"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Shamir, A.: How to share a secret. In: Commun. ACM 22(11), 612\u2013613 (1979).issn: 0001-0782. https:\/\/doi.org\/10.1145\/359168.359176","DOI":"10.1145\/359168.359176"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78023-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T11:05:01Z","timestamp":1733137501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78023-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"ISBN":["9783031780226","9783031780233"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78023-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"3 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}