{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T22:24:21Z","timestamp":1748298261257,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406747"},{"type":"electronic","value":"9783540451464"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45146-4_4","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T21:51:19Z","timestamp":1277243479000},"page":"61-77","source":"Crossref","is-referenced-by-count":29,"title":["On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model"],"prefix":"10.1007","author":[{"given":"Salil P.","family":"Vadhan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P.: On constructing locally computable extractors and cryptosystems in the bounded storage model. Cryptology ePrint Archive, 2002\/162 (2002)","DOI":"10.1007\/978-3-540-45146-4_4"},{"key":"4_CR2","doi-asserted-by":"crossref","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. J. Cryptology\u00a05, 53\u201366 (1992)","journal-title":"J. Cryptology"},{"key":"4_CR3","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.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 292\u2013306. Springer, Heidelberg (1997)"},{"key":"4_CR4","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)"},{"key":"4_CR5","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 Trans. Information Theory\u00a048, 1668\u20131680 (2002)","journal-title":"IEEE Trans. Information Theory"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45841-7_1","volume-title":"STACS 2002","author":"Y.Z. Ding","year":"2002","unstructured":"Ding, Y.Z., Rabin, M.O.: Hyper-encryption and everlasting security (extended abstract). In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 1\u201326. Springer, Heidelberg (2002)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Maurer, U.: Tight security proofs for the bounded-storage model. In: 34th STOC, December 2000, pp. 341\u2013350 (2002), See also preliminary journal version, entitled Optimal Randomizer Efficiency in the Bounded-Storage Model (2002)","DOI":"10.1145\/509907.509960"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-45708-9_17","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"C.J. Lu","year":"2002","unstructured":"Lu, C.J.: Hyper-encryption against space-bounded adversaries from on-line strong extractors. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 257\u2013271. Springer, Heidelberg (2002)"},{"key":"4_CR9","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. J. Computer & System Sci.\u00a052, 43\u201352 (1996)","journal-title":"J. Computer & System Sci."},{"key":"4_CR10","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. J. Computer & System Sci.\u00a058, 148\u2013173 (1999)","journal-title":"J. Computer & System Sci."},{"key":"4_CR11","first-page":"67","volume":"77","author":"R. Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent developments in explicit constructions of extractors. Bull. EATCS\u00a077, 67\u201395 (2002)","journal-title":"EATCS"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Bar-Yossef, Z., Reingold, O., Shaltiel, R., Trevisan, L.: Streaming computation of combinatorial objects. In: 17th CCC, pp. 165\u2013174 (2002)","DOI":"10.1109\/CCC.2002.1004352"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1145\/502090.502099","volume":"48","author":"L. Trevisan","year":"2001","unstructured":"Trevisan, L.: Extractors and pseudorandom generators. JACM\u00a048, 860\u2013879 (2001)","journal-title":"JACM"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Lu, C.J., Reingold, O., Vadhan, S., Wigderson, A.: Extractors: Optimal up to constant factors. In: 35th STOC (2003)","DOI":"10.1145\/780627.780630"},{"key":"4_CR15","first-page":"230","volume":"17","author":"B. Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM. J. Computing\u00a017, 230\u2013261 (1988)","journal-title":"J. Computing"},{"key":"4_CR16","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, 367\u2013391 (1996)","journal-title":"Algorithmica"},{"key":"4_CR17","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal\u00a028, 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. In: 41st FOCS (2000)","DOI":"10.1109\/SFCS.2000.892008"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rompel, J.: Randomness-efficient oblivious sampling. In: 35th FOCS, pp. 276\u2013287 (1994)","DOI":"10.1109\/SFCS.1994.365687"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(94)00171-T","volume":"53","author":"R. Canetti","year":"1995","unstructured":"Canetti, R., Even, G., Goldreich, O.: Lower bounds for sampling algorithms for estimating the average. Information Processing Letters\u00a053, 17\u201325 (1995)","journal-title":"Information Processing Letters"},{"key":"4_CR21","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 Struct. & Alg.\u00a011, 345\u2013367 (1997)","journal-title":"Random Struct. & Alg."},{"key":"4_CR22","unstructured":"Goldreich, O.: A sample of samplers: A computational perspective on sampling. Technical Report TR97-020, ECCC (1997)"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s004930200006","volume":"22","author":"A. Ta-Shma","year":"2002","unstructured":"Ta-Shma, A.: Almost optimal dispersers. Combinatorica\u00a022, 123\u2013145 (2002)","journal-title":"Combinatorica"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM. J. Discrete Math.\u00a013, 2\u201324 (2000) (electronic)","journal-title":"J. Discrete Math."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF01275487","volume":"3","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Goldreich, O., Goldwasser, S.: Randomness in interactive proofs. Computational Complexity\u00a03, 319\u2013354 (1993)","journal-title":"Computational Complexity"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<315::AID-RSA3>3.0.CO;2-1","volume":"11","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Wigderson, A.: Tiny families of functions with random properties: A quality-size trade-off for hashing. Random Struct. & Alg.\u00a011, 315\u2013343 (1997)","journal-title":"Random Struct. & Alg."},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0885-064X(89)90015-0","volume":"5","author":"B. Chor","year":"1989","unstructured":"Chor, B., Goldreich, O.: On the power of two-point based sampling. J. Complexity\u00a05, 96\u2013106 (1989)","journal-title":"J. Complexity"},{"key":"4_CR28","first-page":"1364","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, 1364\u20131396 (1999)","journal-title":"J. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45146-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:05:38Z","timestamp":1740200738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45146-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406747","9783540451464"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45146-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}