On constructing locally computable extractors and cryptosystems in the bounded storage model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2729, Issue , 2003, Pages 61-77

  Vadhan, Salil P ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY; SIGNAL THEORY;

BOUNDED STORAGE MODEL; CRYPTOLOGY; EXTRACTOR CONSTRUCTION; LOWER BOUNDS; MIN-ENTROPY RATE; PRIVATE-KEY CRYPTOSYSTEMS; RANDOM SOURCES; RANDOMNESS EXTRACTORS;

CRYPTOGRAPHY;

EID: 35248849411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45146-4_4     Document Type: Article

References (29)

1. Vadhan, S.P.: On constructing locally computable extractors and cryptosystems in the bounded storage model. Cryptology ePrint Archive, 2002/162 (2002)
2. Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptology 5 (1992) 53-66
3. Cachin, C., Maurer, U.: Unconditional security against memory-bounded adversaries. In: CRYPTO '97. Spring LNCS 1294 (1997) 292-306
4. Aumann, Y., Rabin, M.O.: Information theoretically secure communication in the limited storage space model. In: CRYPTO '99. Springer LNCS 1666 (1999) 65-79
5. Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the bounded storage model. IEEE Trans. Information Theory 48 (2002) 1668-1680
6. Ding, Y.Z., Rabin, M.O.: Hyper-encryption and everlasting security (extended abstract). In: 19th STACS. Springer LNCS 2285 (2002) 1-26
7. Dziembowski, S., Maurer, U.: Tight security proofs for the bounded-storage model. In: 34th STOC. (2002) 341-350
8. See also preliminary journal version, entitled "Optimal Randomizer Efficiency in the Bounded-Storage Model," Dec. 2002.
9. Lu, C.J.: Hyper-encryption against space-bounded adversaries from on-line strong extractors. In: CRYPTO '02. Springer LNCS 2442 (2002) 257-271
10. Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Computer & System Sci. 52 (1996) 43-52
11. Nisan, N., Ta-Shma, A.: Extracting randomness: A survey and new constructions. J. Computer & System Sci. 58 (1999) 148-173
12. Shaltiel, R.: Recent developments in explicit constructions of extractors. Bull. EATCS 77 (2002) 67-95
13. Bar-Yossef, Z., Reingold, O., Shaltiel, R., Trevisan, L.: Streaming computation of combinatorial objects. In: 17th CCC. (2002) 165-174
14. Trevisan, L.: Extractors and pseudorandom generators. JACM 48 (2001) 860-879
15. Lu, C.J., Reingold, O., Vadhan, S., Wigderson, A.: Extractors: Optimal up to constant factors. In: 35th STOC. (2003)
16. Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Computing 17 (1988) 230-261
17. Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica 16 (1996) 367-391
18. Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal 28 (1949) 656-715
19. Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. In: 41st FOCS. (2000)
20. Bellare, M., Rompel, J.: Randomness-efficient oblivious sampling. In: 35th FOCS. (1994) 276-287
21. Canetti, R., Even, G., Goldreich, O.: Lower bounds for sampling algorithms for estimating the average. Information Processing Letters 53 (1995) 17-25
22. Zuckerman, D.: Randomness-optimal oblivious sampling. Random Struct. & Alg. 11 (1997) 345-367
23. Goldreich, O.: A sample of samplers: A computational perspective on sampling. Technical Report TR97-020, ECCC (1997)
24. Ta-Shma, A.: Almost optimal dispersere. Combinatorica 22 (2002) 123-145
25. Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discrete Math. 13 (2000) 2-24 (electronic)
26. Bellare, M., Goldreich, O., Goldwasser, S.: Randomness in interactive proofs. Computational Complexity 3 (1993) 319-354
27. Goldreich, O., Wigderson, A.: Tiny families of functions with random properties: A quality-size trade-oil for hashing. Random Struct. & Alg. 11 (1997) 315-343
28. Chor, B., Goldreich, O.: On the power of two-point based sampling. J. Complexity 5 (1989) 96-106
29. Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28 (1999) 1364-1396