{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T10:23:23Z","timestamp":1771064603278,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s00145-021-09375-2","type":"journal-article","created":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T06:23:24Z","timestamp":1612938204000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["On the Local Leakage Resilience of Linear Secret Sharing Schemes"],"prefix":"10.1007","volume":"34","author":[{"given":"Fabrice","family":"Benhamouda","sequence":"first","affiliation":[]},{"given":"Akshay","family":"Degwekar","sequence":"additional","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,9]]},"reference":[{"key":"9375_CR1","doi-asserted-by":"crossref","unstructured":"T. Araki, J. Furukawa, Y. Lindell, A. Nof, K. Ohara, High-throughput semi-honest secure three-party computation with an honest majority, in CCS (2016)","DOI":"10.1145\/2976749.2978331"},{"key":"9375_CR2","doi-asserted-by":"crossref","unstructured":"A. Akavia, S. Goldwasser, V. Vaikuntanathan, Simultaneous hardcore bits and cryptography against memory attacks, in TCC (2009)","DOI":"10.1007\/978-3-642-00457-5_28"},{"issue":"6","key":"9375_CR3","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"CH Bennett","year":"1995","unstructured":"C.H. Bennett, G. Brassard, C. Cr\u00e9peau, U.M. Maurer, Generalized privacy amplification. IEEE Trans. Inf. Theory 41(6):1915\u20131923 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9375_CR4","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"Charles H Bennett","year":"1988","unstructured":"C.H. Bennett, G. Brassard, J.-M. Robert, Privacy amplification by public discussion. SIAM J. Comput. 17(2):210\u2013229 (1988)","journal-title":"SIAM J. Comput."},{"key":"9375_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, D. Coppersmith, M. Luby, R. Rubinfeld, Non-abelian homomorphism testing, and distributions close to their self-convolutions, in Random Structures and Algorithms (2008)","DOI":"10.1002\/rsa.20182"},{"key":"9375_CR6","doi-asserted-by":"crossref","unstructured":"F. Benhamouda, A. Degwekar, Y. Ishai, T. Rabin, On the local leakage resilience of linear secret sharing schemes, in H. Shacham and A. Boldyreva (eds.), Advances in Cryptology\u2014CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part I, Volume 10991 of Lecture Notes in Computer Science (Springer, 2018), pp. 531\u2013561","DOI":"10.1007\/978-3-319-96884-1_18"},{"key":"9375_CR7","doi-asserted-by":"crossref","unstructured":"N. Bitansky, D. Dachman-Soled, H. Lin, Leakage-tolerant computation with input-independent preprocessing, in CRYPTO (2014)","DOI":"10.1007\/978-3-662-44381-1_9"},{"key":"9375_CR8","unstructured":"D. Beaver, Efficient multiparty protocols using circuit randomization, in CRYPTO (1991)"},{"key":"9375_CR9","doi-asserted-by":"crossref","unstructured":"E. Boyle, N. Gilboa, Y. Ishai, Breaking the circuit size barrier for secure computation under DDH, in CRYPTO (2016)","DOI":"10.1007\/978-3-662-53018-4_19"},{"key":"9375_CR10","doi-asserted-by":"crossref","unstructured":"E. Boyle, S. Goldwasser, Y.T. Kalai, Leakage-resilient coin tossing, in Distributed Computing (2011)","DOI":"10.1007\/978-3-642-24100-0_16"},{"key":"9375_CR11","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in STOC (1988)","DOI":"10.1145\/62212.62213"},{"key":"9375_CR12","doi-asserted-by":"crossref","unstructured":"A. Beimel, Y. Ishai, E. Kushilevitz, I. Orlov, Share conversion and private information retrieval, in CCC (2012)","DOI":"10.1109\/CCC.2012.23"},{"key":"9375_CR13","unstructured":"A. Bogdanov, Y. Ishai, E. Viola, C. Williamson, Bounded indistinguishability and the complexity of recovering secrets, in CRYPTO 2016, Part III (2016), pp. 593\u2013618"},{"key":"9375_CR14","unstructured":"E. Boyle, L. Kohl, P. Scholl, Homomorphic secret sharing from lattices without FHE, in IACR Cryptology ePrint Archive, vol. 2019 (2019), p. 129. To appear in Eurocrypt 2019"},{"key":"9375_CR15","doi-asserted-by":"crossref","unstructured":"G.R. Blakley, Safeguarding cryptographic keys, in AFIPS National Computer Conference (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"9375_CR16","doi-asserted-by":"crossref","unstructured":"M. Blum, M. Luby, R. Rubinfeld, Self-testing\/correcting with applications to numerical problems. J. Comput. Syst. Sci. (1993)","DOI":"10.1016\/0022-0000(93)90044-W"},{"key":"9375_CR17","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols (extended abstract), in STOC (1988)","DOI":"10.1145\/62212.62214"},{"key":"9375_CR18","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz, A. Sahai, Exposure-resilient functions and all-or-nothing transforms, in International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2000), pp. 453\u2013469","DOI":"10.1007\/3-540-45539-6_33"},{"key":"9375_CR19","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, Y. Ishai, Share conversion, pseudorandom secret-sharing and applications to secure computation, in TCC 2005 (2005)","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"9375_CR20","doi-asserted-by":"crossref","unstructured":"A. Duc, S. Dziembowski, S. Faust, Unifying leakage models: from probing attacks to noisy leakage, in EUROCRYPT (2014)","DOI":"10.1007\/978-3-642-55220-5_24"},{"key":"9375_CR21","doi-asserted-by":"crossref","unstructured":"F. Dav\u00ec, S. Dziembowski, D. Venturi, Leakage-resilient storage, in J.A. Garay and R. De Prisco (eds.), SCN 10, Volume 6280 of LNCS (Springer, Heidelberg, 2010), pp. 121\u2013137","DOI":"10.1007\/978-3-642-15317-4_9"},{"key":"9375_CR22","unstructured":"S. Dziembowski, S. Faust, Leakage-resilient circuits without computational assumptions, in TCC 2012 (2012), pp. 230\u2013247"},{"key":"9375_CR23","unstructured":"Y. Dodis, S. Halevi, R.D. Rothblum, D. Wichs, Spooky encryption and its applications, in CRYPTO 2016, Part III (2016), pp. 93\u2013122"},{"key":"9375_CR24","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, F.-H. Liu, H.-S. Zhou, Leakage-resilient circuits revisited\u2014optimal number of computing components without leak-free hardware, in EUROCRYPT (2015)","DOI":"10.1007\/978-3-662-46803-6_5"},{"key":"9375_CR25","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, K. Pietrzak, Intrusion-resilient secret sharing, in FOCS (2007)","DOI":"10.1109\/FOCS.2007.4389495"},{"key":"9375_CR26","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, K. Pietrzak, Leakage-resilient cryptography, in FOCS (2008)","DOI":"10.1109\/FOCS.2008.56"},{"key":"9375_CR27","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, V. Pastro, N.P. Smart, S. Zakarias, Multiparty computation from somewhat homomorphic encryption, in CRYPTO (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"9375_CR28","doi-asserted-by":"crossref","unstructured":"Y. Dodis, A. Sahai, A. Smith, On perfect and adaptive security in exposure-resilient cryptography, in International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2001), pp. 301\u2013324","DOI":"10.1007\/3-540-44987-6_19"},{"key":"9375_CR29","unstructured":"N. Fazio, R. Gennaro, T. Jafarikhah, W.E. Skeith III, Homomorphic secret sharing from paillier encryption, in ProvSec 2017 (2017), pp. 381\u2013399"},{"key":"9375_CR30","doi-asserted-by":"crossref","unstructured":"S. Faust, T. Rabin, L. Reyzin, E. Tromer, V. Vaikuntanathan, Protecting circuits from leakage: the computationally-bounded and noisy cases, in EUROCRYPT (2010)","DOI":"10.1007\/978-3-642-13190-5_7"},{"key":"9375_CR31","doi-asserted-by":"crossref","unstructured":"V. Goyal, Y. Ishai, H.K. Maji, A. Sahai, A.A. Sherstov, Bounded-communication leakage resilience via parity-resilient circuits, in FOCS (2016)","DOI":"10.1109\/FOCS.2016.10"},{"key":"9375_CR32","doi-asserted-by":"crossref","unstructured":"D. Genkin, Y. Ishai, M. Weiss, How to construct a leakage-resilient (stateless) trusted party, in TCC (2017)","DOI":"10.1007\/978-3-319-70503-3_7"},{"key":"9375_CR33","doi-asserted-by":"crossref","unstructured":"V. Goyal, A. Kumar, Non-malleable secret sharing, in STOC (2018)","DOI":"10.1145\/3188745.3188872"},{"key":"9375_CR34","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, in STOC 1987 (1987)","DOI":"10.1145\/28395.28420"},{"key":"9375_CR35","doi-asserted-by":"crossref","unstructured":"W.T. Gowers, A new proof of Szemer\u00e9di\u2019s theorem. Geom. Funct. Anal. (2001)","DOI":"10.1007\/s00039-001-0332-9"},{"key":"9375_CR36","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, G.N. Rothblum, How to compute in the presence of leakage, in SICOMP (2015)","DOI":"10.1137\/130931461"},{"key":"9375_CR37","unstructured":"B. Green, Montr\u00e9al notes on quadratic Fourier analysis. Addit. Combin. (2007)"},{"key":"9375_CR38","doi-asserted-by":"crossref","unstructured":"B. Green, T. Tao, Linear equations in primes. Ann. Math. (2010)","DOI":"10.4007\/annals.2010.171.1753"},{"key":"9375_CR39","unstructured":"W.T. Gowers, J. Wolf, The true complexity of a system of linear equations. Proc. London Math. Soc. (2010)"},{"key":"9375_CR40","doi-asserted-by":"crossref","unstructured":"W.T. Gowers, J. Wolf, Linear forms and higher-degree uniformity for functions On $$\\mathbb{F}_n^p $$. Geom. Funct. Anal. (2011)","DOI":"10.1007\/s00039-010-0106-3"},{"key":"9375_CR41","doi-asserted-by":"crossref","unstructured":"W.T. Gowers, J. Wolf, Linear forms and quadratic uniformity for functions on $$ \\mathbb{F}_n^p $$. Mathematika (2011)","DOI":"10.1112\/S0025579311001264"},{"key":"9375_CR42","doi-asserted-by":"crossref","unstructured":"V. Guruswami, M. Wootters, Repairing Reed\u2013Solomon codes. IEEE Trans. Inf. Theory (2017)","DOI":"10.1145\/2897518.2897525"},{"key":"9375_CR43","doi-asserted-by":"crossref","unstructured":"Y. Ishai, A. Sahai, D.A. Wagner, Private circuits: securing hardware against probing attacks, in CRYPTO (2003)","DOI":"10.1007\/978-3-540-45146-4_27"},{"key":"9375_CR44","doi-asserted-by":"crossref","unstructured":"P. Kocher, D. Genkin, D. Gruss, W. Haas, M. Hamburg, M. Lipp, S. Mangard, T. Prescher, M. Schwarz, Y. Yarom, Spectre attacks: exploiting speculative execution. ArXiv e-prints, January (2018)","DOI":"10.1109\/SP.2019.00002"},{"key":"9375_CR45","doi-asserted-by":"crossref","unstructured":"P.C. Kocher, J. Jaffe, B. Jun, Differential power analysis, in CRYPTO (1999)","DOI":"10.1007\/3-540-48405-1_25"},{"key":"9375_CR46","doi-asserted-by":"crossref","unstructured":"A. Kumar, R. Meka, A. Sahai, Leakage-resilient secret sharing, in FOCS (2019)","DOI":"10.1109\/FOCS.2019.00045"},{"key":"9375_CR47","doi-asserted-by":"crossref","unstructured":"P.C. Kocher, Timing attacks on implementations of Diffie\u2013Hellman, RSA, DSS, and other systems, in CRYPTO (1996)","DOI":"10.1007\/3-540-68697-5_9"},{"key":"9375_CR48","doi-asserted-by":"crossref","unstructured":"M. Keller, E. Orsini, P. Scholl, MASCOT: faster malicious arithmetic secure computation with oblivious transfer, in CCS (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"9375_CR49","doi-asserted-by":"crossref","unstructured":"E. Kiltz, K. Pietrzak, Leakage resilient elgamal encryption, in ASIACRYPT (2010)","DOI":"10.1007\/978-3-642-17373-8_34"},{"key":"9375_CR50","unstructured":"M. Lipp, M. Schwarz, D. Gruss, T. Prescher, W. Haas, S. Mangard, P. Kocher, D. Genkin, Y. Yarom, M. Hamburg, Meltdown. ArXiv e-prints (2018)"},{"key":"9375_CR51","unstructured":"H. Maji, A. Paskin-Cherniavsky, T. Suad, M. Wang, On leakage-resilient secret sharing. Cryptology ePrint Archive, Report 2020\/1517 (2020). https:\/\/eprint.iacr.org\/2020\/1517"},{"key":"9375_CR52","doi-asserted-by":"crossref","unstructured":"S. Micali, L. Reyzin, Physically observable cryptography (extended abstract), in TCC (2004)","DOI":"10.1007\/978-3-540-24638-1_16"},{"key":"9375_CR53","unstructured":"J.B. Nielsen, M. Simkin, Lower bounds for leakage-resilient secret sharing. Cryptology ePrint Archive, Report 2019\/181 (2019). https:\/\/eprint.iacr.org\/2019\/181"},{"key":"9375_CR54","doi-asserted-by":"crossref","unstructured":"R.L. Rivest, All-or-nothing encryption and the package transform, in International Workshop on Fast Software Encryption (Springer, 1997), pp. 210\u2013218","DOI":"10.1007\/BFb0052348"},{"key":"9375_CR55","doi-asserted-by":"crossref","unstructured":"G.N. Rothblum, How to compute under $${{\\sf AC}}^0$$ leakage without secure hardware, in R. Safavi-Naini and R. Canetti (eds.), CRYPTO\u00a02012, Volume 7417 of LNCS (Springer, Heidelberg, 2012), pp. 552\u2013569","DOI":"10.1007\/978-3-642-32009-5_32"},{"key":"9375_CR56","doi-asserted-by":"crossref","unstructured":"A. Shamir, How to share a secret. Commun. ACM (1979)","DOI":"10.1145\/359168.359176"},{"key":"9375_CR57","unstructured":"A. Srinivasan, P.N. Vasudevan, Leakage resilient secret sharing and applications, in IACR Cryptology ePrint Archive, vol. 2018 (2018), p. 1154"},{"key":"9375_CR58","doi-asserted-by":"crossref","unstructured":"T. Tao, V.H. Vu, Additive Combinatorics (Cambridge University Press, 2006)","DOI":"10.1017\/CBO9780511755149"},{"key":"9375_CR59","unstructured":"A.C.-C. Yao, How to generate and exchange secrets (extended abstract), in FOCS (1986)"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09375-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-021-09375-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09375-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T03:03:58Z","timestamp":1619319838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-021-09375-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,9]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9375"],"URL":"https:\/\/doi.org\/10.1007\/s00145-021-09375-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,9]]},"assertion":[{"value":"3 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"10"}}