{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T01:53:22Z","timestamp":1778291602281,"version":"3.51.4"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911002","type":"print"},{"value":"9783031911019","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-91101-9_3","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T21:14:22Z","timestamp":1745788462000},"page":"64-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Physical-Bit Leakage Resilience of\u00a0Linear Code-Based Secret Sharing"],"prefix":"10.1007","author":[{"given":"Hai H.","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Adams, D.Q., et al.: Lower bounds for leakage-resilient secret sharing schemes against probing attacks. In: ISIT (2021)","DOI":"10.1109\/ISIT45174.2021.9518230"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-030-26951-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Aggarwal","year":"2019","unstructured":"Aggarwal, D., et al.: Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 510\u2013539. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_18"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-030-17653-2_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Badrinarayanan","year":"2019","unstructured":"Badrinarayanan, S., Srinivasan, A.: Revisiting non-malleable secret sharing. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 593\u2013622. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_20"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-319-96884-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"F Benhamouda","year":"2018","unstructured":"Benhamouda, F., Degwekar, A., Ishai, Y., Rabin, T.: On the local leakage resilience of linear secret sharing schemes. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 531\u2013561. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_18"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09375-2","volume":"34","author":"F Benhamouda","year":"2021","unstructured":"Benhamouda, F., Degwekar, A., Ishai, Y., Rabin, T.: On the local leakage resilience of linear secret sharing schemes. J. Cryptol. 34(2), 1\u201365 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09375-2","journal-title":"J. Cryptol."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-662-49890-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"A Bishop","year":"2016","unstructured":"Bishop, A., Pastro, V., Rajaraman, R., Wichs, D.: Essentially optimal robust secret sharing with maximal corruptions. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 58\u201386. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_3"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-28914-9_15","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2012","unstructured":"Bitansky, N., Canetti, R., Halevi, S.: Leakage-tolerant interactive protocols. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 266\u2013284. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_15"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of AFIPS 1979 National Computer Conference, vol. 48, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-26951-7_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Bogdanov","year":"2019","unstructured":"Bogdanov, A., Ishai, Y., Srinivasan, A.: Unconditionally secure computation against low-complexity leakage. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 387\u2013416. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_14"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Brandao, L., Peralta, R.: NIST first call for multi-party threshold schemes. https:\/\/csrc.nist.gov\/publications\/detail\/nistir\/8214c\/draft Jan 25 2023","DOI":"10.6028\/NIST.IR.8214C.ipd"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Chandran, N., Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Short leakage resilient and non-malleable secret sharing schemes In: Dodis, Y., Shrimpton, T. (eds.): Advances in Cryptology \u2013 CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part I. Springer Nature Switzerland, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_7","DOI":"10.1007\/978-3-031-15802-5_7"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, E., et al.: Extractors and secret sharing against bounded collusion protocols. In: 61st FOCS, pp. 1226\u20131242. IEEE Computer Society Press, November 2020. https:\/\/doi.org\/10.1109\/FOCS46700.2020.00117","DOI":"10.1109\/FOCS46700.2020.00117"},{"issue":"8","key":"3_CR13","doi-asserted-by":"publisher","first-page":"5165","DOI":"10.1109\/TIT.2022.3167615","volume":"68","author":"R Con","year":"2022","unstructured":"Con, R., Tamo, I.: Nonlinear repair of reed-solomon codes. IEEE Trans. Inf. Theory 68(8), 5165\u20135177 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3167615","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Costes, N., Stam, M.: Redundant code-based masking revisited. IACR Trans. Cryptograph. Hardw. Embedded Syst. 426\u2013450 (2020). https:\/\/doi.org\/10.46586\/tches.v2021.i1.426-450","DOI":"10.46586\/tches.v2021.i1.426-450"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-15317-4_9","volume-title":"Security and Cryptography for Networks","author":"F Dav\u00ec","year":"2010","unstructured":"Dav\u00ec, F., Dziembowski, S., Venturi, D.: Leakage-resilient storage. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 121\u2013137. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_9"},{"issue":"9","key":"3_CR16","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"AG Dimakis","year":"2010","unstructured":"Dimakis, A.G., Godfrey, P.B., Wu, Y., Wainwright, M.J., Ramchandran, K.: Network coding for distributed storage systems. IEEE Trans. Inform. Theory 56(9), 4539\u20134551 (2010). https:\/\/doi.org\/10.1109\/TIT.2010.2054295","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1007\/978-3-642-25385-0_38","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"S Dziembowski","year":"2011","unstructured":"Dziembowski, S., Faust, S.: Leakage-resilient cryptography from the inner-product extractor. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 702\u2013721. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_38"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-662-49099-0_11","volume-title":"Theory of Cryptography","author":"S Dziembowski","year":"2016","unstructured":"Dziembowski, S., Faust, S., Sk\u00f3rski, M.: Optimal amplification of noisy leakages. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 291\u2013318. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_11"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Pietrzak, K.: Intrusion-resilient secret sharing. In: 48th FOCS, pp. 227\u2013237. IEEE Computer Society Press (Oct 2007). https:\/\/doi.org\/10.1109\/FOCS.2007.63","DOI":"10.1109\/FOCS.2007.63"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"El Rouayheb, S., Ramchandran, K.: Fractional repetition codes for repair in distributed storage systems. In: 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1510\u20131517. IEEE (2010)","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Faust, S., Masure, L., Micheli, E., Orlt, M., Standaert, F-X.: Connecting leakage-resilient secret sharing to practice: Scaling trends and physical dependencies of prime field masking. In: Joye, M., Leander, G., editors, EUROCRYPT\u00a02024, Part\u00a0IV, vol. 14654 of LNCS, pp. 316\u2013344. Springer, Cham (May 2024). https:\/\/doi.org\/10.1007\/978-3-031-58737-5_12","DOI":"10.1007\/978-3-031-58737-5_12"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-030-17659-4_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Fehr","year":"2019","unstructured":"Fehr, S., Yuan, C.: Towards optimal robust secret sharing with security against a rushing adversary. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 472\u2013499. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_16"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-030-64381-2_17","volume-title":"Theory of Cryptography","author":"S Fehr","year":"2020","unstructured":"Fehr, S., Yuan, C.: Robust secret sharing with almost optimal share size and security against rushing adversaries. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 470\u2013498. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_17"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Goparaju, S., El Rouayheb, S., Calderbank, R. and Poor, H.V.: Data secrecy in distributed storage systems under exact repair. In: 2013 International Symposium on Network Coding (NetCod), pp. 1\u20136. IEEE (2013)","DOI":"10.1109\/NetCod.2013.6570831"},{"issue":"10","key":"3_CR25","doi-asserted-by":"publisher","first-page":"6318","DOI":"10.1109\/TIT.2017.2690662","volume":"63","author":"S Goparaju","year":"2017","unstructured":"Goparaju, S., Fazeli, A., Vardy, A.: Minimum storage regenerating codes for all parameters. IEEE Trans. Inf. Theory 63(10), 6318\u20136328 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. In: Diakonikolas, I., Kempe, D., Henzinger, M., eds., In: 50th ACM STOC, pp. 685\u2013698. ACM Press (June 2018). https:\/\/doi.org\/10.1145\/3188745.3188872","DOI":"10.1145\/3188745.3188872"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Gupta, U., Mahdavifar, H.: Bounds on the statistical leakage-resilience of Shamir\u2019s secret sharing. In: IEEE International Symposium on Information Theory, ISIT 2024, Athens, Greece, July 7-12, 2024, pp. 184\u2013189. IEEE (2024). https:\/\/doi.org\/10.1109\/ISIT57864.2024.10619359","DOI":"10.1109\/ISIT57864.2024.10619359"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Guruswami, V., Wootters, M.: Repairing reed-solomon codes. In: Wichs, D., Mansour, Y., eds., In: 48th ACM STOC, pp. 216\u2013226. ACM Press (June 2016). https:\/\/doi.org\/10.1145\/2897518.2897525","DOI":"10.1145\/2897518.2897525"},{"issue":"9","key":"3_CR29","doi-asserted-by":"publisher","first-page":"5684","DOI":"10.1109\/TIT.2017.2702660","volume":"63","author":"V Guruswami","year":"2017","unstructured":"Guruswami, V., Wootters, M.: Repairing reed-solomon codes. IEEE Trans. Inf. Theory 63(9), 5684\u20135698 (2017). https:\/\/doi.org\/10.1109\/TIT.2017.2702660","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR30","unstructured":"Hall, J.I.: Notes on coding theory (2010). https:\/\/www.semanticscholar.org\/paper\/Notes-on-Coding-Theory-Hall\/f1b4e0ecbeeeb8d89c6076f4c86ba15e0d8b34b0"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Hazay, C., Venkitasubramaniam, M., Weiss, M.: The price of active security in cryptographic protocols. In: Canteaut, A., Ishai, Y., editors, EUROCRYPT\u00a02020, Part\u00a0II, volume 12106 of LNCS, pages 184\u2013215. Springer, Cham (May 2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_7","DOI":"10.1007\/978-3-030-45724-2_7"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Hazay, C., Venkitasubramaniam, M., Weiss, M.: Protecting distributed primitives against leakage: Equivocal secret sharing and more. In: Dachman-Soled, D., editor, 3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5-7, 2022, Cambridge, MA, USA, vol. 230 LIPIcs, pp. 3:1\u20133:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2022. https:\/\/doi.org\/10.4230\/LIPICS.ITC.2022.3","DOI":"10.4230\/LIPICS.ITC.2022.3"},{"key":"3_CR33","doi-asserted-by":"publisher","unstructured":"Hoffmann, C., Simkin, M.: Stronger lower bounds for leakage-resilient secret sharing. In: Aly, A., Tibouchi, M., editors, LATINCRYPT\u00a02023, vol. 14168 of LNCS, pp. 215\u2013228. Springer, Cham (Oct 2023). https:\/\/doi.org\/10.1007\/978-3-031-44469-2_11","DOI":"10.1007\/978-3-031-44469-2_11"},{"key":"3_CR34","unstructured":"Hwang, J., Maji, H.K., Nguyen, H.H., Ye, X.: Leakage-resilience of shamir\u2019s secret sharing: Identifying secure evaluation places. https:\/\/www.cs.purdue.edu\/homes\/hmaji\/papers\/HMNY24.pdf (2024)"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-45146-4_27","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463\u2013481. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_27"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-031-78023-3_13","volume-title":"Theory of Cryptography: 22nd International Conference, TCC 2024, Milan, Italy, December 2\u20136, 2024, Proceedings, Part IV","author":"D Kasser","year":"2025","unstructured":"Kasser, D.: An improvement upon the\u00a0bounds for\u00a0the\u00a0local leakage resilience of\u00a0Shamir\u2019s secret sharing scheme. In: Boyle, E., Mahmoody, M. (eds.) Theory of Cryptography: 22nd International Conference, TCC 2024, Milan, Italy, December 2\u20136, 2024, Proceedings, Part IV, pp. 395\u2013422. Springer Nature Switzerland, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_13"},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"Klein, O., Komargodski, I.: New bounds on the local leakage resilience of Shamir\u2019s secret sharing scheme. In: Handschuh, H., Lysyanskaya, A., editors, CRYPTO\u00a02023, Part\u00a0I, volume 14081 of LNCS, pages 139\u2013170. Springer, Cham (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_5","DOI":"10.1007\/978-3-031-38557-5_5"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"PC Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104\u2013113. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_9"},{"key":"3_CR39","doi-asserted-by":"publisher","unstructured":"Kumar, A., Meka, R., Sahai, A.: Leakage-resilient secret sharing against colluding parties. In: Zuckerman, D., editor, 60th FOCS, pp. 636\u2013660. IEEE Computer Society Press (Nov 2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00045","DOI":"10.1109\/FOCS.2019.00045"},{"key":"3_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-030-77886-6_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"HK Maji","year":"2021","unstructured":"Maji, H.K., Nguyen, H.H., Paskin-Cherniavsky, A., Suad, T., Wang, M.: Leakage-resilience of the shamir secret-sharing scheme against physical-bit leakages. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 344\u2013374. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_12"},{"key":"3_CR41","doi-asserted-by":"publisher","unstructured":"Maji, H.K., et al.: Tight estimate of the local leakage resilience of the additive secret-sharing scheme and its consequences. In: Dachman-Soled, D., editor, In: 3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5-7, 2022, Cambridge, MA, USA, volume 230 of LIPIcs, pp. 16:1\u201316:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2022.16","DOI":"10.4230\/LIPIcs.ITC.2022.16"},{"key":"3_CR42","doi-asserted-by":"publisher","unstructured":"Maji, H.K., Nguyen, H.H., Paskin-Cherniavsky, A., Wang, M.: Improved bound on the local leakage-resilience of shamir\u2019s secret sharing. In: IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, June 26 - July 1, 2022, pp. 2678\u20132683. IEEE (2022). https:\/\/doi.org\/10.1109\/ISIT50566.2022.9834695","DOI":"10.1109\/ISIT50566.2022.9834695"},{"key":"3_CR43","doi-asserted-by":"publisher","unstructured":"Maji, H.K., Nguyen, H.H., Paskin-Cherniavsky, A., Ye, X.: Constructing leakage-resilient Shamir\u2019s secret sharing: Over composite order fields. In: Joye, M., Leander, G., editors, EUROCRYPT\u00a02024, Part\u00a0IV, volume 14654 of LNCS, pp. 286\u2013315. Springer, Cham, May 2024. https:\/\/doi.org\/10.1007\/978-3-031-58737-5_11","DOI":"10.1007\/978-3-031-58737-5_11"},{"key":"3_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/978-3-030-84252-9_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"HK Maji","year":"2021","unstructured":"Maji, H.K., Paskin-Cherniavsky, A., Suad, T., Wang, M.: Constructing locally leakage-resilient linear secret-sharing schemes. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 779\u2013808. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_26"},{"key":"3_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-030-56877-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"P Manurangsi","year":"2020","unstructured":"Manurangsi, P., Srinivasan, A., Vasudevan, P.N.: Nearly optimal robust secret sharing against rushing adversaries. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 156\u2013185. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_6"},{"key":"3_CR46","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp. 276\u2013279 (1993)"},{"key":"3_CR47","unstructured":"Massey, J.L.: Some applications of coding theory in cryptography. Codes and Ciphers: Cryptography and Coding IV, pp. 33\u201347 (1995)"},{"key":"3_CR48","doi-asserted-by":"publisher","unstructured":"Nguyen, H.H.: Towards breaking the half-barrier of local leakage-resilient shamir\u2019s secret sharing. In: Reyzin, L., Stebila, D., editors, CRYPTO\u00a02024, Part\u00a0V, vol. 4924 of LNCS, pp. 257\u2013285. Springer, Cham, (Aug 2024). https:\/\/doi.org\/10.1007\/978-3-031-68388-6_10","DOI":"10.1007\/978-3-031-68388-6_10"},{"key":"3_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-030-45721-1_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"JB Nielsen","year":"2020","unstructured":"Nielsen, J.B., Simkin, M.: Lower bounds for leakage-resilient secret sharing. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 556\u2013577. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_20"},{"issue":"5","key":"3_CR50","doi-asserted-by":"publisher","first-page":"3021","DOI":"10.1109\/TIT.2013.2241819","volume":"59","author":"DS Papailiopoulos","year":"2013","unstructured":"Papailiopoulos, D.S., Dimakis, A.G., Cadambe, V.R.: Repair optimal erasure codes through Hadamard designs. IEEE Trans. Inform. Theory 59(5), 3021\u20133037 (2013). https:\/\/doi.org\/10.1109\/TIT.2013.2241819","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"3_CR51","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"KV Rashmi","year":"2011","unstructured":"Rashmi, K.V., Shah, N.B., Kumar, P.V.: Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Trans. Inform. Theory 57(8), 5227\u20135239 (2011). https:\/\/doi.org\/10.1109\/TIT.2011.2159049","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"3_CR52","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. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"3_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-030-26951-7_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Srinivasan","year":"2019","unstructured":"Srinivasan, A., Vasudevan, P.N.: Leakage resilient secret sharing and applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 480\u2013509. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_17"},{"issue":"3","key":"3_CR54","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1109\/TIT.2012.2227110","volume":"59","author":"I Tamo","year":"2012","unstructured":"Tamo, I., Wang, Z., Bruck, J.: Zigzag codes: Mds array codes with optimal rebuilding. IEEE Trans. Inf. Theory 59(3), 1597\u20131616 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"3_CR55","doi-asserted-by":"publisher","first-page":"4466","DOI":"10.1109\/TIT.2016.2553675","volume":"62","author":"Z Wang","year":"2016","unstructured":"Wang, Z., Tamo, I., Bruck, J.: Explicit minimum storage regenerating codes. IEEE Trans. Inf. Theory 62(8), 4466\u20134480 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"3_CR56","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1109\/TIT.2017.2661313","volume":"63","author":"M Ye","year":"2017","unstructured":"Ye, M., Barg, A.: Explicit constructions of high-rate MDS array codes with optimal repair bandwidth. IEEE Trans. Inf. Theory 63(4), 2001\u20132014 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"3_CR57","doi-asserted-by":"publisher","first-page":"6307","DOI":"10.1109\/TIT.2017.2730863","volume":"63","author":"M Ye","year":"2017","unstructured":"Ye, M., Barg, A.: Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization. IEEE Trans. Inf. Theory 63(10), 6307\u20136317 (2017)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91101-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T21:14:27Z","timestamp":1745788467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91101-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911002","9783031911019"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91101-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}