{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:35:36Z","timestamp":1762004136272,"version":"build-2065373602"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,4,25]],"date-time":"2018-04-25T00:00:00Z","timestamp":1524614400000},"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":[[2019,7]]},"DOI":"10.1007\/s00145-018-9286-z","type":"journal-article","created":{"date-parts":[[2018,4,25]],"date-time":"2018-04-25T19:49:14Z","timestamp":1524685754000},"page":"742-824","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Leakage Resilience from Program Obfuscation"],"prefix":"10.1007","volume":"32","author":[{"given":"Dana","family":"Dachman-Soled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Dov","family":"Gordon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng-Hao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"O\u2019Neill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-Sheng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"key":"9286_CR1","unstructured":"M.\u00a0Abe, M.\u00a0Chase, B.\u00a0David, M.\u00a0Kohlweiss, R.\u00a0Nishimaki, and M.\u00a0Ohkubo. Constant-size structure-preserving signatures: Generic constructions and simple assumptions. In X.\u00a0Wang and K.\u00a0Sako, editors, ASIACRYPT\u00a02012, vol. 7658 of LNCS (Springer, Berlin, 2012), pp. 4\u201324."},{"key":"9286_CR2","unstructured":"A.\u00a0Akavia, S.\u00a0Goldwasser, and V.\u00a0Vaikuntanathan. Simultaneous hardcore bits and cryptography against memory attacks. In O.\u00a0Reingold, editor, TCC\u00a02009, vol. 5444 of LNCS. (Springer, Berlin, 2009), , pp. 474\u2013495."},{"key":"9286_CR3","unstructured":"P.\u00a0Ananth, D.\u00a0Boneh, S.\u00a0Garg, A.\u00a0Sahai, M.\u00a0Zhandry. Differing-inputs obfuscation and applications. Cryptology ePrint Archive, Report 2013\/689, 2013. \n                    http:\/\/eprint.iacr.org\/2013\/689\n                    \n                  ."},{"key":"9286_CR4","unstructured":"B.\u00a0Barak, O.\u00a0Goldreich, R.\u00a0Impagliazzo, S.\u00a0Rudich, A.\u00a0Sahai, S.\u00a0P. Vadhan, and K.\u00a0Yang. On the (im)possibility of obfuscating programs. In J.\u00a0Kilian, editor, CRYPTO\u00a02001, vol. 2139 of LNCS. (Springer, Berlin, 2001), pp. 1\u201318."},{"issue":"2","key":"9286_CR5","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2160158.2160159","volume":"59","author":"B Barak","year":"2012","unstructured":"B.\u00a0Barak, O.\u00a0Goldreich, R.\u00a0Impagliazzo, S.\u00a0Rudich, A.\u00a0Sahai, S.\u00a0P. Vadhan, and K.\u00a0Yang. On the (im)possibility of obfuscating programs. J. ACM, 59(2):6, 2012.","journal-title":"J. ACM"},{"key":"9286_CR6","unstructured":"A.\u00a0Boldyreva, S.\u00a0Fehr, and A.\u00a0O\u2019Neill. On notions of security for deterministic encryption, and efficient constructions without random oracles. In D.\u00a0Wagner, editor, CRYPTO\u00a02008, vol. 5157 of LNCS. (Springer, Berlin, 2008), pp. 335\u2013359."},{"key":"9286_CR7","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, X.\u00a0Boyen, and H.\u00a0Shacham. Short group signatures. In M.\u00a0Franklin, editor, CRYPTO\u00a02004, volume 3152 of LNCS (Springer, Berlin, 2004), pp. 41\u201355.","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"9286_CR8","unstructured":"D.\u00a0Boneh and B.\u00a0Waters. Constrained pseudorandom functions and their applications. In K.\u00a0Sako and P.\u00a0Sarkar, editors, ASIACRYPT\u00a02013, Part II, vol. 8270 of LNCS (Springer, Berlin, 2013), pp. 280\u2013300."},{"key":"9286_CR9","unstructured":"E.\u00a0Boyle, K.-M. Chung, R.\u00a0Pass. On extractability obfuscation. In Y.\u00a0Lindell, editor, TCC\u00a02014, vol. 8349 of LNCS (Springer, Berlin, 2014), pp. 52\u201373."},{"key":"9286_CR10","unstructured":"E.\u00a0Boyle, S.\u00a0Goldwasser, and I.\u00a0Ivan. Functional signatures and pseudorandom functions. In H.\u00a0Krawczyk, editor, PKC\u00a02014, vol. 8383 of LNCS (Springer, Berlin, 2014), pp. 501\u2013519."},{"key":"9286_CR11","unstructured":"E.\u00a0Boyle, G.\u00a0Segev, and D.\u00a0Wichs. Fully leakage-resilient signatures. In K.\u00a0G. Paterson, editor, EUROCRYPT\u00a02011, vol. 6632 of LNCS (Springer, Berlin, 2011), pp. 89\u2013108."},{"key":"9286_CR12","unstructured":"Z.\u00a0Brakerski, Y.\u00a0T. Kalai, J.\u00a0Katz, and V.\u00a0Vaikuntanathan. Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage. In 51st FOCS, pp. 501\u2013510. IEEE Computer Society Press, (2010)."},{"key":"9286_CR13","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, C.\u00a0Dwork, M.\u00a0Naor, and R.\u00a0Ostrovsky. Deniable encryption. In B.\u00a0S. Kaliski Jr., editor, CRYPTO\u201997, volume 1294 of LNCS. (Springer, Berlin, 1997), pp. 90\u2013104.","DOI":"10.1007\/BFb0052229"},{"key":"9286_CR14","unstructured":"R.\u00a0Canetti, S.\u00a0Goldwasser, and O.\u00a0Poburinnaya. Adaptively secure two-party computation from indistinguishability obfuscation. In Y.\u00a0Dodis and J.\u00a0B. Nielsen, editors, TCC\u00a02015, Part II, vol. 9015 of LNCS (Springer, Berlin, 2015), pp. 557\u2013585."},{"key":"9286_CR15","unstructured":"R.\u00a0Canetti, H.\u00a0Krawczyk, and J.\u00a0B. Nielsen. Relaxing chosen-ciphertext security. In D.\u00a0Boneh, editor, CRYPTO\u00a02003, vol. 2729 of LNCS (Springer, Berlin, 2003), pp. 565\u2013582."},{"key":"9286_CR16","doi-asserted-by":"crossref","unstructured":"S.\u00a0Chari, C.\u00a0S. Jutla, J.\u00a0R. Rao, and P.\u00a0Rohatgi. Towards sound approaches to counteract power-analysis attacks. In M.\u00a0J. Wiener, editor, CRYPTO\u201999, vol. 1666 of LNCS. (Springer, Berlin, 1999)","DOI":"10.1007\/3-540-48405-1_26"},{"key":"9286_CR17","doi-asserted-by":"crossref","unstructured":"M.\u00a0Chase, M.\u00a0Kohlweiss, A.\u00a0Lysyanskaya, and S.\u00a0Meiklejohn. Malleable proof systems and applications. In D.\u00a0Pointcheval and T.\u00a0Johansson, editors, EUROCRYPT\u00a02012, vol. 7237 of LNCS (Springer, Berlin, 2012), pp. 281\u2013300","DOI":"10.1007\/978-3-642-29011-4_18"},{"key":"9286_CR18","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dachman-Soled, J.\u00a0Katz, and V.\u00a0Rao. Adaptively secure, universally composable, multiparty computation in constant rounds. In Y.\u00a0Dodis and J.\u00a0B. Nielsen, editors, TCC\u00a02015, Part II, vol. 9015 of LNCS (Springer, Berlin, 2015), pp. 586\u2013613","DOI":"10.1007\/978-3-662-46497-7_23"},{"key":"9286_CR19","unstructured":"D.\u00a0Dachman-Soled, F.-H. Liu, and H.-S. Zhou. Leakage-resilient circuits revisited - optimal number of computing components without leak-free hardware. In E.\u00a0Oswald and M.\u00a0Fischlin, editors, EUROCRYPT\u00a02015, Part II, vol. 9057 of LNCS, (Springer, Berlin, 2015), pp. 131\u2013158."},{"key":"9286_CR20","doi-asserted-by":"crossref","unstructured":"A.\u00a0De Santis, G.\u00a0Di Crescenzo, R.\u00a0Ostrovsky, G.\u00a0Persiano, and A.\u00a0Sahai. Robust non-interactive zero knowledge. In J.\u00a0Kilian, editor, CRYPTO\u00a02001, vol. 2139 of LNCS (Springer, Berlin, 2001), pp. 566\u2013598","DOI":"10.1007\/3-540-44647-8_33"},{"key":"9286_CR21","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, K.\u00a0Haralambiev, A.\u00a0L\u00f3pez-Alt, and D.\u00a0Wichs. Cryptography against continuous memory attacks. In 51st FOCS, IEEE Computer Society Press, 2010, pp. 511\u2013520.","DOI":"10.1109\/FOCS.2010.56"},{"key":"9286_CR22","unstructured":"Y.\u00a0Dodis, K.\u00a0Haralambiev, A.\u00a0L\u00f3pez-Alt, and D.\u00a0Wichs. Efficient public-key cryptography in the presence of key leakage. In M.\u00a0Abe, editor, ASIACRYPT\u00a02010, vol. 6477 of LNCS (Springer, Berlin, 2010), pp. 613\u2013631."},{"key":"9286_CR23","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, Y.\u00a0T. Kalai, and S.\u00a0Lovett. On cryptography with auxiliary input. In M.\u00a0Mitzenmacher, editor, 41st ACM STOC (ACM Press, 2009), pp. 621\u2013630.","DOI":"10.1145\/1536414.1536498"},{"key":"9286_CR24","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, A.\u00a0B. Lewko, B.\u00a0Waters, and D.\u00a0Wichs. Storing secrets on continually leaky devices. In R.\u00a0Ostrovsky, editor, 52nd FOCS, pp. 688\u2013697. IEEE Computer Society Press, 2011.","DOI":"10.1109\/FOCS.2011.35"},{"issue":"1","key":"9286_CR25","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Y.\u00a0Dodis, R.\u00a0Ostrovsky, L.\u00a0Reyzin, and A.\u00a0Smith. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput., 38(1):97\u2013139, 2008.","journal-title":"SIAM J. Comput."},{"key":"9286_CR26","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis and A.\u00a0Smith. Correcting errors without leaking partial information. In H.\u00a0N. Gabow and R.\u00a0Fagin, editors, 37th ACM STOC (ACM Press, 2005), pp. 654\u2013663.","DOI":"10.1145\/1060590.1060688"},{"key":"9286_CR27","unstructured":"S.\u00a0Faust, T.\u00a0Rabin, L.\u00a0Reyzin, E.\u00a0Tromer, and V.\u00a0Vaikuntanathan. Protecting circuits from leakage: the computationally-bounded and noisy cases. In H.\u00a0Gilbert, editor, EUROCRYPT\u00a02010, vol. 6110 of LNCS (Springer, Berlin, 2010), pp. 135\u2013156."},{"key":"9286_CR28","unstructured":"S.\u00a0Garg, C.\u00a0Gentry, and S.\u00a0Halevi. Candidate multilinear maps from ideal lattices. In T.\u00a0Johansson and P.\u00a0Q. Nguyen, editors, EUROCRYPT\u00a02013, vol. 7881 of LNCS (Springer, Berlin, 2013), pp. 1\u201317."},{"key":"9286_CR29","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, and B. Waters. Candidate indistinguishability obfuscation and functional encryption for all circuits. in 54th FOCS, pp. 40\u201349. IEEE Computer Society Press, 2013.","DOI":"10.1109\/FOCS.2013.13"},{"key":"9286_CR30","doi-asserted-by":"crossref","unstructured":"S.\u00a0Garg, C.\u00a0Gentry, S.\u00a0Halevi, and D.\u00a0Wichs. On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input. In J.\u00a0A. Garay and R.\u00a0Gennaro, editors, CRYPTO\u00a02014, Part I, volume 8616 of LNCS, (Springer, Berlin, 2014), pp. 518\u2013535.","DOI":"10.1007\/978-3-662-44371-2_29"},{"key":"9286_CR31","unstructured":"S.\u00a0Garg and A.\u00a0Polychroniadou. Two-round adaptively secure MPC from indistinguishability obfuscation. In Y.\u00a0Dodis and J.\u00a0B. Nielsen, editors, TCC\u00a02015, Part II, vol. 9015 of LNCS (Springer, Berlin, 2015), pp. 614\u2013637."},{"issue":"4","key":"9286_CR32","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"O.\u00a0Goldreich, S.\u00a0Goldwasser, and S.\u00a0Micali. How to construct random functions. J. ACM, 33(4):792\u2013807, Aug. 1986.","journal-title":"J. ACM"},{"key":"9286_CR33","doi-asserted-by":"crossref","unstructured":"S.\u00a0Goldwasser and G.\u00a0N. Rothblum. On best-possible obfuscation. In S.\u00a0P. Vadhan, editor, TCC\u00a02007, volume 4392 of LNCS (Springer, Berlin 2007), pp. 194\u2013213","DOI":"10.1007\/978-3-540-70936-7_11"},{"key":"9286_CR34","unstructured":"J.\u00a0A. Halderman, S.\u00a0D. Schoen, N.\u00a0Heninger, W.\u00a0Clarkson, W.\u00a0Paul, J.\u00a0A. Calandrino, A.\u00a0J. Feldman, J.\u00a0Appelbaum, and E.\u00a0W. Felten. Lest we remember: Cold boot attacks on encryption keys, in USENIX Security Symposium, pp. 45\u201360 (2008)"},{"key":"9286_CR35","doi-asserted-by":"crossref","unstructured":"C.\u00a0Hazay, A.\u00a0L\u00f3pez-Alt, H.\u00a0Wee, and D.\u00a0Wichs. Leakage-resilient cryptography from minimal assumptions. In T.\u00a0Johansson and P.\u00a0Q. Nguyen, editors, EUROCRYPT\u00a02013, volume 7881 of LNCS, (Springer, Berlin, 2013), pp. 160\u2013176.","DOI":"10.1007\/978-3-642-38348-9_10"},{"key":"9286_CR36","doi-asserted-by":"crossref","unstructured":"R.\u00a0Impagliazzo, L.\u00a0A. Levin, and M.\u00a0Luby. Pseudo-random generation from one-way functions (extended abstracts). In 21st ACM STOC (ACM Press, 1989), pp. 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"9286_CR37","unstructured":"Y.\u00a0Ishai, O.\u00a0Pandey, and A.\u00a0Sahai. Public-coin differing-inputs obfuscation and its applications. In Y.\u00a0Dodis and J.\u00a0B. Nielsen, editors, TCC\u00a02015, Part II, vol. 9015 of LNCS, (Springer, Berlin, 2015), pp. 668\u2013697."},{"key":"9286_CR38","doi-asserted-by":"crossref","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2014","unstructured":"J.\u00a0Katz and Y.\u00a0Lindell. Introduction to Modern Cryptography, Second Edition. CRC Press, 2014.","edition":"2"},{"key":"9286_CR39","doi-asserted-by":"crossref","unstructured":"J.\u00a0Katz and V.\u00a0Vaikuntanathan. Signature schemes with bounded leakage resilience. In M.\u00a0Matsui, editor, ASIACRYPT\u00a02009, vol. 5912 of LNCS, (Springer, Berlin, 2009), pp. 703\u2013720","DOI":"10.1007\/978-3-642-10366-7_41"},{"key":"9286_CR40","doi-asserted-by":"crossref","unstructured":"M.\u00a0J. Kearns and U.\u00a0V. Vazirani. An introduction to computational learning theory. Massachusetts Institute of Technology (1994)","DOI":"10.7551\/mitpress\/3897.001.0001"},{"key":"9286_CR41","doi-asserted-by":"crossref","unstructured":"A.\u00a0Kiayias, S.\u00a0Papadopoulos, N.\u00a0Triandopoulos, and T.\u00a0Zacharias. Delegatable pseudorandom functions and applications. In A.-R. Sadeghi, V.\u00a0D. Gligor, and M.\u00a0Yung, editors, ACM CCS 13, (ACM Press, 2013), pp. 669\u2013684.","DOI":"10.1145\/2508859.2516668"},{"issue":"6","key":"9286_CR42","doi-asserted-by":"publisher","first-page":"2224","DOI":"10.1109\/TIT.2005.847746","volume":"51","author":"C-J Lee","year":"2005","unstructured":"C.-J. Lee, C.-J. Lu, S.-C. Tsai, and W.-G. Tzeng. Extracting randomness from multiple independent sources. IEEE Transactions on Information Theory, 51(6):2224\u20132227, 2005.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9286_CR43","doi-asserted-by":"crossref","unstructured":"A.\u00a0B. Lewko, M.\u00a0Lewko, and B.\u00a0Waters. How to leak on key updates. In L.\u00a0Fortnow and S.\u00a0P. Vadhan, editors, 43rd ACM STOC (ACM Press, 2011), pp. 725\u2013734","DOI":"10.1145\/1993636.1993732"},{"key":"9286_CR44","doi-asserted-by":"crossref","unstructured":"T.\u00a0Malkin, I.\u00a0Teranishi, Y.\u00a0Vahlis, and M.\u00a0Yung. Signatures resilient to continual leakage on memory and computation. In Y.\u00a0Ishai, editor, TCC\u00a02011, vol. 6597 of LNCS, (Springer, Berlin, 2011), pp. 89\u2013106","DOI":"10.1007\/978-3-642-19571-6_7"},{"key":"9286_CR45","doi-asserted-by":"crossref","unstructured":"S.\u00a0Micali and L.\u00a0Reyzin. Physically observable cryptography (extended abstract). In M.\u00a0Naor, editor, TCC\u00a02004, vol. 2951 of LNCS (Springer, Berlin, 2004), pp. 278\u2013296","DOI":"10.1007\/978-3-540-24638-1_16"},{"key":"9286_CR46","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naor and G.\u00a0Segev. Public-key cryptosystems resilient to key leakage. In S.\u00a0Halevi, editor, CRYPTO\u00a02009, vol. 5677 of LNCS, (Springer, Berlin, 2009), pp. 18\u201335","DOI":"10.1007\/978-3-642-03356-8_2"},{"key":"9286_CR47","doi-asserted-by":"crossref","unstructured":"A.\u00a0Sahai and B.\u00a0Waters. How to use indistinguishability obfuscation: deniable encryption, and more. In D.\u00a0B. Shmoys, editor, 46th ACM STOC (ACM Press, 2014), pp. 475\u2013484","DOI":"10.1145\/2591796.2591825"},{"key":"9286_CR48","doi-asserted-by":"crossref","unstructured":"B.\u00a0Waters. Dual system encryption: Realizing fully secure IBE and HIBE under simple assumptions. In S.\u00a0Halevi, editor, CRYPTO\u00a02009, volume 5677 of LNCS, (Springer, Berlin, 2009), pp. 619\u2013636","DOI":"10.1007\/978-3-642-03356-8_36"},{"key":"9286_CR49","unstructured":"B.\u00a0Waters. CS 395T Special Topic: Obfuscation in Cryptography. 2014. \n                    http:\/\/www.cs.utexas.edu\/~bwaters\/classes\/CS395T-Fall-14\/outline.html"},{"key":"9286_CR50","unstructured":"B.\u00a0Waters. How to use in distinguishability obfuscation, in Visions of Cryptography, 2014. Talk slides available at \n                    http:\/\/www.cs.utexas.edu\/~bwaters\/presentations\/files\/how-to-use-IO.ppt\n                    \n                  ."},{"key":"9286_CR51","unstructured":"D.\u00a0Wichs. Cryptographic resilience to continual information leakage. Ph.D. Thesis, 2011. \n                    http:\/\/www.ccs.neu.edu\/home\/wichs\/thesis.pdf"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9286-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-018-9286-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9286-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:15:29Z","timestamp":1586333729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-018-9286-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,25]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["9286"],"URL":"https:\/\/doi.org\/10.1007\/s00145-018-9286-z","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2018,4,25]]},"assertion":[{"value":"23 August 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2018","order":3,"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"}]}}