{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:30Z","timestamp":1765113030209,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683879"},{"type":"electronic","value":"9783031683886"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68388-6_10","type":"book-chapter","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T08:02:51Z","timestamp":1723795371000},"page":"257-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards Breaking the\u00a0Half-Barrier of\u00a0Local Leakage-Resilient Shamir\u2019s 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":[[2024,8,17]]},"reference":[{"key":"10_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":"10_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":"10_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, Part I. LNCS, vol. 11476, pp. 593\u2013622. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_20"},{"key":"10_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, Part I. LNCS, vol. 10991, pp. 531\u2013561. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_18"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"10","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), 10 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09375-2","journal-title":"J. Cryptol."},{"key":"10_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, Part I. LNCS, vol. 9665, pp. 58\u201386. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_3"},{"key":"10_CR7","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":"10_CR8","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, Part II. LNCS, vol. 11693, pp. 387\u2013416. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_14"},{"key":"10_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-031-15802-5_7","volume-title":"CRYPTO 2022, Part I","author":"N Chandran","year":"2022","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.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 178\u2013207. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_7"},{"key":"10_CR10","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 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00117","DOI":"10.1109\/FOCS46700.2020.00117"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Con, R., Shutty, N., Tamo, I., Wootters, M.: Repairing reed-solomon codes over prime fields via exponential sums. In: IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, 25\u201330 June 2023, pp. 1330\u20131335. IEEE (2023). https:\/\/doi.org\/10.1109\/ISIT54713.2023.10206937","DOI":"10.1109\/ISIT54713.2023.10206937"},{"issue":"8","key":"10_CR12","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"},{"issue":"9","key":"10_CR13","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. Inf. Theory 56(9), 4539\u20134551 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR14","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":"10_CR15","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":"10_CR16","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, Part III. LNCS, vol. 12552, pp. 470\u2013498. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_17"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Goparaju, S., El Rouayheb, S., Calderbank, R., 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":"10_CR18","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"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00039-001-0332-9","volume":"11","author":"WT Gowers","year":"2001","unstructured":"Gowers, W.T.: A new proof of szemer\u00e9di\u2019s theorem. Geom. Funct. Anal. GAFA 11(3), 465\u2013588 (2001)","journal-title":"Geom. Funct. Anal. GAFA"},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1112\/plms\/pdp019","volume":"100","author":"WT Gowers","year":"2010","unstructured":"Gowers, W.T., Wolf, J.: The true complexity of a system of linear equations. Proc. London Math. Soc. 100(1), 155\u2013176 (2010)","journal-title":"Proc. London Math. Soc."},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th ACM STOC, pp. 685\u2013698. ACM Press (2018). https:\/\/doi.org\/10.1145\/3188745.3188872","DOI":"10.1145\/3188745.3188872"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Green, B., Tao, T.: Linear equations in primes. Ann. Math. 1753\u20131850 (2010)","DOI":"10.4007\/annals.2010.171.1753"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Guruswami, V., Wootters, M.: Repairing reed-solomon codes. In: Wichs, D., Mansour, Y. (eds.) 48th ACM STOC, pp. 216\u2013226. ACM Press (2016). https:\/\/doi.org\/10.1145\/2897518.2897525","DOI":"10.1145\/2897518.2897525"},{"issue":"9","key":"10_CR24","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":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-030-45724-2_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"C Hazay","year":"2020","unstructured":"Hazay, C., Venkitasubramaniam, M., Weiss, M.: The price of active security in cryptographic protocols. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part II. LNCS, vol. 12106, pp. 184\u2013215. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_7"},{"key":"10_CR26","unstructured":"Hwang, J., Maji, H.K., Nguyen, H.H., Ye, X.: Leakage-resilience of shamir\u2019s secret sharing: identifying secure evaluation places (2024). https:\/\/www.cs.purdue.edu\/homes\/hmaji\/papers\/HMNY24.pdf"},{"key":"10_CR27","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":"10_CR28","unstructured":"Iwaniec, H., Kowalski, E.: Analytic Number Theory, vol. 53. American Mathematical Society (2021)"},{"key":"10_CR29","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-031-38557-5_5","volume-title":"CRYPTO 2023, Part I","author":"O Klein","year":"2023","unstructured":"Klein, O., Komargodski, I.: New bounds on the local leakage resilience of Shamir\u2019s secret sharing scheme. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part I. LNCS, vol. 14081, pp. 139\u2013170. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_5"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Kumar, A., Meka, R., Sahai, A.: Leakage-resilient secret sharing against colluding parties. In: Zuckerman, D. (ed.) 60th FOCS, pp. 636\u2013660. IEEE Computer Society Press (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00045","DOI":"10.1109\/FOCS.2019.00045"},{"key":"10_CR31","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, Part II. LNCS, vol. 12697, pp. 344\u2013374. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_12"},{"key":"10_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-031-22318-1_13","volume-title":"TCC 2022, Part I","author":"HK Maji","year":"2022","unstructured":"Maji, H.K., et al.: Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part I. LNCS, vol. 13747, pp. 355\u2013383. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_13"},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Maji, H.K., et al.: Tight estimate of the local leakage resilience of the additive secret-sharing scheme & its consequences. In: Dachman-Soled, D. (ed.) 3rd Conference on Information-Theoretic Cryptography, ITC 2022, 5\u20137 July 2022, Cambridge, MA, USA. LIPIcs, vol. 230, 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":"10_CR34","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, 26 June\u20131 July 2022, pp. 2678\u20132683. IEEE (2022). https:\/\/doi.org\/10.1109\/ISIT50566.2022.9834695","DOI":"10.1109\/ISIT50566.2022.9834695"},{"key":"10_CR35","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-031-58737-5_11","volume-title":"EUROCRYPT 2024, Part IV","author":"HK Maji","year":"2024","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. (eds.) EUROCRYPT 2024, Part IV. LNCS, vol. 14654, pp. 286\u2013315. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58737-5_11"},{"key":"10_CR36","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, Part III. LNCS, vol. 12827, pp. 779\u2013808. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_26"},{"key":"10_CR37","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, Part III. LNCS, vol. 12172, pp. 156\u2013185. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_6"},{"key":"10_CR38","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, Part I. LNCS, vol. 12105, pp. 556\u2013577. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_20"},{"issue":"5","key":"10_CR39","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. Inf. Theory 59(5), 3021\u20133037 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"10_CR40","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. Inf. Theory 57(8), 5227\u20135239 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/S0025579300000644","volume":"2","author":"KF Roth","year":"1955","unstructured":"Roth, K.F.: Rational approximations to algebraic numbers. Mathematika 2(1), 1\u201320 (1955)","journal-title":"Mathematika"},{"key":"10_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0080437","volume-title":"Equations over finite fields: an elementary approach","author":"WM Schmidt","year":"2006","unstructured":"Schmidt, W.M.: Equations over finite fields: an elementary approach, vol. 536. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/BFb0080437"},{"issue":"11","key":"10_CR43","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."},{"issue":"3","key":"10_CR44","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1112\/blms\/bds115","volume":"45","author":"X Shao","year":"2013","unstructured":"Shao, X.: On character sums and exponential sums over generalized arithmetic progressions. Bull. Lond. Math. Soc. 45(3), 541\u2013550 (2013)","journal-title":"Bull. Lond. Math. Soc."},{"key":"10_CR45","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, Part II. LNCS, vol. 11693, pp. 480\u2013509. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_17"},{"issue":"3","key":"10_CR46","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"},{"key":"10_CR47","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755149","volume-title":"Additive Combinatorics","author":"T Tao","year":"2006","unstructured":"Tao, T., Vu, V.H.: Additive Combinatorics, vol. 105. Cambridge University Press, Cambridge (2006)"},{"issue":"8","key":"10_CR48","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":"10_CR49","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":"10_CR50","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"},{"issue":"1","key":"10_CR51","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ffa.2011.06.003","volume":"18","author":"X Zhao","year":"2012","unstructured":"Zhao, X.: A note on multiple exponential sums in function fields. Finite Fields Appl. 18(1), 35\u201355 (2012)","journal-title":"Finite Fields Appl."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68388-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T08:04:38Z","timestamp":1723795478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68388-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683879","9783031683886"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68388-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","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":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}