{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:12:35Z","timestamp":1743041555482,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319446172"},{"type":"electronic","value":"9783319446189"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44618-9_6","type":"book-chapter","created":{"date-parts":[[2016,8,9]],"date-time":"2016-08-09T21:10:01Z","timestamp":1470777001000},"page":"104-125","source":"Crossref","is-referenced-by-count":1,"title":["Memory Erasability Amplification"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[]},{"given":"Robert R.","family":"Enderlein","sequence":"additional","affiliation":[]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,11]]},"reference":[{"key":"6_CR1","unstructured":"Bernstein, D.J.: Cache-timing attacks on AES. Manuscript, April 2005. https:\/\/cr.yp.to\/antiforgery\/cachetiming-20050414.pdf"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/978-3-642-01001-9_20","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"J Camenisch","year":"2009","unstructured":"Camenisch, J., Chandran, N., Shoup, V.: A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 351\u2013368. Springer, Heidelberg (2009)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/3-540-45539-6_33","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R Canetti","year":"2000","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-resilient functions and all-or-nothing transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 453\u2013469. Springer, Heidelberg (2000)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/978-3-540-70583-3_42","volume-title":"Automata, Languages and Programming","author":"R Canetti","year":"2008","unstructured":"Canetti, R., Eiger, D., Goldwasser, S., Lim, D.-Y.: How to protect yourself without perfect shredding. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 511\u2013523. Springer, Heidelberg (2008)"},{"key":"6_CR5","unstructured":"Canetti, R., Eiger, D., Goldwasser, S., Lim, D.-Y.: How to protect yourself without perfect shredding. Cryptology ePrint Archive, Report 2008\/291 (2008)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1007\/3-540-49116-3_47","volume-title":"STACS 99","author":"G Crescenzo Di","year":"1999","unstructured":"Di Crescenzo, G., Ferguson, N., Impagliazzo, R., Jakobsson, M.: How to forget a secret. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 500\u2013509. Springer, Heidelberg (1999)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: 24th ACM STOC, pp. 699\u2013710. ACM Press, May 1992","DOI":"10.1145\/129712.129780"},{"key":"6_CR8","unstructured":"Ga\u017ei, P., Maurer, U., Tackmann, B.: Manuscript. (available from the authors)"},{"key":"6_CR9","unstructured":"Gutmann, P.: Secure deletion of data from magnetic and solid-state memory. In: Proceedings of the Sixth USENIX Security Symposium, vol. 14, San Jose, CA (1996)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lindell, Y., Patra, A.: Adaptively secure computation with partial erasures. Cryptology ePrint Archive, Report 2015\/450 (2015)","DOI":"10.1145\/2767386.2767400"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-45539-6_16","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"S Jarecki","year":"2000","unstructured":"Jarecki, S., Lysyanskaya, A.: Adaptively secure threshold cryptography: introducing concurrency, removing erasures (extended abstract). In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 221\u2013242. Springer, Heidelberg (2000)"},{"key":"6_CR12","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2015","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. CRC Press, Boca Raton (2015)"},{"key":"6_CR13","unstructured":"Lim, D.-Y.: The paradigm of partial erasures. Ph.D. thesis, Massachusetts Institute of Technology (2008)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-642-27375-9_3","volume-title":"Theory of Security and Applications","author":"U Maurer","year":"2012","unstructured":"Maurer, U.: Constructive cryptography \u2013 a new paradigm for security definitions and proofs. In: M\u00f6dersheim, S., Palamidessi, C. (eds.) TOSCA 2011. LNCS, vol. 6993, pp. 33\u201356. Springer, Heidelberg (2012)"},{"key":"6_CR15","unstructured":"Maurer, U., Renner, R.: Abstract cryptography. In: ICS 2011, pp. 1\u201321. Tsinghua University Press, January 2011"},{"issue":"4","key":"6_CR16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TIT.1960.1057584","volume":"6","author":"M Plotkin","year":"1960","unstructured":"Plotkin, M.: Binary codes with specified minimum distance. IRE Trans. Inf. Theor. 6(4), 445\u2013450 (1960)","journal-title":"IRE Trans. Inf. Theor."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Reardon, J., Basin, D.A., Capkun, S.: SoK: secure data deletion. In: 2013 IEEE Symposium on Security and Privacy, pp. 301\u2013315. IEEE Computer Society Press, May 2013","DOI":"10.1109\/SP.2013.28"},{"key":"6_CR18","unstructured":"Reardon, J., Capkun, S., Basin, D.: Data node encrypted file system: efficient secure deletion for flashmemory. In: Proceedings of the 21st USENIX Conference on Security Symposium, pp. 17\u201317. USENIX Association (2012)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Reardon, J., Ritzdorf, H., Basin, D.A., Capkun, S.: Secure data deletion from persistent media. In: ACM CCS 2013, pp. 271\u2013284. ACM Press, November 2013","DOI":"10.1145\/2508859.2516699"},{"key":"6_CR20","unstructured":"Yee, B.: Using secure coprocessors. Ph.D. thesis, CMU (1994)"},{"key":"6_CR21","unstructured":"Yee, B., Tygar, J.D.: Secure coprocessors in electronic commerce applications. In: Proceedings of The First USENIX Workshop on Electronic Commerce, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44618-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T06:26:18Z","timestamp":1568269578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44618-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319446172","9783319446189"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44618-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}