{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T16:41:16Z","timestamp":1740242476368,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245735"},{"type":"electronic","value":"9783540305767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30576-7_31","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:03:26Z","timestamp":1278270206000},"page":"578-599","source":"Crossref","is-referenced-by-count":7,"title":["Error Correction in the Bounded Storage Model"],"prefix":"10.1007","author":[{"given":"Yan Zong","family":"Ding","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"31_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"},{"key":"31_CR2","unstructured":"Anderson, R.: Two remarks on public key cryptology. Invited Lecture. In: 4th ACM Conference on Computer and Communications Security (1997)"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/3-540-48405-1_5","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"Y. Aumann","year":"1999","unstructured":"Aumann, Y., Rabin, M.O.: Information theoretically secure communication in the limited storage space model. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 65\u201379. Springer, Heidelberg (1999)"},{"issue":"6","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"C. Bennett","year":"1995","unstructured":"Bennett, C., Brassard, G., Cr\u00e9peau, C., Maurer, U.: Generalized privacy amplification. IEEE Transactions on Information Theory\u00a041(6), 1915\u20131923 (1995)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"31_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. Bennett","year":"1988","unstructured":"Bennett, C., Brassard, G., Roberts, J.: Privacy amplification by public discussion. SIAM Journal on Computing\u00a017(2), 210\u2013229 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rompel, J.: Randomness-efficient oblivious sampling. In: 35th Annual IEEE Symposium on Foundations of Computer Science, November 1994, pp. 276\u2013287 (1994)","DOI":"10.1109\/SFCS.1994.365687"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/3-540-48285-7_35","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"G. Brassard","year":"1994","unstructured":"Brassard, G., Salvail, L.: Secret-key reconciliation by public discussion. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 410\u2013423. Springer, Heidelberg (1994)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Cachin, C., Cr\u00e9peau, C., Marcil, J.: Oblivious transfer with a memory-bounded receiver. In: 39th Annual IEEE Symposium on Foundations of Computer Science, November 1998, pp. 493\u2013502 (1998)","DOI":"10.1109\/SFCS.1998.743500"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B. Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing\u00a017(2), 230\u2013261 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s001459900023","volume":"10","author":"C. Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.: Linking information reconciliation and privacy amplification. Journal of Cryptology\u00a010(2), 97\u2013110 (1997)","journal-title":"Journal of Cryptology"},{"key":"31_CR11","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)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Capalbo, M.R., Reingold, O., Vadhan, S.P., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: 34th Annual ACM Symposium on the Theory of Computer Science, pp. 659\u2013668 (2002)","DOI":"10.1145\/510002.510003"},{"key":"31_CR13","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)"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44647-8_9","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"Y.Z. Ding","year":"2001","unstructured":"Ding, Y.Z.: Oblivious transfer in the bounded storage model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 155\u2013170. Springer, Heidelberg (2001)"},{"key":"31_CR15","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":"31_CR16","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"},{"key":"31_CR17","first-page":"1","volume-title":"19th Annual Symposium on Theoretical Aspects of Computer Science","author":"Y.Z. Ding","year":"2002","unstructured":"Ding, Y.Z., Rabin, M.O.: Hyper-encryption and everlasting security (extended abstract). In: 19th Annual Symposium on Theoretical Aspects of Computer Science, pp. 1\u201326. Springer, Heidelberg (2002)"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-540-24676-3_31","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y. Dodis","year":"2004","unstructured":"Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 523\u2013540. Springer, Heidelberg (2004)"},{"issue":"1","key":"31_CR19","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR20","unstructured":"Goldreich, O.: A sample of samplers: A computational perspective on sampling. Technical Report TR97-020, Electronic Colloquium on Computational Complexity (May 1997)"},{"key":"31_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-49264-X_24","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"H. Krawczyk","year":"1995","unstructured":"Krawczyk, H.: New hash functions for message authentication. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 301\u2013310. Springer, Heidelberg (1995)"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"Langberg, M.: Private codes or succinct random codes that are (almost) perfect. In: 45th Annual Symposium on Foundations of Computer Science (2004)","DOI":"10.1109\/FOCS.2004.51"},{"issue":"1","key":"31_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 space-bounded adversaries from on-line strong extractors. Journal of Cryptology\u00a017(1), 27\u201342 (2004)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"31_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":"31_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)"},{"issue":"1","key":"31_CR26","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1006\/jcss.1997.1546","volume":"58","author":"N. Nisan","year":"1999","unstructured":"Nisan, N., Ta-Shma, A.: Extracting randomness: A survey and new constructions. Journal of Computer and System Sciences\u00a058(1), 148\u2013173 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: 22nd Annual ACM Symposium on the Theory of Computer Science, pp. 427\u2013437 (1990)","DOI":"10.1145\/100216.100273"},{"issue":"1","key":"31_CR28","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":"31_CR29","unstructured":"Rabin, M.O.: Personal communication (2002)"},{"key":"31_CR30","first-page":"67","volume":"77","author":"R. Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the European Association for Theoretical Computer Science\u00a077, 67\u201395 (2002)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"31_CR31","unstructured":"Smith, A.: Maintaining secrecy when information leakage is unavoidable. Ph.D. Thesis. MIT (2004)"},{"issue":"6","key":"31_CR32","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M. Sipser","year":"1996","unstructured":"Sipser, M., Spielman, D.A.: Expander codes. IEEE Transactions on Information Theory\u00a042(6), 1710\u20131722 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"key":"31_CR33","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P.: Randomness extractors and their many guises. In: 43rd Annual IEEE Symposium on Foundations of Computer Science, November 2002, p. 9 (2002), Presentation available at http:\/\/www.eecs.harvard.edu\/~salil\/extractor-focs.ppt","DOI":"10.1109\/SFCS.2002.1181877"},{"issue":"1","key":"31_CR34","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"},{"key":"31_CR35","doi-asserted-by":"crossref","unstructured":"van Lint, J.H.: Introduction to Coding Theory (Spring 1999)","DOI":"10.1007\/978-3-642-58575-3"},{"issue":"4\/5","key":"31_CR36","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01940870","volume":"16","author":"D. Zuckerman","year":"1996","unstructured":"Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica\u00a016(4\/5), 367\u2013391 (1996)","journal-title":"Algorithmica"},{"issue":"4","key":"31_CR37","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<345::AID-RSA4>3.0.CO;2-Z","volume":"11","author":"D. Zuckerman","year":"1997","unstructured":"Zuckerman, D.: Randomness-optimal oblivious sampling. Random Structures & Algorithms\u00a011(4), 345\u2013367 (1997)","journal-title":"Random Structures & Algorithms"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30576-7_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T16:16:21Z","timestamp":1740240981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30576-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245735","9783540305767"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30576-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}