{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:37:47Z","timestamp":1757313467241,"version":"3.41.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,6]],"date-time":"2015-03-06T00:00:00Z","timestamp":1425600000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s00145-015-9200-x","type":"journal-article","created":{"date-parts":[[2015,3,5]],"date-time":"2015-03-05T20:05:50Z","timestamp":1425585950000},"page":"514-551","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Leakage-Resilient Cryptography from Minimal Assumptions"],"prefix":"10.1007","volume":"29","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adriana","family":"L\u00f3pez-Alt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoeteck","family":"Wee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,6]]},"reference":[{"key":"9200_CR1","doi-asserted-by":"crossref","unstructured":"D. Agrawal, B. Archambeault, J.R. Rao, P. Rohatgi, The EM side-channel(s). in B.S. Kaliski Jr., \u00c7.K. Ko\u00e7, C. Paar, editors, CHES, Lecture Notes in Computer Science, vol. 2523 (Springer, Berlin) pp. 29\u201345, August 13\u201315 2002","DOI":"10.1007\/3-540-36400-5_4"},{"key":"9200_CR2","doi-asserted-by":"crossref","unstructured":"J. Alwen, Y. Dodis, M. Naor, G. Segev, S. Walfish, D. Wichs, Public-key encryption in the bounded-retrieval model. in H. Gilbert, editor, Advances in Cryptology\u2014EUROCRYPT 2010, Lecture Notes in Computer Science, vol. 6110 (Springer, Berlin, 2010), pp. 113\u2013134","DOI":"10.1007\/978-3-642-13190-5_6"},{"key":"9200_CR3","doi-asserted-by":"crossref","unstructured":"J. Alwen, Y. Dodis, D. Wichs, Leakage-resilient public-key cryptography in the bounded-retrieval model. in Advances in Cryptology (CRYPTO) 2009, 29th Annual International Cryptology Conference (Santa Barbara, CA, 2009), pp. 36\u201354","DOI":"10.1007\/978-3-642-03356-8_3"},{"key":"9200_CR4","doi-asserted-by":"crossref","unstructured":"A. Akavia, S. Goldwasser, V. Vaikuntanathan, Simultaneous hardcore bits and cryptography against memory attacks. in O. Reingold, editor, Sixth Theory of Cryptography Conference\u2014TCC 2007, Lecture Notes in Computer Science, vol. 5444 (Springer, Berlin, 2009)","DOI":"10.1007\/978-3-642-00457-5_28"},{"key":"9200_CR5","doi-asserted-by":"crossref","unstructured":"N. Bitansky, R. Canetti, S. Halevi, Leakage-tolerant interactive protocols. in 9th Theory of Cryptography Conference (TCC) (Taormina, Sicily, 2012), pp. 266\u2013284","DOI":"10.1007\/978-3-642-28914-9_15"},{"key":"9200_CR6","unstructured":"H. Bar-El, Known attacks against smartcards, 2003. Last accessed: August 26, 2009. http:\/\/www.hbarel.com\/publications\/Known_Attacks_Against_Smartcards.pdf"},{"key":"9200_CR7","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, S. Goldwasser, Circular and leakage resilient public-key encryption under subgroup indistinguishability\u2014(or: Quadratic residuosity strikes back). in T. Rabin, editor, CRYPTO, Lecture Notes in Computer Science, vol. 6223 (Springer, Berlin, 2010), pp. 1\u201320","DOI":"10.1007\/978-3-642-14623-7_1"},{"key":"9200_CR8","unstructured":"M. Braverman, A. Hassidim, Y.T. Kalai, Leaky pseudo-entropy functions. in B. Chazelle, editor, ICS, (Tsinghua University Press, 2011), pp. 353\u2013366"},{"key":"9200_CR9","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, Y.T. Kalai, A parallel repetition theorem for leakage resilience. in Cramer [15], pp. 248\u2013265","DOI":"10.1007\/978-3-642-28914-9_14"},{"key":"9200_CR10","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, J. Katz, Y. Kalai, V. Vaikuntanathan, Overcoming the hole in the bucket: Public-key cryptography against resilient to continual memory leakage. in FOCS [36], pp. 501\u2013510","DOI":"10.1109\/FOCS.2010.55"},{"key":"9200_CR11","doi-asserted-by":"crossref","unstructured":"E. Boyle, G. Segev, D. Wichs, Fully leakage-resilient signatures. in K.G. Paterson editor, EUROCRYPT, Lecture Notes in Computer Science, vol. 6632 (Springer, Berlin, 2011), pp. 89\u2013108","DOI":"10.1007\/978-3-642-20465-4_7"},{"key":"9200_CR12","doi-asserted-by":"crossref","unstructured":"D. Cash, Y.Z. Ding, Y. Dodis, W. Lee, R.J. Lipton, S. Walfish, Intrusion-resilient key exchange in the bounded retrieval model. in S.P. Vadhan, editor, TCC, Lecture Notes in Computer Science, vol. 4392 (Springer, Berlin, 2007), pp. 479\u2013498","DOI":"10.1007\/978-3-540-70936-7_26"},{"key":"9200_CR13","doi-asserted-by":"crossref","unstructured":"S.S.M. Chow, Y. Dodis, Y. Rouselakis, B. Waters, Practical leakage-resilient identity-based encryption from simple assumptions. in E. Al-Shaer, A.D. Keromytis, V. Shmatikov, editors, ACM Conference on Computer and Communications Security, (ACM, 2010), pp. 152\u2013161","DOI":"10.1145\/1866307.1866325"},{"key":"9200_CR14","doi-asserted-by":"crossref","unstructured":"R. Cramer, V. Shoup, Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. in L. Knudsen, editor, Advances in Cryptology\u2014EUROCRYPT 2002, LNCS, vol. 2332 (Springer, Berlin) pp. 45\u201364, 28 April\u20132 May 2002","DOI":"10.1007\/3-540-46035-7_4"},{"key":"9200_CR15","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo, R. J. Lipton, S. Walfish, Perfectly secure password protocols in the bounded retrieval model. in Third Theory of Cryptography Conference (TCC) (New York, NY, 2006), pp. 225\u2013244","DOI":"10.1007\/11681878_12"},{"key":"9200_CR16","doi-asserted-by":"crossref","unstructured":"Y. Dodis, K. Haralambiev, A. L\u00f3pez-Alt, D. Wichs, Cryptography against continuous memory attacks. in 51th Annual (IEEE) Symposium on Foundations of Computer Science (FOCS) (Las Vegas, NV, 2010), pp. 511\u2013520","DOI":"10.1109\/FOCS.2010.56"},{"key":"9200_CR17","doi-asserted-by":"crossref","unstructured":"Y. Dodis, K. Haralambiev, A. L\u00f3pez-Alt, D. Wichs, Efficient public-key cryptography in the presence of key leakage. in M. Abe, editor, ASIACRYPT, Lecture Notes in Computer Science, vol. 6477 (Springer, Berlin, 2010), pp. 613\u2013631","DOI":"10.1007\/978-3-642-17373-8_35"},{"key":"9200_CR18","doi-asserted-by":"crossref","unstructured":"Y. Dodis, E. Kiltz, K. Pietrzak, D. Wichs, Message authentication, revisited. in D. Pointcheval, T. Johansson, editor EUROCRYPT, Lecture Notes in Computer Science, vol. 7237, (Springer, Berlin 2012), pp. 355\u2013374","DOI":"10.1007\/978-3-642-29011-4_22"},{"key":"9200_CR19","doi-asserted-by":"crossref","unstructured":"Y. Dodis, A.B. Lewko, B. Waters, D. Wichs, Storing secrets on continually leaky devices. in R. Ostrovsky, editor, FOCS, (IEEE, 2011), pp. 688\u2013697","DOI":"10.1109\/FOCS.2011.35"},{"key":"9200_CR20","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, Improved non-committing encryption schemes based on a general complexity assumption. in M. Bellare, editor, CRYPTO, Lecture Notes in Computer Science, vol. 1880 (Springer, Berlin, 2000), pp. 432\u2013450","DOI":"10.1007\/3-540-44598-6_27"},{"key":"9200_CR21","doi-asserted-by":"crossref","unstructured":"Y. Dodis, R. Ostrovsky, L. Reyzin, A. Smith, Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM Journal on Computing, 38(1):97\u2013139 (2008)","DOI":"10.1137\/060651380"},{"key":"9200_CR22","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, K. Pietrzak, Leakage-resilient cryptography. in 49th Symposium on Foundations of Computer Science, Philadelphia, PA, USA (IEEE Computer Society) pp. 293\u2013302, 25\u201328 October 2008","DOI":"10.1109\/FOCS.2008.56"},{"key":"9200_CR23","doi-asserted-by":"crossref","unstructured":"Y. Dodis, Y. Yu, Overcoming weak expectations. in ITW, 2012. http:\/\/www.cs.nyu.edu\/dodis\/ps\/weak-expe.pdf","DOI":"10.1109\/ITW.2012.6404636"},{"key":"9200_CR24","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, Intrusion-resilience via the bounded-storage model. in Third Theory of Cryptography Conference (TCC) (New York, NY, 2006), pp. 207\u2013224","DOI":"10.1007\/11681878_11"},{"key":"9200_CR25","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, Intrusion-resilience via the bounded-storage model. in Halevi and Rabin [34], pp. 207\u2013224","DOI":"10.1007\/11681878_11"},{"key":"9200_CR26","unstructured":"ECRYPT, Side channel cryptanalysis lounge. Last accessed: May 1, 2011. http:\/\/www.emsec.rub.de\/research\/projects\/sclounge\/"},{"key":"9200_CR27","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions. Journal of the ACM, 33(4):792\u2013807, October 1986","DOI":"10.1145\/6490.6503"},{"key":"9200_CR28","unstructured":"S. Goldwasser, Y.T. Kalai, C. Peikert, V. Vaikuntanathan, Robustness of the learning with errors assumption. in A.C.-C. Yao editor, ICS, (Tsinghua University Press, 2010), pp. 230\u2013240"},{"key":"9200_CR29","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, G.N. Rothblum, How to compute in the presence of leakage. Electronic Colloquium on Computational Complexity (ECCC), 19:10, 2012","DOI":"10.1109\/FOCS.2012.34"},{"key":"9200_CR30","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad, R. Impagliazzo, L.A. Levin, M. Luby, Construction of pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364\u20131396, 1999","DOI":"10.1137\/S0097539793244708"},{"key":"9200_CR31","doi-asserted-by":"crossref","unstructured":"S. Halevi, H. Lin, After-the-fact leakage in public-key encryption. in 8th Theory of Cryptography Conference (TCC) (Providence, RI, 2011), pp. 107\u2013124","DOI":"10.1007\/978-3-642-19571-6_8"},{"key":"9200_CR32","unstructured":"J.A. Halderman, S.D. Schoen, N. Heninger, W. Clarkson, W. Paul, J.A. Calandrino, A.J. Feldman, J. Appelbaum, E.W. Felten, Lest we remember: Cold-boot attacks on encryption keys. Commun. ACM, 52(5):91\u201398, 2009"},{"key":"9200_CR33","doi-asserted-by":"crossref","unstructured":"Y. Ishai, A. Sahai, D. Wagner, Private circuits: Securing hardware against probing attacks. in D. Boneh, editor, Advances in Cryptology\u2014CRYPTO 2003, LNCS, vol. 2729 (Springer, Berlin, 2003)","DOI":"10.1007\/978-3-540-45146-4_27"},{"key":"9200_CR34","doi-asserted-by":"crossref","unstructured":"A. Jain, S. Garg, A. Sahai, Leakage-resilient zero knowledge. in Advances in Cryptology\u2013CRYPTO 2011, 31st Annual Cryptology Conference (Santa Barbara, CA, 2011), pp. 297\u2013315","DOI":"10.1007\/978-3-642-22792-9_17"},{"key":"9200_CR35","doi-asserted-by":"crossref","unstructured":"A. Jain, K. Pietrzak, Parallel repetition for leakage resilience amplification revisited. in 8th Theory of Cryptography Conference (TCC) (Providence, RI, 2011), pp. 58\u201369","DOI":"10.1007\/978-3-642-19571-6_5"},{"key":"9200_CR36","doi-asserted-by":"crossref","unstructured":"P. Kocher, J. Jaffe, B. Jun, Differential power analysis. in M. Wiener, editor, Advances in Cryptology\u2014CRYPTO\u201999, LNCS, vol. 1666, (Springer, Berlin) 15\u201319 August 1999, pp. 388\u2013397","DOI":"10.1007\/3-540-48405-1_25"},{"key":"9200_CR37","doi-asserted-by":"crossref","unstructured":"P. Kocher, Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. in N. Koblitz, editor, Advances in Cryptology-CRYPTO 96, LNCS, vol. 1109 (Springer, Berlin) 18\u201322 August 1996, pp. 104\u2013113","DOI":"10.1007\/3-540-68697-5_9"},{"key":"9200_CR38","doi-asserted-by":"crossref","unstructured":"J. Katz, V. Vaikuntanathan, Signature schemes with bounded leakage resilience. in M. Matsui, editor, Advances in Cryptology\u2014ASIACRYPT 2009, LNCS (Springer, Berlin, 2009), to appear","DOI":"10.1007\/978-3-642-10366-7_41"},{"key":"9200_CR39","doi-asserted-by":"crossref","unstructured":"A.B. Lewko, M. Lewko, B. Waters, How to leak on key updates. in Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC) (San Jose, CA, 2011), pp. 725\u2013734","DOI":"10.1145\/1993636.1993732"},{"key":"9200_CR40","doi-asserted-by":"crossref","unstructured":"A. Lewko, B. Waters, On the insecurity of parallel repetition for leakage resilience. in 51th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (Las Vegas, NV, 2010), pp. 521\u2013530","DOI":"10.1109\/FOCS.2010.57"},{"key":"9200_CR41","doi-asserted-by":"crossref","unstructured":"S. Micali, L. Reyzin, Physically observable cryptography (extended abstract). in M. Naor, editor, First Theory of Cryptography Conference\u2014TCC 2004, LNCS, vol. 2951 (Springer, Berlin), February 19\u201321 2004, pp. 278\u2013296","DOI":"10.1007\/978-3-540-24638-1_16"},{"key":"9200_CR42","doi-asserted-by":"crossref","unstructured":"M. Naor, G. Segev, Public-key cryptosystems resilient to key leakage. in Halevi [31], pp. 18\u201335","DOI":"10.1007\/978-3-642-03356-8_2"},{"key":"9200_CR43","doi-asserted-by":"crossref","unstructured":"M. Naor, G. Segev, Public-key cryptosystems resilient to key leakage. SIAM Journal on Computing, 41(4):772\u2013814, 2012. A preliminary version appeared in Advances in Cryptology\u2014CRYPTO\u201909, pp. 18\u201335, 2009","DOI":"10.1137\/100813464"},{"key":"9200_CR44","doi-asserted-by":"crossref","unstructured":"N. Nisan, D. Zuckerman, Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43\u201353, 1996","DOI":"10.1006\/jcss.1996.0004"},{"key":"9200_CR45","doi-asserted-by":"crossref","unstructured":"K. Pietrzak, A leakage-resilient mode of operation. in A. Joux, editor, Advances in Cryptology\u2014EUROCRYPT 2009, LNCS, vol. 5479 (Springer, Berlin, 2009) pp. 462\u2013482","DOI":"10.1007\/978-3-642-01001-9_27"},{"key":"9200_CR46","unstructured":"J.-J. Quisquater. F. Koene, Side channel attacks: State of the art, October 2002. http:\/\/www.ipa.go.jp\/security\/enc\/CRYPTREC\/fy15\/doc\/1047_Side_Channel_report.pdf . Last accessed: August 26, 2009"},{"key":"9200_CR47","doi-asserted-by":"crossref","unstructured":"J.-J. Quisquater, D. Samyde, Electromagnetic analysis (ema): Measures and counter-measures for smart cards. in I. Attali, T.P. Jensen, editors, E-smart, LNCS, vol. 2140 (Springer, Berlin), September 19\u201321 2001, pp. 200\u2013210","DOI":"10.1007\/3-540-45418-7_17"},{"key":"9200_CR48","unstructured":"Reliable Computing Laboratory, Boston University. Side channel attacks database. http:\/\/www.sidechannelattacks.com . Last accessed: August 26, 2009"},{"key":"9200_CR49","doi-asserted-by":"crossref","unstructured":"F.-X. Standaert, How leaky is an extractor? in M. Abdalla, P.S.L.M. Barreto, editor, LATINCRYPT, Lecture Notes in Computer Science, vol. 6212 (Springer, Berlin, 2010), pp. 294\u2013304","DOI":"10.1007\/978-3-642-14712-8_18"},{"key":"9200_CR50","doi-asserted-by":"crossref","unstructured":"S.P. Vadhan, On constructing locally computable extractors and cryptosystems in the bounded storage model. in D. Boneh, editor, CRYPTO, Lecture Notes in Computer Science, vol. 2729 (Springer, Berlin, 2003), pp. 61\u201377","DOI":"10.1007\/978-3-540-45146-4_4"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9200-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-015-9200-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9200-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9200-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T19:11:46Z","timestamp":1747768306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-015-9200-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,6]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9200"],"URL":"https:\/\/doi.org\/10.1007\/s00145-015-9200-x","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2015,3,6]]},"assertion":[{"value":"12 June 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}