{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T10:33:52Z","timestamp":1791282832111,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642131899","type":"print"},{"value":"9783642131905","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13190-5_7","type":"book-chapter","created":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T09:16:46Z","timestamp":1274260606000},"page":"135-156","source":"Crossref","is-referenced-by-count":106,"title":["Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Faust","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leonid","family":"Reyzin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eran","family":"Tromer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M.: $\\sum_1^1$ -formulae on finite structures. Annals of Pure and Applied Logic\u00a024(1), 48 (1983)","journal-title":"Annals of Pure and Applied Logic"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Approximate counting with uniform constant-depth circuits (1993)","DOI":"10.1090\/dimacs\/013\/01"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/978-3-642-00457-5_28","volume-title":"TCC 2009","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.\u00a05444, pp. 474\u2013495. Springer, Heidelberg (2009)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-03356-8_3","volume-title":"CRYPTO 2009","author":"J. Alwen","year":"2009","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Leakage-resilient public-key cryptography in the bounded-retrieval model. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 36\u201354. Springer, Heidelberg (2009)"},{"key":"7_CR5","unstructured":"Bernstein, D.J.: Cache-timing attacks on AES (2005), http:\/\/cr.yp.to\/papers.html#cachetiming"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys\u00a048, 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"5","key":"7_CR7","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.comnet.2005.01.010","volume":"48","author":"D. Brumley","year":"2005","unstructured":"Brumley, D., Boneh, D.: Remote timing attacks are practical. Comput. Netw.\u00a048(5), 701\u2013716 (2005)","journal-title":"Comput. Netw."},{"key":"7_CR8","unstructured":"Dav\u00ec, F., Dziembowski, S.: Leakage-resilient storage. Cryptology ePrint Archive, Report 2009\/399 (2009), http:\/\/eprint.iacr.org\/"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1145\/1536414.1536498","volume-title":"STOC 2009","author":"Y. Dodis","year":"2009","unstructured":"Dodis, Y., Kalai, Y.T., Lovett, S.: On cryptography with auxiliary input. In: STOC 2009, pp. 621\u2013630. ACM, New York (2009)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1145\/1132516.1132615","volume-title":"STOC 2006","author":"B. Dubrov","year":"2006","unstructured":"Dubrov, B., Ishai, Y.: On the randomness complexity of efficient sampling. In: STOC 2006, pp. 711\u2013720. ACM, New York (2006)"},{"key":"7_CR11","first-page":"293","volume-title":"FOCS 2008","author":"S. Dziembowski","year":"2008","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: FOCS 2008, pp. 293\u2013302. IEEE Computer Society, Los Alamitos (2008)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/978-3-642-11799-2_21","volume-title":"TCC 2010","author":"S. Faust","year":"2010","unstructured":"Faust, S., Kiltz, E., Pietrzak, K., Rothblum, G.N.: Leakage-resilient signatures. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 343\u2013360. Springer, Heidelberg (2010)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/SFCS.1981.35","volume-title":"SFCS 1981: Proceedings of the 22nd Annual Symposium on Foundations of Computer Science","author":"M.L. Furst","year":"1981","unstructured":"Furst, M.L., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. In: SFCS 1981: Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 260\u2013270. IEEE Computer Society, Los Alamitos (1981)"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M.L. Furst","year":"1984","unstructured":"Furst, M.L., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory\u00a017(1), 13\u201327 (1984)","journal-title":"Mathematical Systems Theory"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious rams. In: STOC, pp. 182\u2013194 (1987)","DOI":"10.1145\/28395.28416"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM\u00a043(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-540-85174-5_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"S. Goldwasser","year":"2008","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: One-time programs. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 39\u201356. Springer, Heidelberg (2008)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Almost optimal lower bounds for small depth circuits. In: STOC, pp. 6\u201320 (1986)","DOI":"10.1145\/12130.12132"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a02729, pp. 463\u2013481. Springer, Heidelberg (2003)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Structure in Complexity Theory Conference, pp. 102\u2013111 (1993)","DOI":"10.1109\/SCT.1993.336536"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/978-3-642-10366-7_41","volume-title":"ASIACRYPT 2009","author":"J. Katz","year":"2009","unstructured":"Katz, J., Vaikuntanathan, V.: Signature schemes with bounded leakage resilience. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 703\u2013720. Springer, Heidelberg (2009)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P.C. Kocher","year":"1999","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 388\u2013397. Springer, Heidelberg (1999)"},{"key":"7_CR23","unstructured":"Kuhn, M.G.: Compromising emanations: eavesdropping risks of computer displays. PhD thesis, University of Cambridge, Technical Report UCAM-CL-TR-577 (2003)"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 (extended abstract). In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 278\u2013296. Springer, Heidelberg (2004)"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-03356-8_2","volume-title":"CRYPTO 2009","author":"M. Naor","year":"2009","unstructured":"Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 18\u201335. Springer, Heidelberg (2009)"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11605805_1","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"D.A. Osvik","year":"2006","unstructured":"Osvik, D.A., Shamir, A., Tromer, E.: Cache attacks and countermeasures: The case of AES. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol.\u00a03860, pp. 1\u201320. Springer, Heidelberg (2006)"},{"key":"7_CR27","unstructured":"Percival, C.: Cache missing for fun and profit. Presented at BSDCan 2005, Ottawa (2005); http:\/\/www.daemonology.net\/hyperthreading-considered-harmful"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Petit, C., Standaert, F.-X., Pereira, O., Malkin, T., Yung, M.: A block cipher based pseudo random number generator secure against side-channel key recovery. In: ASIACCS, pp. 56\u201365 (2008)","DOI":"10.1145\/1368310.1368322"},{"key":"7_CR29","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-01001-9_27","volume-title":"EUROCRYPT 2009","author":"K. Pietrzak","year":"2009","unstructured":"Pietrzak, K.: A leakage-resilient mode of operation. In: Joux, A. (ed.) EUROCRYPT 2009, vol.\u00a05479, pp. 462\u2013482. Springer, Heidelburg (2009)"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45418-7_17","volume-title":"Smart Card Programming and Security","author":"J.-J. Quisquater","year":"2001","unstructured":"Quisquater, J.-J., Samyde, D.: Electromagnetic analysis (EMA): Measures and counter-measures for smart cards. In: Attali, S., Jensen, T. (eds.) E-smart 2001. LNCS, vol.\u00a02140, pp. 200\u2013210. Springer, Heidelberg (2001)"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Razborov, A.: Lower bounds for the size of circuits of bounded depth with basis and xor. Math. Notes of the Academy of Science of the USSR 41 (1987)","DOI":"10.1007\/BF01137685"},{"issue":"11","key":"7_CR32","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. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"7_CR33","unstructured":"Shamir, A., Tromer, E.: Acoustic cryptanalysis: on nosy people and noisy machines. Presented at the Eurocrypt 2004 rump session (2004), http:\/\/tromer.org\/acoustic"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for boolean circuit complexity. In: STOC, pp. 77\u201382 (1987)","DOI":"10.1145\/28395.28404"},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-642-01001-9_26","volume-title":"EUROCRYPT 2009","author":"F.-X. Standaert","year":"2009","unstructured":"Standaert, F.-X., Malkin, T., Yung, M.: A unified framework for the analysis of side-channel key recovery attacks. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 443\u2013461. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13190-5_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:02:30Z","timestamp":1606168950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13190-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131899","9783642131905"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13190-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}