{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:28:59Z","timestamp":1769297339785,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705826","type":"print"},{"value":"9783540705833","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_42","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"511-523","source":"Crossref","is-referenced-by-count":8,"title":["How to Protect Yourself without Perfect Shredding"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dror","family":"Eiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shafi","family":"Goldwasser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dah-Yoh","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","unstructured":"Anderson, R.: Two remarks on public key cryptology invited lecture. In: Acm-Ccs 1997 (1997)"},{"key":"42_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"D. Beaver","year":"1997","unstructured":"Beaver, D.: Plug and play encryption. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294. Springer, Heidelberg (1997)"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. 42nd IEEE Symp. on Foundations of Comp. Science, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a01807, pp. 453\u2013469. Springer, Heidelberg (2000)"},{"key":"42_CR5","unstructured":"Canetti, R., Eiger, D., Goldwasser, S., Lim, D.-Y.: How to protect yourself without perfect shredding (full version) (1995), http:\/\/eprint.iacr.org\/"},{"key":"42_CR6","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure computation (2008)"},{"key":"42_CR7","unstructured":"Canetti, R., Gennaro, R., Herzberg, A., Naor, D.: Proactive security: Long-term protection against break-ins. In: CryptoBytes (1) (1999)"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. JCSS\u00a018 (1979)","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"42_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a01563, pp. 500\u2013509. Springer, Heidelberg (1999)"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Lipton, R.J., Walfish, S.: Perfectly secure password protocols in the bounded retrieval model. In: Theory of Cryptography Conference, pp. 225\u2013244 (2006)","DOI":"10.1007\/11681878_12"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Dagon, D., Lee, W., Lipton, R.J.: Protecting secret data from insider attacks. In: Financial Cryptography, pp. 16\u201330 (2005)","DOI":"10.1007\/11507840_2"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Diffie, W., Van-Oorschot, P.C., Weiner, M.J.: Authentication and authenticated key exchanges. In: Designs, Codes, and Cryptography, pp. 107\u2013125 (1992)","DOI":"10.1007\/BF00124891"},{"key":"42_CR13","unstructured":"Dodis, Y.: Exposure-Resilient Cryptography. PhD thesis. MIT, Cambridge (2000)"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Dziembowski, S.: Intrusion-resilience via the bounded-storage model. In: Theory of Cryptography Conference, pp. 207\u2013224 (2006)","DOI":"10.1007\/11681878_11"},{"key":"42_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11818175_15","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"S. Dziembowski","year":"2006","unstructured":"Dziembowski, S.: On forward-secure storage. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 251\u2013270. Springer, Heidelberg (2006)"},{"key":"42_CR16","first-page":"227","volume-title":"FOCS 2007","author":"S. Dziembowski","year":"2007","unstructured":"Dziembowski, S., Pietrzak, K.: Intrusion-resilient secret sharing. In: FOCS 2007, Washington, DC, USA, pp. 227\u2013237. IEEE Computer Society, Los Alamitos (2007)"},{"key":"42_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/BFb0052254","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"Y. Frankel","year":"1997","unstructured":"Frankel, Y., Gemmel, P., MacKenzie, P.D., Yung, M.: Proactive rsa. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 440\u2013454. Springer, Heidelberg (1997)"},{"key":"42_CR18","unstructured":"Garfinkel, S.L.: Design Principles and Patterns for Computer Systems That Are Simultaneously Secure and Usable. PhD thesis. MIT, Cambridge (2005)"},{"key":"42_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/3-540-68339-9_31","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"R. Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold Dss signatures. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 354\u2013371. Springer, Heidelberg (1996)"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"G\u00fcnther, C.G.: An identity-based key-exchange protocol. In: Proc. EUROCRYPT 1989, pp. 29\u201337 (1989)","DOI":"10.1007\/3-540-46885-4_5"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Halderman, J.A., Schoen, S.D., Heninger, N., Clarkson, W., Paul, W., Calandrino, J.A., Feldman, A.J., Appelbaum, J., Felten, E.W.: Lest We Remember: Cold Boot Attacks on Encryption Keys (April 2008), http:\/\/citp.princeton.edu\/memory\/","DOI":"10.1145\/1506409.1506429"},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., Yung, M.: Proactive public key and signature systems. In: ACM Conference on Computers and Communication Security (1997)","DOI":"10.1145\/266420.266442"},{"key":"42_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"A. Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing, or: How to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 339\u2013352. Springer, Heidelberg (1995)"},{"key":"42_CR24","unstructured":"Hughes, G., Coughlin, T.: Tutorial on hard drive sanitation (2006), http:\/\/www.tomcoughlin.com\/"},{"key":"42_CR25","unstructured":"Hughes, G., Coughlin, T.: Secure erase of disk drive data, pp. 22\u201325 (2002)"},{"key":"42_CR26","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: STOC 1989, pp. 12\u201324 (1989)","DOI":"10.1145\/73007.73009"},{"key":"42_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-45708-9_32","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"G. Itkis","year":"2002","unstructured":"Itkis, G., Reyzin, L.: Sibir: Signer-base intrusion-resilient signatures. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 499\u2013514. Springer, Heidelberg (2002)"},{"key":"42_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 221\u2013243. Springer, Heidelberg (2000)"},{"key":"42_CR29","doi-asserted-by":"crossref","unstructured":"Lu, C.-J.: Encryption against storage-bounded adversaries from on-line strong extractors. In: Proc. CRYPTO 2002, pp. 257\u2013271 (2002)","DOI":"10.1007\/3-540-45708-9_17"},{"key":"42_CR30","unstructured":"Lysyanskaya, A.: Efficient threshold and proactive cryptography secure against the adaptive adversary (extended abstract) (1999)"},{"key":"42_CR31","unstructured":"Mansour, Y., Nisan, N., Tiwari, P.: The computational complexity of universal hashing. In: Proc. 22nd ACM Symp. on Theory of Computing (2002)"},{"key":"42_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/3-540-46877-3_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"U. Maurer","year":"1991","unstructured":"Maurer, U.: A provably-secure strongly-randomized cipher. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 361\u2013373. Springer, Heidelberg (1991)"},{"key":"42_CR33","doi-asserted-by":"crossref","unstructured":"Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher, pp. 53\u201366 (1992)","DOI":"10.1007\/BF00191321"},{"issue":"1","key":"42_CR34","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences\u00a052(1), 43\u201352 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"42_CR35","unstructured":"Department of\u00a0Defense. DoD 5220.22-M: National Industrial Security Program Operating Manual (1997)"},{"key":"42_CR36","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks, pp. 51\u201361 (1991)","DOI":"10.1145\/112600.112605"},{"key":"42_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44598-6_27","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"I. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I., Nielsen, J.: Improved non-committing encryption schemes based on a general complexity assumption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, Springer, Heidelberg (2000)"},{"key":"42_CR38","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal, 656\u2013715","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"42_CR39","doi-asserted-by":"crossref","unstructured":"Vaarala, S.: T-110.5210 cryptosystems lecture notes (2006)","DOI":"10.3917\/graph1.019.0110"},{"issue":"1","key":"42_CR40","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00145-003-0237-x","volume":"17","author":"S.P. Vadhan","year":"2004","unstructured":"Vadhan, S.P.: Constructing locally computable extractors and cryptosystems in the bounded-storage model. J. Cryptol.\u00a017(1), 43\u201377 (2004)","journal-title":"J. Cryptol."},{"key":"42_CR41","unstructured":"Yee, B.: Using secure coprocessors. PhD thesis (May 1994)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:14:06Z","timestamp":1738325646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}