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

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 394-403

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

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-FIXING SOURCES; DETERMINISTIC EXTRACTORS; RANDOM BITS; SOURCE EXTRACTOR;

ALGORITHMS; BIT ERROR RATE; COMBINATORIAL CIRCUITS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; STATISTICAL METHODS; THEOREM PROVING;

RANDOM PROCESSES;

EID: 17744384984     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple constructions of almost k-wise independent random variables. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, volume II, pages 544-553, 1990.
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.
3. M. Bellare and J. Rompel. Randomness-efficient oblivious sampling. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994.
4. 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, pages 425-433, 1984.
5. V. Boyko. On the security properties of OAEP as an all-or-nothing transform. In Proc. 19th International Advances in Cryptology Conference - CRYPTO '99, pages 503-518, 1999.
6. R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz, and A. Sahai. Exposure-resilient functions and all-or-nothing transforms. Lecture Notes in Computer Science, 1807, 2000.
7. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing, 17(2):230-261, Apr. 1988. Special issue on cryptography.
8. 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.
9. 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.
10. Y. Dodis. Exposure-Resilient Cryptography. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, Aug. 2000.
11. Y. Dodis, A. Sahai, and A. Smith. On perfect and adaptive security in exposure-resilient cryptography. Lecture Notes in Computer Science, 2045, 2001.
12. S. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velickovic. Efficient approximation of product distributions. RSA: Random Structures & Algorithms, 13, 1998.
13. J. Kamp and D. Zuckerman. Deterministic extractors for bitfixing sources and exposure-resilient cryptography. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
14. R. Lipton and N. Vishnoi. Manuscript. 2004.
15. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 213-223, 1990.
16. N. Nisan. Extracting randomness: How and why: A survey. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pages 44-58, 1996.
17. N. Nisan and A. Ta-Shma. Extracting randomness: A survey and new constructions. Journal of Computer and System Sciences, 58, 1999.
18. N. Nisan and D. Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43-52, 1996.
19. J. Radhakrishnan and A. Ta-Shma. Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics, 13(1):2-24, Feb. 2000.
20. 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, pages 149-158, 1999.
21. 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.
22. R. Rivest. All-or-nothing encryption and the package transform. In Fast software encryption: 4th International Workshop, FSE, volume 1267 of Lecture Notes in Computer Science, 1997.
23. M. Santha and U. V. Vazirani. Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences, 33:75-87, 1986.
24. R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the EATCS, 77:67-95, 2002.
25. L. Trevisan and S. Vadhan. Extracting randomness from samplable distributions. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000.
26. S. Vadhan. Randomness extractors and their many guises. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 9-12, 2002.
27. U. Vazirani. Efficient considerations in using semi-random sources. In Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, 1987.
28. U. Vazirani. Strong communication complexity or generating quasi-random sequences from two communicating semirandom sources. Combinatorica, 7:375-392, 1987.
29. U. Vazirani and V. Vazirani. Random polynomial time is equal to semi-random polynomial time. Technical Report TR88-959, Cornell University, Computer Science Department, Dec. 1988.
30. J. von Neumann. Various techniques used in connection with random digits. Applied Math Series, 12:36-38, 1951.
31. D. Zuckerman. General weak random sources. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 534-543, 1990.
32. D. Zuckerman. Simulating BPP using a general weak random source. Algorithmica, 16(4/5):367-391, Oct./Nov. 1996.