{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,4]],"date-time":"2026-09-04T01:40:42Z","timestamp":1788486042468,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662443705","type":"print"},{"value":"9783662443712","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44371-2_26","type":"book-chapter","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T03:28:15Z","timestamp":1405308495000},"page":"462-479","source":"Crossref","is-referenced-by-count":18,"title":["On the Impossibility of Cryptography with Tamperable Randomness"],"prefix":"10.1007","author":[{"given":"Per","family":"Austrin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai-Min","family":"Chung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Mahmoody","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karn","family":"Seth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-642-00457-5_28","volume-title":"Theory of Cryptography","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)"},{"issue":"49","key":"26_CR2","first-page":"14","volume":"7","author":"A. One","year":"1996","unstructured":"One, A.: Smashing the stack for fun and profit. Phrack Magazine\u00a07(49), File 14 (1996)","journal-title":"Phrack Magazine"},{"key":"26_CR3","unstructured":"Anderson, R., Kuhn, M.: Tamper resistance \u2013 a cautionary note. In: Proceedings of the Second USENIX Workshop on Electronic Commerce, pp. 1\u201311 (November 1996)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Austrin, P., Chung, K.-M., Mahmoody, M., Pass, R., Seth, K.: On the impossibility of cryptography with tamperable randomness. Cryptology ePrint Archive, Report 2013\/194 (2013), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-662-44371-2_26"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BFb0052259","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Biham","year":"1997","unstructured":"Biham, E., Shamir, A.: Differential fault analysis of secret key cryptosystems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 513\u2013525. Springer, Heidelberg (1997)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-69053-0_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of checking cryptographic protocols for faults. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 37\u201351. Springer, Heidelberg (1997)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Kalai, Y.T., Katz, J., Vaikuntanathan, V.: Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage. In: FOCS, pp. 501\u2013510. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.55"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In: STOC, pp. 235\u2013244 (2000)","DOI":"10.1145\/335305.335334"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1007\/978-3-642-25385-0_40","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"S.G. Choi","year":"2011","unstructured":"Choi, S.G., Kiayias, A., Malkin, T.: BiTR: Built-in tamper resilience. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 740\u2013758. Springer, Heidelberg (2011)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Dachman-Soled, D., Kalai, Y.T.: Securing circuits against constant-rate tampering. IACR Cryptology ePrint Archive, 2012:366 (2012); Informal publication","DOI":"10.1007\/978-3-642-32009-5_31"},{"key":"26_CR11","unstructured":"Dodis, Ong, Prabhakaran, Sahai: On the (im)possibility of cryptography with imperfect randomness. In: FOCS: IEEE Symposium on Foundations of Computer Science, FOCS (2004)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-11799-2_22","volume-title":"Theory of Cryptography","author":"Y. Dodis","year":"2010","unstructured":"Dodis, Y., Goldwasser, S., Tauman Kalai, Y., Peikert, C., Vaikuntanathan, V.: Public-key encryption schemes with auxiliary inputs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 361\u2013381. Springer, Heidelberg (2010)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Haralambiev, K., L\u00f3pez-Alt, A., Wichs, D.: Cryptography against continuous memory attacks. In: FOCS, pp. 511\u2013520. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.56"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: FOCS, pp. 293\u2013302. IEEE Computer Society (2008)","DOI":"10.1109\/FOCS.2008.56"},{"key":"26_CR15","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. In: Yao, A.C.-C. (ed.) ICS, pp. 434\u2013452. Tsinghua University Press (2010)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-22006-7_33","volume-title":"Automata, Languages and Programming","author":"S. Faust","year":"2011","unstructured":"Faust, S., Pietrzak, K., Venturi, D.: Tamper-proof circuits: How to trade leakage for tamper-resilience. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 391\u2013402. Springer, Heidelberg (2011)"},{"key":"26_CR17","first-page":"12","volume-title":"Proceedings of the 2009 Conference on Electronic Voting Technology\/Workshop on Trustworthy Elections, EVT\/WOTE 2009","author":"J. Ariel","year":"2009","unstructured":"Ariel, J.: Feldman and Josh Benaloh. On subliminal channels in encrypt-on-cast voting systems. In: Proceedings of the 2009 Conference on Electronic Voting Technology\/Workshop on Trustworthy Elections, EVT\/WOTE 2009, p. 12. USENIX Association, Berkeley (2009)"},{"key":"26_CR18","unstructured":"Frykholm, N.: Countermeasures against buffer overflow attacks. Technical report, RSA Data Security, Inc., pub-RSA:adr (November 2000)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-24638-1_15","volume-title":"Theory of Cryptography","author":"R. Gennaro","year":"2004","unstructured":"Gennaro, R., Lysyanskaya, A., Malkin, T., Micali, S., Rabin, T.: Algorithmic tamper-proof (atp) security: Theoretical foundations for security against hardware tampering. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 258\u2013277. Springer, Heidelberg (2004)"},{"issue":"1","key":"26_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. Journal of Cryptology\u00a07(1), 1\u201332 (1994)","journal-title":"Journal of Cryptology"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Rothblum, G.: How to compute in the presence of leakage (2012)","DOI":"10.1109\/FOCS.2012.34"},{"key":"26_CR22","unstructured":"Heninger, N., Durumeric, Z., Wustrow, E., Halderman, J.A.: Mining your Ps and Qs: Detection of widespread weak keys in network devices. In: Proceedings of the 21st USENIX Security Symposium (August 2012)"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), pp. 230\u2013235 (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/11761679_19","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"Y. Ishai","year":"2006","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A., Wagner, D.: Private circuits II: Keeping secrets in tamperable circuits. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 308\u2013327. Springer, Heidelberg (2006)"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Kalai, Y., Lewko, A., Rao, A.: Formulas resilient to short-circuit errors (2012)","DOI":"10.1109\/FOCS.2012.69"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-642-22792-9_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Y.T. Kalai","year":"2011","unstructured":"Kalai, Y.T., Kanukurthi, B., Sahai, A.: Cryptography with tamperable and leaky memory. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 373\u2013390. Springer, Heidelberg (2011)"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-32009-5_37","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"A.K. Lenstra","year":"2012","unstructured":"Lenstra, A.K., Hughes, J.P., Augier, M., Bos, J.W., Kleinjung, T., Wachter, C.: Public keys. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 626\u2013642. Springer, Heidelberg (2012)"},{"key":"26_CR28","unstructured":"Lenstra, A.K., Hughes, J.P., Augier, M., Bos, J.W., Kleinjung, T., Wachter, C.: Ron was wrong, whit is right. Cryptology ePrint Archive, Report 2012\/064 (2012), http:\/\/eprint.iacr.org\/"},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-15317-4_8","volume-title":"Security and Cryptography for Networks","author":"F.-H. Liu","year":"2010","unstructured":"Liu, F.-H., Lysyanskaya, A.: Algorithmic tamper-proof security under probing attacks. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol.\u00a06280, pp. 106\u2013120. Springer, Heidelberg (2010)"},{"key":"26_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-642-32009-5_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"F.-H. Liu","year":"2012","unstructured":"Liu, F.-H., Lysyanskaya, A.: Tamper and leakage resilience in the split-state model. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 517\u2013532. Springer, Heidelberg (2012)"},{"key":"26_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"issue":"4","key":"26_CR32","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/MSP.2004.36","volume":"2","author":"J.D. Pincus","year":"2004","unstructured":"Pincus, J.D., Baker, B.: Beyond stack smashing: Recent advances in exploiting buffer overruns. IEEE Security & Privacy\u00a02(4), 20\u201327 (2004)","journal-title":"IEEE Security & Privacy"},{"issue":"2","key":"26_CR33","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"26_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-642-32009-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"G.N. Rothblum","year":"2012","unstructured":"Rothblum, G.N.: How to compute under ${\\cal{AC}}^{\\sf0}$ leakage without secure hardware. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 552\u2013569. Springer, Heidelberg (2012)"},{"issue":"1","key":"26_CR35","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0022-0000(86)90044-9","volume":"33","author":"M. Santha","year":"1986","unstructured":"Santha, M., Vazirani, U.V.: Generating quasi-random sequences from semi-random sources. J. Comput. Syst. Sci.\u00a033(1), 75\u201387 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"26_CR36","first-page":"15","volume":"5","author":"G.J. Simmons","year":"1994","unstructured":"Simmons, G.J.: Subliminal channels; past and present. ETT\u00a05(4), 15 (1994)","journal-title":"ETT"},{"key":"26_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-68697-5_8","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"A. Young","year":"1996","unstructured":"Young, A., Yung, M.: The dark side of \u201cBlack-box\u201d cryptography, or: Should we trust capstone? In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 89\u2013103. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44371-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T19:47:13Z","timestamp":1746301633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44371-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662443705","9783662443712"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44371-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}