{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:36:15Z","timestamp":1742960175762,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144950"},{"type":"electronic","value":"9783642144967"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14496-7_2","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T11:51:35Z","timestamp":1284119495000},"page":"19-26","source":"Crossref","is-referenced-by-count":1,"title":["A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dziembowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","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":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-70936-7_26","volume-title":"Theory of Cryptography","author":"D. Cash","year":"2007","unstructured":"Cash, D., Ding, Y.Z., Dodis, Y., Lee, W., Lipton, R.J., Walfish, S.: Intrusion-resilient key exchange in the bounded retrieval model. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 479\u2013498. Springer, Heidelberg (2007)"},{"key":"2_CR3","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. Di Crescenzo","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":"2_CR4","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)"},{"key":"2_CR5","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":"2_CR6","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)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Intrusion-resilient secret sharing. In: FOCS, pp. 227\u2013237 (2007)","DOI":"10.1109\/FOCS.2007.63"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1109\/FOCS.2008.56","volume-title":"49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008","author":"S. Dziembowski","year":"2008","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, Philadelphia, PA, USA, October 25-28, pp. 293\u2013302. IEEE Computer Society, Los Alamitos (2008)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Theory of Cryptography","year":"2006","unstructured":"Halevi, S., Rabin, T. (eds.): TCC 2006. LNCS, vol.\u00a03876. Springer, Heidelberg (2006)"},{"key":"2_CR10","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":"Advances in Cryptology - CRYPTO 2009","author":"Y.D.J. Alwen","year":"2009","unstructured":"Alwen, Y.D.J., Wichs, D.: Leakage resilient public-key cryptography in the bounded retrieval model. In: Halevi, S. (ed.) Advances in Cryptology - CRYPTO 2009. LNCS, vol.\u00a05677, pp. 36\u201354. Springer, Heidelberg (2009)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Katz, J.: Signature schemes with bounded leakage resilience. Cryptology ePrint Archive, Report 2009\/220 (2009), \n                      http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-10366-7_41"},{"issue":"1","key":"2_CR12","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. J. Cryptology\u00a017(1), 27\u201342 (2004)","journal-title":"J. Cryptology"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U.M. Maurer","year":"1992","unstructured":"Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptology\u00a05(1), 53\u201366 (1992)","journal-title":"J. Cryptology"},{"key":"2_CR14","first-page":"67","volume":"77","author":"R. Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS\u00a077, 67\u201395 (2002)","journal-title":"Bulletin of the EATCS"},{"issue":"1","key":"2_CR15","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. Cryptology\u00a017(1), 43\u201377 (2004)","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14496-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T21:36:19Z","timestamp":1674077779000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14496-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144950","9783642144967"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14496-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}