{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:47Z","timestamp":1766281007281},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540374329"},{"type":"electronic","value":"9783540374336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11818175_15","type":"book-chapter","created":{"date-parts":[[2006,9,23]],"date-time":"2006-09-23T06:21:52Z","timestamp":1158992512000},"page":"251-270","source":"Crossref","is-referenced-by-count":36,"title":["On Forward-Secure Storage"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dziembowski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/TIT.2002.1003845","volume":"48","author":"Y. Aumann","year":"2002","unstructured":"Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the Bounded Storage Model. IEEE Transactions on Information Theory\u00a048(6), 1668\u20131680 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","key":"15_CR2","DOI":"10.1145\/168588.168596"},{"doi-asserted-by":"crossref","unstructured":"Cachin, C., Crepeau, C., Marcil, J.: Oblivious transfer with a memory-bounded receiver. In: 39th Annual Symposium on Foundations of Computer Science, pp. 493\u2013502 (1998)","key":"15_CR3","DOI":"10.1109\/SFCS.1998.743500"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"C. Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.M.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 292\u2013306. Springer, Heidelberg (1997)"},{"unstructured":"Cash, D., Ding, Y.Z., Dodis, Y., Lee, W., Lipton, R., Walfish, S.: Intrusion-resilient authentication in the Limited Communication Model. Cryptology ePrint Archive, Report 2005\/409 (2005), http:\/\/eprint.iacr.org\/","key":"15_CR5"},{"issue":"6","key":"15_CR6","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B. Chor","year":"1998","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private Information Retrieval. Journal of the ACM\u00a045(6), 965\u2013981 (1998)","journal-title":"Journal of the ACM"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/11681878_12","volume-title":"Theory of Cryptography","author":"G. Crescenzo Di","year":"2006","unstructured":"Di Crescenzo, G., Lipton, R.J., Walfish, S.: Perfectly Secure Password Protocols in the Bounded Retrieval Model. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 225\u2013244. Springer, Heidelberg (2006)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45539-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"G. Crescenzo Di","year":"2000","unstructured":"Di Crescenzo, G., Malkin, T.G., Ostrovsky, R.: Single Database Private Information Retrieval Implies Oblivious Transfer. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 122\u2013138. Springer, Heidelberg (2000)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11507840_2","volume-title":"Financial Cryptography and Data Security","author":"D. Dagon","year":"2005","unstructured":"Dagon, D., Lee, W., Lipton, R.J.: Protecting secret data from insider attacks. In: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol.\u00a03570, pp. 16\u201330. Springer, Heidelberg (2005)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-24638-1_25","volume-title":"Theory of Cryptography","author":"Y.Z. Ding","year":"2004","unstructured":"Ding, Y.Z., Harnik, D., Rosen, A., Shaltiel, R.: Constant-Round Oblivious Transfer in the Bounded Storage Model. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 446\u2013472. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Dubrov, B., Ishai, Y.: On the randomness complexity of efficient sampling. In: ACM Symposium on Theory of Computing, pp. 711\u2013720 (2006)","key":"15_CR11","DOI":"10.1145\/1132516.1132615"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11681878_11","volume-title":"Theory of Cryptography","author":"S. Dziembowski","year":"2006","unstructured":"Dziembowski, S.: Intrusion-Resilience Via the Bounded-Storage Model. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 207\u2013224. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Dziembowski, S.: On Forward-Secure Storage. Cryptology ePrint Archive (2006), http:\/\/eprint.iacr.org","key":"15_CR13","DOI":"10.1007\/11818175_15"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-24676-3_8","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"S. Dziembowski","year":"2004","unstructured":"Dziembowski, S., Maurer, U.M.: On Generating the Initial Key in the Bounded-Storage Model. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 126\u2013137. Springer, Heidelberg (2004)"},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00145-003-0309-y","volume":"17","author":"S. Dziembowski","year":"2004","unstructured":"Dziembowski, S., Maurer, U.: Optimal randomizer efficiency in the Bounded-Storage Model. Journal of Cryptology\u00a017(1), 5\u201326 (2004)","journal-title":"Journal of Cryptology"},{"doi-asserted-by":"crossref","unstructured":"Harnik, D., Naor, M.: On the compressibility of NP instances and cryptographic applications. Electronic Colloquium on Computational Complexity, Report TR06-022 (2006)","key":"15_CR16","DOI":"10.1109\/FOCS.2006.54"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/11787006_17","volume-title":"Automata, Languages and Programming","author":"D. Harnik","year":"2006","unstructured":"Harnik, D., Naor, M.: On everlasting security in the hybrid bounded storage model. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 192\u2013203. Springer, Heidelberg (2006)"},{"issue":"4","key":"15_CR18","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: ACM Symposium on Theory of Computing, pp. 44\u201361 (1989)","key":"15_CR19","DOI":"10.1145\/73007.73012"},{"doi-asserted-by":"crossref","unstructured":"Kelsey, J., Schneier, B.: Authenticating secure tokens using slow memory access. In: USENIX Workshop on Smart Card Technology, pp. 101\u2013106 (1999)","key":"15_CR20","DOI":"10.21236\/ADA385266"},{"doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, Computationally-Private Information Retrieval. In: 38th Annual Symposium on Foundations of Computer Science, pp. 364\u2013373 (1997)","key":"15_CR21","DOI":"10.1109\/SFCS.1997.646125"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-45539-6_9","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"E. Kushilevitz","year":"2000","unstructured":"Kushilevitz, E., Ostrovsky, R.: One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 104\u2013121. Springer, Heidelberg (2000)"},{"issue":"1","key":"15_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00145-003-0217-1","volume":"17","author":"C.-J. Lu","year":"2004","unstructured":"Lu, C.-J.: Encryption against storage-bounded adversaries from on-line strong extractors. Journal of Cryptology\u00a017(1), 27\u201342 (2004)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"15_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U. Maurer","year":"1992","unstructured":"Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology\u00a05(1), 53\u201366 (1992)","journal-title":"Journal of Cryptology"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/978-3-540-28628-8_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"T. Moran","year":"2004","unstructured":"Moran, T., Shaltiel, R., Ta-Shma, A.: Non-interactive Timestamping in the Bounded Storage Model. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 460\u2013476. Springer, Heidelberg (2004)"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11761679_20","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"K. Pietrzak","year":"2006","unstructured":"Pietrzak, K.: Composition implies adaptive security in minicrypt. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 328\u2013338. Springer, Heidelberg (2006)"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0052348","volume-title":"Fast Software Encryption","author":"R.L. Rivest","year":"1997","unstructured":"Rivest, R.L.: All-or-nothing encryption and the package transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol.\u00a01267, pp. 210\u2013218. Springer, Heidelberg (1997)"},{"issue":"1","key":"15_CR28","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. Journal of Cryptology\u00a017(1), 43\u201377 (2004)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11818175_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:06Z","timestamp":1605644166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11818175_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374329","9783540374336"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11818175_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}