{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:58:16Z","timestamp":1767139096150,"version":"build-2238731810"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"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,10]]},"DOI":"10.1007\/s00145-021-09402-2","type":"journal-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T13:26:02Z","timestamp":1628515562000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Unconditionally Secure Computation Against Low-Complexity Leakage"],"prefix":"10.1007","volume":"34","author":[{"given":"Andrej","family":"Bogdanov","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Akshayaram","family":"Srinivasan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,9]]},"reference":[{"key":"9402_CR1","doi-asserted-by":"publisher","unstructured":"M. Ajtai, Secure computation with information leaking to an adversary, in Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, (San Jose, CA, USA, 2011) 6-8 June 2011. pp. 715\u2013724, https:\/\/doi.org\/10.1145\/1993636.1993731","DOI":"10.1145\/1993636.1993731"},{"key":"9402_CR2","unstructured":"A. Akavia, A. Bogdanov, S. Guo, A. Kamath, A. Rosen, Candidate weak pseudorandom functions in AC$$^0$$$$o$$ MOD$$_2$$, in Naor, M. (ed.) ITCS 2014. pp. 251\u2013260. ACM (Jan 2014)"},{"key":"9402_CR3","doi-asserted-by":"crossref","unstructured":"P. Ananth, Y. Ishai, A. Sahai, Private circuits: A modular approach, in Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part III. pp. 427\u2013455 (2018)","DOI":"10.1007\/978-3-319-96878-0_15"},{"key":"9402_CR4","doi-asserted-by":"crossref","unstructured":"A. Battistello, J.S. Coron, E. Prouff, R. Zeitoun, Horizontal side-channel attacks and countermeasures on the ISW masking scheme, in Gierlichs, B., Poschmann, A.Y. (eds.) CHES\u00a02016. LNCS, vol. 9813, pp. 23\u201339. (Springer, Heidelberg, Aug 2016)","DOI":"10.1007\/978-3-662-53140-2_2"},{"key":"9402_CR5","doi-asserted-by":"crossref","unstructured":"S. Bela\u00efd, F. Benhamouda, A. Passel\u00e8gue, E. Prouff, A. Thillard, D. Vergnaud, Randomness complexity of private circuits for multiplication, in Fischlin, M., Coron, J.S. (eds.) EUROCRYPT\u00a02016, Part\u00a0II. LNCS, vol. 9666, pp. 616\u2013648. Springer, Heidelberg (May 2016)","DOI":"10.1007\/978-3-662-49896-5_22"},{"key":"9402_CR6","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) pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9402_CR7","doi-asserted-by":"publisher","unstructured":"F. Benhamouda, A. Degwekar, Y. Ishai, T. Rabin, On the local leakage resilience of linear secret sharing schemes, in Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, (Santa Barbara, CA, USA, August 19-23, 2018), Proceedings, Part I. (2018) pp. 531\u2013561 https:\/\/doi.org\/10.1007\/978-3-319-96884-1_18","DOI":"10.1007\/978-3-319-96884-1_18"},{"key":"9402_CR8","doi-asserted-by":"publisher","unstructured":"N. Bitansky, R. Canetti, S. Halevi, Leakage-tolerant interactive protocols, in Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, (Taormina, Sicily, Italy, March 19-21, 2012). Proceedings. (2012), pp. 266\u2013284, https:\/\/doi.org\/10.1007\/978-3-642-28914-9_15","DOI":"10.1007\/978-3-642-28914-9_15"},{"key":"9402_CR9","doi-asserted-by":"crossref","unstructured":"N. Bitansky, D. Dachman-Soled, H. Lin, Leakage-tolerant computation with input-independent preprocessing, in CRYPTO. (2014), pp. 146\u2013163","DOI":"10.1007\/978-3-662-44381-1_9"},{"key":"9402_CR10","doi-asserted-by":"crossref","unstructured":"A. Bogdanov, Y. Ishai, E. Viola, C. Williamson, Bounded indistinguishability and the complexity of recovering secrets, in Robshaw, M., Katz, J. (eds.) CRYPTO\u00a02016, Part\u00a0III. LNCS, vol. 9816, (Springer, Heidelberg, Aug 2016) pp. 593\u2013618","DOI":"10.1007\/978-3-662-53015-3_21"},{"key":"9402_CR11","doi-asserted-by":"publisher","unstructured":"E. Boyle, S. Garg, A. Jain, Y.T. Kalai, A. Sahai, Secure computation against adaptive auxiliary information, inAdvances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, (Santa Barbara, CA, USA, August 18\u201322, 2013). Proceedings, Part I. (2013), pp. 316\u2013334 https:\/\/doi.org\/10.1007\/978-3-642-40041-4_18","DOI":"10.1007\/978-3-642-40041-4_18"},{"key":"9402_CR12","doi-asserted-by":"publisher","unstructured":"E. Boyle, S. Goldwasser, A. Jain, Y.T. Kalai, Multiparty computation secure against continual memory leakage, in Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, (New York, NY, USA, May 19\u201322, 2012), (2012) pp. 1235\u20131254, https:\/\/doi.org\/10.1145\/2213977.2214087","DOI":"10.1145\/2213977.2214087"},{"key":"9402_CR13","unstructured":"J.V. Bulck, M. Minkin, O. Weisse, D. Genkin, B. Kasikci, F. Piessens, M. Silberstein, T.F. Wenisch, Y. Yarom, R. Strackx, Foreshadow: Extracting the keys to the intel SGX kingdom with transient out-of-order execution, in 27th USENIX Security Symposium, USENIX Security 2018, (Baltimore, MD, USA, August 15\u201317, 2018). (2018), pp. 991\u20131008, https:\/\/www.usenix.org\/conference\/usenixsecurity18\/presentation\/bulck"},{"key":"9402_CR14","doi-asserted-by":"crossref","unstructured":"M. Bun, R. Kothari, J. Thaler, Quantum algorithms and approximating polynomials for composed functions with shared inputs, in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, (San Diego, California, USA, January 6-9, 2019), (2019), pp. 662\u2013678","DOI":"10.1137\/1.9781611975482.42"},{"key":"9402_CR15","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols (extended abstract), in STOC. (1988), pp. 11\u201319","DOI":"10.1145\/62212.62214"},{"key":"9402_CR16","doi-asserted-by":"crossref","unstructured":"J.S. Coron, Higher order masking of look-up tables, in Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT\u00a02014. LNCS, vol. 8441, (Springer, Heidelberg, May 2014), pp. 441\u2013458","DOI":"10.1007\/978-3-642-55220-5_25"},{"key":"9402_CR17","doi-asserted-by":"publisher","unstructured":"J. Coron, E. Prouff, M. Rivain, T. Roche, Higher-order side channel security and mask refreshing, in Fast Software Encryption - 20th International Workshop, FSE 2013, Singapore, March 11\u201313, 2013. Revised Selected Papers. (2013), pp. 410\u2013424 https:\/\/doi.org\/10.1007\/978-3-662-43933-3_21","DOI":"10.1007\/978-3-662-43933-3_21"},{"key":"9402_CR18","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, F. Liu, H. Zhou, Leakage-resilient circuits revisited - optimal number of computing components without leak-free hardware, in EUROCRYPT 2015. (2015), pp. 131\u2013158","DOI":"10.1007\/978-3-662-46803-6_5"},{"key":"9402_CR19","doi-asserted-by":"crossref","unstructured":"A. Duc, S. Dziembowski, S. Faust, Unifying leakage models: From probing attacks to noisy leakage, in Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT\u00a02014. LNCS, vol. 8441, pp. 423\u2013440. (Springer, Heidelberg, May 2014)","DOI":"10.1007\/978-3-642-55220-5_24"},{"key":"9402_CR20","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, S. Faust, Leakage-resilient circuits without computational assumptions, in TCC 2012. (2012), pp. 230\u2013247","DOI":"10.1007\/978-3-642-28914-9_13"},{"key":"9402_CR21","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, S. Faust, M. Skorski, Noisy leakage revisited, in Oswald, E., Fischlin, M. (eds.) EUROCRYPT\u00a02015, Part\u00a0II. LNCS, vol. 9057, (Springer, Heidelberg, Apr 2015), pp. 159\u2013188","DOI":"10.1007\/978-3-662-46803-6_6"},{"key":"9402_CR22","doi-asserted-by":"crossref","unstructured":"S. Faust, C. Paglialonga, T. Schneider, Amortizing randomness complexity in private circuits, in Takagi, T., Peyrin, T. (eds.) ASIACRYPT\u00a02017, Part\u00a0I. LNCS, vol. 10624, pp. 781\u2013810. (Springer, Heidelberg, Dec 2017)","DOI":"10.1007\/978-3-319-70694-8_27"},{"key":"9402_CR23","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 Gilbert, H. (ed.) EUROCRYPT\u00a02010. LNCS, vol. 6110, (Springer, Heidelberg, May 2010), pp. 135\u2013156","DOI":"10.1007\/978-3-642-13190-5_7"},{"key":"9402_CR24","doi-asserted-by":"crossref","unstructured":"S. Faust, T. Rabin, L. Reyzin, E. Tromer, V. Vaikuntanathan, Protecting circuits from computationally bounded and noisy leakage. SIAM J. Comput. 43(5), 1564\u20131614 (2014), extended abstract in Eurocrypt 2010","DOI":"10.1137\/120880343"},{"key":"9402_CR25","doi-asserted-by":"crossref","unstructured":"S. Garg, A. Jain, A. Sahai, Leakage-resilient zero knowledge, in Rogaway, P. (ed.) CRYPTO\u00a02011. LNCS, vol. 6841, (Springer, Heidelberg, Aug 2011), pp. 297\u2013315","DOI":"10.1007\/978-3-642-22792-9_17"},{"key":"9402_CR26","doi-asserted-by":"publisher","unstructured":"D. Genkin, Y. Ishai, M. Weiss, How to construct a leakage-resilient (stateless) trusted party, in Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II. (2017), pp. 209\u2013244, https:\/\/doi.org\/10.1007\/978-3-319-70503-3_7","DOI":"10.1007\/978-3-319-70503-3_7"},{"key":"9402_CR27","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 Aho, A. (ed.) 19th ACM STOC. ACM Press (May 1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9402_CR28","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, G.N. Rothblum, Securing computation against continuous leakage, in CRYPTO 2010. (2010), pp. 59\u201379","DOI":"10.1007\/978-3-642-14623-7_4"},{"key":"9402_CR29","doi-asserted-by":"publisher","unstructured":"S. Goldwasser, G.N. Rothblum, How to compute in the presence of leakage, in 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, (New Brunswick, NJ, USA, October 20\u201323, 2012). (2012), pp. 31\u201340, https:\/\/doi.org\/10.1109\/FOCS.2012.34","DOI":"10.1109\/FOCS.2012.34"},{"key":"9402_CR30","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. (2016), pp. 1\u201310","DOI":"10.1109\/FOCS.2016.10"},{"key":"9402_CR31","doi-asserted-by":"publisher","unstructured":"J. H\u00e5stad, On the correlation of parity and small-depth circuits. SIAM J. Comput. 43(5), 1699\u20131708 (2014), https:\/\/doi.org\/10.1137\/120897432","DOI":"10.1137\/120897432"},{"key":"9402_CR32","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: Securing hardware against probing attacks, in: Boneh, D. (ed.) CRYPTO\u00a02003. LNCS, vol. 2729, pp. 463\u2013481. Springer, Heidelberg (Aug 2003)","DOI":"10.1007\/978-3-540-45146-4_27"},{"key":"9402_CR33","doi-asserted-by":"publisher","unstructured":"Y. Ishai, M. Weiss, G. Yang, Making the best of a leaky situation: Zero-knowledge pcps from leakage-resilient circuits, in Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part II. (2016), pp. 3\u201332, https:\/\/doi.org\/10.1007\/978-3-662-49099-0_1","DOI":"10.1007\/978-3-662-49099-0_1"},{"key":"9402_CR34","doi-asserted-by":"crossref","unstructured":"A. Juma, Y. Vahlis, Protecting cryptographic keys against continual leakage, in CRYPTO 2010. (2010), pp. 41\u201358","DOI":"10.1007\/978-3-642-14623-7_3"},{"key":"9402_CR35","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. CoRR arXiv:1801.01203 (2018)","DOI":"10.1109\/SP.2019.00002"},{"key":"9402_CR36","doi-asserted-by":"crossref","unstructured":"P.C. Kocher, Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems, in Koblitz, N. (ed.) (CRYPTO\u201996. LNCS), vol. 1109, pp. 104\u2013113. (Springer, Heidelberg, Aug 1996)","DOI":"10.1007\/3-540-68697-5_9"},{"key":"9402_CR37","doi-asserted-by":"crossref","unstructured":"P.C. Kocher, J. Jaffe, B. Jun, Differential power analysis, in Wiener, M.J. (ed.) CRYPTO\u201999. LNCS, vol. 1666, (Springer, Heidelberg, Aug 1999), pp. 388\u2013397","DOI":"10.1007\/3-540-48405-1_25"},{"key":"9402_CR38","unstructured":"M. Lipp, M. Schwarz, D. Gruss, T. Prescher, W. Haas, A. Fogh, J. Horn, S. Mangard, P. Kocher, D. Genkin, Y. Yarom, M. Hamburg, Meltdown: Reading kernel memory from user space, in 27th USENIX Security Symposium, USENIX Security 2018, (Baltimore, MD, USA, August 15\u201317, 2018). (2018), pp. 973\u2013990 https:\/\/www.usenix.org\/conference\/usenixsecurity18\/presentation\/lipp"},{"key":"9402_CR39","doi-asserted-by":"crossref","unstructured":"S. Micali, L. Reyzin, Physically observable cryptography (extended abstract), in Naor, M. (ed.) TCC\u00a02004. LNCS, vol. 2951, (Springer, Heidelberg, Feb 2004), pp. 278\u2013296","DOI":"10.1007\/978-3-540-24638-1_16"},{"key":"9402_CR40","doi-asserted-by":"crossref","unstructured":"E. Miles, Iterated group products and leakage resilience against NC1, in Naor, M. (ed.) ITCS 2014. (Jan 2014), pp. 261\u2013268. ACM","DOI":"10.1145\/2554797.2554822"},{"key":"9402_CR41","doi-asserted-by":"crossref","unstructured":"E. Miles, E. Viola, Shielding circuits with groups, in Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC. ACM Press (Jun 2013), pp. 251\u2013260","DOI":"10.1145\/2488608.2488640"},{"key":"9402_CR42","doi-asserted-by":"crossref","unstructured":"M. Rivain, E. Prouff, Provably secure higher-order masking of AES, in Mangard, S., Standaert, F. (eds.) CHES 2010. Lecture Notes in Computer Science, vol. 6225, (Springer, 2010), pp. 413\u2013427","DOI":"10.1007\/978-3-642-15031-9_28"},{"key":"9402_CR43","doi-asserted-by":"crossref","unstructured":"G.N. Rothblum, How to compute under $${\\cal{AC}}^{{\\sf 0}}$$ leakage without secure hardware, in Safavi-Naini, R., Canetti, R. (eds.) CRYPTO\u00a02012. LNCS, vol. 7417, (Springer, Heidelberg, Aug 2012), pp. 552\u2013569","DOI":"10.1007\/978-3-642-32009-5_32"},{"key":"9402_CR44","doi-asserted-by":"crossref","unstructured":"A.C.C. Yao, How to generate and exchange secrets (extended abstract), in 27th FOCS. pp. 162\u2013167. IEEE Computer Society Press (Oct 1986)","DOI":"10.1109\/SFCS.1986.25"}],"updated-by":[{"DOI":"10.1007\/s00145-021-09417-9","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:00:00Z","timestamp":1642982400000}},{"DOI":"10.1007\/s00145-021-09412-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000}}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09402-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-021-09402-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-09402-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T17:02:29Z","timestamp":1643043749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-021-09402-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["9402"],"URL":"https:\/\/doi.org\/10.1007\/s00145-021-09402-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"27 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2021","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00145-021-09412-0","URL":"https:\/\/doi.org\/10.1007\/s00145-021-09412-0","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2022","order":9,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":10,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":11,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00145-021-09417-9","URL":"https:\/\/doi.org\/10.1007\/s00145-021-09417-9","order":12,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"38"}}