{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T11:05:08Z","timestamp":1777287908883,"version":"3.51.4"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031158018","type":"print"},{"value":"9783031158025","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-15802-5_7","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T16:59:52Z","timestamp":1665507592000},"page":"178-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Short Leakage Resilient and\u00a0Non-malleable Secret Sharing Schemes"],"prefix":"10.1007","author":[{"given":"Nishanth","family":"Chandran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhavana","family":"Kanukurthi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sai Lakshmi Bhavana","family":"Obbattu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sruthi","family":"Sekar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-662-46494-6_17","volume-title":"Theory of Cryptography","author":"D Aggarwal","year":"2015","unstructured":"Aggarwal, D., Dziembowski, S., Kazana, T., Obremski, M.: Leakage-resilient non-malleable codes. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part I. LNCS, vol. 9014, pp. 398\u2013426. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_17"},{"key":"7_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, Part II. LNCS, vol. 11693, pp. 510\u2013539. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_18"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-642-00457-5_28","volume-title":"Theory of Cryptography","author":"A Akavia","year":"2009","unstructured":"Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 474\u2013495. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_28"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Kanukurthi, B., Obbattu, S.L.B., Obremski, M., Sekar, S.: Rate one-third non-malleable codes. In: Proceedings of the Symposium on Theory of Computing, STOC 2022 (2022)","DOI":"10.1145\/3519935.3519972"},{"issue":"6","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"CH Bennett","year":"1995","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Maurer, U.M.: Generalized privacy amplification. IEEE Trans. Inf. Theory 41(6), 1915\u20131923 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C Bennett","year":"1988","unstructured":"Bennett, C., Brassard, G., Robert, J.-M.: Privacy amplification by public discussion. SIAM J. Comput. 17(2), 210\u2013229 (1988)","journal-title":"SIAM J. Comput."},{"key":"7_CR7","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"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-56877-1_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"G Brian","year":"2020","unstructured":"Brian, G., Faonio, A., Obremski, M., Simkin, M., Venturi, D.: Non-malleable secret sharing against bounded joint-tampering attacks in the plain model. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 127\u2013155. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_5"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-030-36033-7_8","volume-title":"Theory of Cryptography","author":"G Brian","year":"2019","unstructured":"Brian, G., Faonio, A., Venturi, D.: Continuously non-malleable secret sharing for general access structures. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019, Part II. LNCS, vol. 11892, pp. 211\u2013232. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_8"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-24100-0_16","volume-title":"Distributed Computing","author":"E Boyle","year":"2011","unstructured":"Boyle, E., Goldwasser, S., Kalai, Y.T.: Leakage-resilient coin tossing. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 181\u2013196. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24100-0_16"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"J Benaloh","year":"1990","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27\u201335. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_3"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, Monval, NJ, USA, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"7_CR14","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":"7_CR15","unstructured":"Bellare, M., Tessaro, S.: Polynomial-time, semantically-secure encryption achieving the secrecy capacity. CoRR arXiv:1201.3160 (2012)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-45539-6_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"R Canetti","year":"2000","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-resilient functions and all-or-nothing transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 453\u2013469. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_33"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1109\/TIT.2011.2170660","volume":"58","author":"M Cheraghchi","year":"2012","unstructured":"Cheraghchi, M., Didier, F., Shokrollahi, A.: Invertible extractors and wiretap protocols. IEEE Trans. Inf. Theory 58(2), 1254\u20131274 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., et al.: Extractors and secret sharing against bounded collusion protocols. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16\u201319 November 2020, pp. 1226\u20131242. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00117"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-030-84252-9_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"N Chandran","year":"2021","unstructured":"Chandran, N., Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Adaptive extractors and their application to leakage resilient secret sharing. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 595\u2013624. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_20"},{"key":"7_CR21","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"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"Y Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008). arXiv:cs\/0602007","DOI":"10.1137\/060651380"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Intrusion-resilient secret sharing. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007, Washington, DC, USA, pp. 227\u2013237. IEEE Computer Society (2007)","DOI":"10.1109\/FOCS.2007.63"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-44987-6_19","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"Y Dodis","year":"2001","unstructured":"Dodis, Y., Sahai, A., Smith, A.: On perfect and adaptive security in exposure-resilient cryptography. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 301\u2013324. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_19"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/3-540-46885-4_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201989","author":"Y Frankel","year":"1990","unstructured":"Frankel, Y.: A practical protocol for large group oriented networks. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 56\u201361. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_8"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-13190-5_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S Faust","year":"2010","unstructured":"Faust, S., Rabin, T., Reyzin, L., Tromer, E., Vaikuntanathan, V.: Protecting circuits from leakage: the computationally-bounded and noisy cases. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 135\u2013156. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_7"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-030-26951-7_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Faonio","year":"2019","unstructured":"Faonio, A., Venturi, D.: Non-malleable secret sharing in the computational setting: adaptive tampering, noisy-leakage resilience, and improved rate. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part II. LNCS, vol. 11693, pp. 448\u2013479. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_16"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Goyal, V., Ishai, Y., Maji, H.K., Sahai, A., Sherstov, A.A.: Bounded-communication leakage resilience via parity-resilient circuits. In: Dinur, I. (ed.) IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, Hyatt Regency, New Brunswick, New Jersey, USA, 9\u201311 October 2016, pp. 1\u201310. IEEE Computer Society (2016)","DOI":"10.1109\/FOCS.2016.10"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, 25\u201329 June 2018, pp. 685\u2013698 (2018)","DOI":"10.1145\/3188745.3188872"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, New York City, 25\u201327 May 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Wootters, M.: Repairing reed-solomon codes. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2016, New York, NY, USA, pp. 216\u2013226. ACM (2016)","DOI":"10.1145\/2897518.2897525"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Hazay, C., Venkitasubramaniam, M., Weiss, M.: ZK-PCPs from leakage-resilient secret sharing. IACR Cryptol. ePrint Arch. 2021 (2021)","DOI":"10.1007\/s00145-022-09433-3"},{"key":"7_CR34","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":"7_CR35","doi-asserted-by":"crossref","unstructured":"Kumar, A., Meka, R., Sahai, A.: Leakage-resilient secret sharing against colluding parties. In: Zuckerman, D. (ed.) 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, 9\u201312 November 2019, pp. 636\u2013660. IEEE Computer Society (2019)","DOI":"10.1109\/FOCS.2019.00045"},{"key":"7_CR36","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":"7_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-319-78372-7_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Kanukurthi","year":"2018","unstructured":"Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Non-malleable randomness encoders and\u00a0their applications. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part III. LNCS, vol. 10822, pp. 589\u2013617. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_19"},{"key":"7_CR38","unstructured":"Lin, F., Cheraghchi, M., Guruswami, V., Safavi-Naini, R., Wang, H.: Secret sharing with binary shares. In: Blum, A. (ed.) 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, San Diego, California, USA, volume 124 of LIPIcs, 10\u201312 January 2019, pp. 53:1\u201353:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-642-32009-5_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"F-H Liu","year":"2012","unstructured":"Liu, F.-H., Lysyanskaya, A.: Tamper and leakage resilience in the split-state model. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 517\u2013532. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_30"},{"key":"7_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, Part II. LNCS, vol. 12697, pp. 344\u2013374. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_12"},{"key":"7_CR41","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":"7_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-24638-1_16","volume-title":"Theory of Cryptography","author":"S Micali","year":"2004","unstructured":"Micali, S., Reyzin, L.: Physically observable cryptography. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 278\u2013296. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_16"},{"key":"7_CR43","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":"1","key":"7_CR44","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci. 52(1), 43\u201353 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0052348","volume-title":"Fast Software Encryption","author":"RL Rivest","year":"1997","unstructured":"Rivest, R.L.: All-or-nothing encryption and the package transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 210\u2013218. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052348"},{"key":"7_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-642-32009-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"GN Rothblum","year":"2012","unstructured":"Rothblum, G.N.: How to compute under $${\\cal{AC}}^{\\sf 0}$$ leakage without secure hardware. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 552\u2013569. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_32"},{"issue":"1","key":"7_CR47","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1006\/jcss.2002.1824","volume":"65","author":"R Raz","year":"2002","unstructured":"Raz, R., Reingold, O., Vadhan, S.: Extracting all the randomness and reducing the error in Trevisan\u2019s extractors. J. Comput. Syst. Sci. 65(1), 97\u2013128 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR48","doi-asserted-by":"crossref","unstructured":"De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: Leighton, F.T., Goodrich, M.T. (eds.) Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, Montr\u00e9al, Qu\u00e9bec, Canada, 23\u201325 May 1994, pp. 522\u2013533. ACM (1994)","DOI":"10.1145\/195058.195405"},{"issue":"11","key":"7_CR49","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"},{"key":"7_CR50","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"},{"key":"7_CR51","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Construction of extractors using pseudo-random generators (extended abstract). In: STOC, pp. 141\u2013148 (1999)","DOI":"10.1145\/301250.301289"},{"issue":"4","key":"7_CR52","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1145\/502090.502099","volume":"48","author":"L Trevisan","year":"2001","unstructured":"Trevisan, L.: Extractors and pseudorandom generators. J. ACM 48(4), 860\u2013879 (2001)","journal-title":"J. ACM"},{"key":"7_CR53","doi-asserted-by":"crossref","unstructured":"Vadhan, S.: Pseudorandomness. Foundations and Trends in Theoretical Computer Science. Now Publishers (2012). http:\/\/people.seas.harvard.edu\/~salil\/pseudorandomness\/","DOI":"10.1561\/0400000010"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15802-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:06:46Z","timestamp":1760134006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15802-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031158018","9783031158025"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15802-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 October 2022","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}