Extractors using hardness amplification

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

Volumn 5687 LNCS, Issue , 2009, Pages 462-475

  De, Anindya ^a   Trevisan, Luca ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Direct product theorems; Extractors; Hardness amplification

Indexed keywords

DIRECT PRODUCT; DIRECT PRODUCT THEOREMS; EXTRACTOR CONSTRUCTION; EXTRACTORS; GENERAL FUNCTIONS; HARDNESS AMPLIFICATION; ONE-WAY FUNCTIONS; RANDOM BITS; XOR LEMMA;

AMPLIFICATION; COMBINATORIAL OPTIMIZATION; HARDNESS; SEED; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70350589607     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_35     Document Type: Conference Paper

References (26)

1. Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the bounded storage model. IEEE Transactions on Information Theory 48(6), 1668-1680 (2002)
2. Bar-Yossef, Z., Reingold, O., Shaltiel, R., Trevisan, L.: Streaming computation of combinatorial objects. In: Proceedings of the 17th IEEE Conference on Computational Complexity, pp. 165-174 (2002)
3. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal on Computing 13(4), 850-864 (1984); Preliminary version in Proc. of FOCS 1982
4. Dziembowski, S., Maurer, U.: Optimal randomizer efficiency in the boundedstorage model. Journal of Cryptology 17(1), 5-26 (2004); Preliminary version in Proc. of STOC 2002
5. Goldreich, O., Nisan, N., Wigderson, A.: On Yao's XOR lemma. Technical Report TR95-50, Electronic Colloquium on Computational Complexity (1995)
6. Impagliazzo, R., Jaiswal, R., Kabanets, V., Wigderson, A.: Direct product theorems: Simplified, Optimized and Derandomized. In: Proceedings of the 40th ACM Symposium on Theory of Computing, pp. 579-588 (2008)
7. Impagliazzo, R., Wigderson, A.: P = BPP unless E has sub-exponential circuits. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 220-229 (1997)
8. Levin, L.: One-way functions and pseudorandom generators. Combinatorica 7(4), 357-363 (1987)
9. Lu, C.-J.: Encryption against storage-bounded adversaries from on-line strong extractors. Journal of Cryptology 17(1), 27-42 (2004)
10. Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptology 5(1), 53-66 (1992)
11. Nisan, N.: Extracting randomness: How and why. In: Proceedings of the 11th IEEE Conference on Computational Complexity, pp. 44-58 (1996)
12. Nisan, N., Ta-Shma, A.: Extrating randomness: A survey and new constructions. Journal of Computer and System Sciences (1998) (to appear); Preliminary versions in [11, 18]
13. Nisan, N., Zuckerman, D.: More deterministic simulation in Logspace. In: Proceedings of the 25th ACM Symposium on Theory of Computing, pp. 235-244 (1993)
14. Nisan, N., Wigderson, A.: Hardness vs randomness. Journal of Computer and System Sciences 49, 149-167 (1994); Preliminary version in Proc. of FOCS 1988
15. Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences 52(1), 43-52 (1996); Preliminary version in Proc. of STOC 1993
16. Shaltiel, R.: Recent developments in extractors. Bulletin of the European Association for Theoretical Computer Science 77, 67-95 (2002)
17. Shaltiel, R., Umans, C.: Simple extractors for all min-entropies and a new pseudorandom generator. Journal of the ACM 52(2), 172-216 (2005)
18. Ta-Shma, A.: On extracting randomness from weak random sources. In: Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 276-285 (1996)
19. Ta-Shma, A., Zuckerman, D., Safra, S.: Extractors from Reed-Muller codes. Technical Report TR01-036, Electronic Colloquium on Computational Complexity (2001)
20. Trevisan, L.: Extractors and pseudorandom generators. Journal of the ACM 48(4), 860-879 (2001)
21. Vadhan, S.P.: Constructing locally computable extractors and cryptosystems in the bounded-storage model. Journal of Cryptology 17(1), 43-77 (2004)
22. Viola, E.: The complexity of constructing pseudorandom generators from hard functions. Computational Complexity 13(3-4), 147-188 (2004)
23. Yao, A.C.: Theory and applications of trapdoor functions. In: Proceedings of the 23th IEEE Symposium on Foundations of Computer Science, pp. 80-91 (1982)
24. Zimand, M.: Simple Extractors via Constructions of Cryptographic Pseudo-random Generators. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 115-127. Springer, Heidelberg (2005)
25. Zuckerman, D.: General weak random sources. In: Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pp. 534-543 (1990)
26. Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica 16(4/5), 367-391 (1996)