Deterministic extractors for bit-fixing sources by obtaining an independent seed

SIAM Journal on Computing

Volumn 36, Issue 4, 2006, Pages 1072-1094

  Gabizon, Ariel ^a   Raz, Ran ^a   Shaltiel, Ronen ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

Bit fixing sources; Derandomization; Deterministic extractors; Seed obtainers; Seeded extractors

Indexed keywords

COMPUTER SCIENCE; FEATURE EXTRACTION; RANDOM PROCESSES; STATISTICAL METHODS;

BIT-FIXING SOURCES; DERANDOMIZATION; DETERMINISTIC EXTRACTORS; SEED OBTAINERS; SEEDED EXTRACTORS;

PROBABILITY DISTRIBUTIONS;

EID: 34547843024     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705447049     Document Type: Article

References (39)

1. N. ALON, O. GOLDREICH, J. HASTAD, AND R. PERALTA, Simple constructions of almost k-wise independent random variables, Random Structures Algorithms, 3 (1992), pp. 289-304.
2. B. BARAK, R. IMPAGLIAZZO, AND A. WIGDERSON, Extracting randomness from few independent sources, in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004, pp. 384-393.
3. B. BARAK, G. KINDLER, R. SHALTIEL, B. SUDAKOV, AND A. WIGDERSON, Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 1-10.
4. M. BELLARE AND J. ROMPEL, Randomness-efficient oblivious sampling, in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 276-287.
5. M. BEN-OR AND N. LINIAL, Collective coin flipping, in Advances in Computing Research 5, JAI Press, Greenwich, CT, 1989, pp. 91-116.
6. M. BLUM, Independent unbiased coin flips from a correlated biased source: A finite state Markov chain, in Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, 1984, pp. 425-433.
7. V. BOYKO, On the security properties of OAEP as an all-or-nothing transform, in Proceedings of the 19th International Advances in Cryptology Conference (CRYPTO '99), 1999, pp. 503-518.
8. R. CANETTI, Y. DODIS, S. HALEVI, E. KUSHILEVITZ, AND A. SAHAI, Exposure-resilient functions and all-or-nothing transforms, in Advances in Cryptology-EUROCRYPT 2000, Lecture Notes in Comput. Sci. 1807, Springer-Verlag, Berlin, 2000, pp. 453-469.
9. I. L. CARTER AND M. N. WEGMAN, Universal classes of hash functions, in Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977, pp. 106-112.
10. B. CHOR AND O. GOLDREICH, Unbiased bits from sources of weak randomness and probabilistic communication complexity, SIAM J. Comput., 17 (1988), pp. 230-261.
11. B. CHOR, O. GOLDREICH, J. HASTAD, J. FRIEDMAN, S. RUDICH, AND R. SMOLENSKY, The bit extraction problem or t-resilient functions, in Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 396-407.
12. A. COHEN AND A. WIGDERSON, Dispersers, deterministic amplification, and weak random sources, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 14-25.
13. Y. DODIS, Exposure-Resilient Cryptography, Ph.D. thesis, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 2000.
14. Y. DODIS, A. SAHAI, AND A. SMITH, On perfect and adaptive security in exposure-resilient cryptography, in Advances in Cryptyology - EUROCRYPT 2001, Lecture Notes in Comput. Sci. 2045, Springer-Verlag, Berlin, 2001, pp. 299-322.
15. S. EVEN, O. GOLDREICH, M. LUBY, N. NISAN, AND B. VELICKOVIC, Efficient approximation of product distributions, Random Structures Algorithms, 13 (1998), pp. 1-16.
16. O. GOLDREICH, A Sample of Samplers - A Computational Perspective on Sampling, Electronic Colloquium on Computational Complexity (ECCC), 1997.
17. J. KAMP AND D. ZUCKERMAN, Deterministic extractors for bit-fixing sources and exposure-resilient cryptography, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 92-101.
18. R. LIPTON AND N. VISHNOI, manuscript, 2004.
19. L. LOVASZ, Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1979.
20. J. NAOR AND M. NAOR, Small-bias probability spaces: Efficient constructions and applications, SIAM J. Comput., 22 (1993), pp. 838-856.
21. N. NISAN, Extracting randomness: How and why- A survey, in Proceedings of the 11th Annual IEEE Conference on Computational Complexity, 1996, pp. 44-58.
22. N. NISAN AND A. TA-SHMA, Extracting randomness: A survey and new constructions, J. Comput. System Sci., 58 (1999), pp. 148-173.
23. N. NISAN AND D. ZUCKERMAN, Randomness is linear in space, J. Comput. System Sci., 52 (1996), pp. 43-52.
24. J. RADHAKRISHNAN AND A. TA-SHMA, Bounds for dispersers, extractors, and depth-two superconcentrators, SIAM J. Discrete Math., 13 (2000), pp. 2-24.
25. R. RAZ, Extractors with weak random seeds, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 11-20.
26. R. RAZ, O. REINGOLD, AND S. VADHAN, Extracting all the randomness and reducing the error in Trevisan's extractors, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 149-158.
27. O. REINGOLD, R. SHALTIEL, AND A. WIGDERSON, Extracting randomness via repeated condensing, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 149-158.
28. R. RIVEST, All-or-nothing encryption and the package transform, in Fast Software Encryption, 4th International Workshop, FSE'97, Lecture Notes in Comput. Sci. 1267, Springer-Verlag, Berlin, 1997, pp. 210-218.
29. M. SANTHA AND U. V. VAZIRANI, Generating quasi-random sequences from semi-random sources, J. Comput. System Sci., 33 (1986), pp. 75-87.
30. R. SHALTIEL, Recent developments in explicit constructions of extractors, Bull. Eur. Assoc. Theor. Comput. Sci. 77 (2002), pp. 67-95.
31. L. TREVISAN AND S. VADHAN, Extracting randomness from samplable distributions, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 32-42.
32. S. VADHAN, Randomness extractors and their many guises, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 9-12.
33. S. VADHAN, Constructing locally computable extractors and cryptosystems in the boundedstorage model, J. Cryptology, 17 (2004), pp. 43-77.
34. U. VAZIRANI, Efficient considerations in using semi-random sources, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 160-168.
35. U. VAZIRANI, Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources, Combinatorica, 7 (1987), pp. 375-392.
36. U. V. VAZIRANI AND V. V. VAZIRANI, Random polynomial time is equal to semi-random polynomial time, in Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 417-428.
37. J. VON NEUMANN, Various techniques used in connection with random digits, NBS Appl. Math Ser., 12 (1951), pp. 36-38.
38. D. ZUCKERMAN, General weak random sources, in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 534-543.
39. D. ZUCKERMAN, Simulating BPP using a general weak random source, Algorithmica, 16 (1996), pp. 367-391.