# Introduction

Chapter

First Online:

- 436 Downloads

## Abstract

This monograph is concerned with the explicit construction of deterministic extractors and related objects. The current chapter gives an introduction to extractors and a sketch of the techniques and results of this work. We begin in Section 1.2 with what may be called the ‘classical motivation’ for extractors. Section 1.3 describes other motivations for deterministic extractors. In Section 1.4 we describe some of the main techniques used in this book. The subsequent chapters describe our results in detail. Each chapter is self-contained, perhaps with the exception of some basic background given in this introductory chapter. For a concise statement of all results, see the summary in the preface.

## Keywords

Seed Length Random String Weak Randomness Introductory Chapter Composition Theorem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

- 3.B. Barak, R. Impagliazzo, and A. Wigderson. Extracting randomness using few independent sources.
*SIAM J. Comput*, 36(4):1095–1118, 2006.MathSciNetzbMATHCrossRefGoogle Scholar - 4.B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson. Simulating independence: New constructions of condensers, Ramsay graphs, dispersers, and extractors. In
*Proceedings of the 37th Annual ACM Symposium on Theory of Computing*, pages 1–10, 2005.Google Scholar - 5.B. Barak, A. Rao, R. Shaltiel, and A. Wigderson. 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl–Wilson construction. In
*Proceedings of the 38th Annual ACM Symposium on Theory of Computing*, pages 671–680, 2006.Google Scholar - 9.J. Bourgain. More on the sum-product phenomenon in prime fields and its applications.
*International Journal of Number Theory*, 1:1–32, 2005.MathSciNetzbMATHCrossRefGoogle Scholar - 11.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. Google Scholar - 12.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.Google Scholar - 14.B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity.
*SIAM Journal on Computing*, 17(2):230–261, April 1988. Special issue on cryptography.MathSciNetzbMATHCrossRefGoogle Scholar - 15.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*, pages 396–407, 1985.Google Scholar - 16.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*, pages 14–25, 1989.Google Scholar - 18.Y. Dodis.
*Exposure-Resilient Cryptography*. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, August 2000.Google Scholar - 19.Y. Dodis, A. Elbaz, R. Oliveira, and R. Raz. Improved randomness extraction from two independent sources. In
*RANDOM: International Workshop on Randomization and Approximation Techniques in Computer Science*, pages 334–344, 2004.Google Scholar - 20.Y. Dodis, A. Sahai, and A. Smith. On perfect and adaptive security in exposure-resilient cryptography.
*Lecture Notes in Computer Science*, 2045, 2001.Google Scholar - 25.A. Gabizon and R. Raz. Deterministic extractors for affine sources over large fields. In
*Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science*, pages 407–418, 2005.Google Scholar - 26.A.Gabizon, R. Raz, and R. Shaltiel. Deterministic extractors for bit-fixing sources by obtaining an independent seed.
*SICOMP: SIAM Journal on Computing*, 36(4):1072–1094, 2006.MathSciNetzbMATHCrossRefGoogle Scholar - 27.A. Gabizon and R. Shaltiel. Increasing the output length of zero-error dispersers. In
*APPROX-RANDOM*, pages 430–443, 2008. Google Scholar - 37.J. Kamp and D. Zuckerman. Deterministic extractors for bit-fixing sources and exposure-resilient cryptography.
*SIAM J. Comput*, 36(5):1231–1247, 2007.MathSciNetCrossRefGoogle Scholar - 46.N. Nisan and A. Ta-Shma. Extracting randomness: A survey and new constructions.
*Journal of Computer and System Sciences*, 58, 1999.Google Scholar - 50.A. Rao. Extractors for a constant number of polynomially small min-entropy independent sources. In
*Proceedings of the 38th Annual ACM Symposium on Theory of Computing*, pages 497–506, 2006.Google Scholar - 53.R. Raz. Extractors with weak random seeds. In
*Proceedings of the 37th Annual ACM Symposium on Theory of Computing*, pages 11–20, 2005.Google Scholar - 57.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.Google Scholar - 58.M. Santha and U. V. Vazirani. Generating quasi-random sequences from semi-random sources.
*Journal of Computer and System Sciences*, 33:75–87, 1986.MathSciNetzbMATHCrossRefGoogle Scholar - 62.R. Shaltiel. Recent developments in explicit constructions of extractors.
*Bulletin of the EATCS*, 77:67–95, 2002.MathSciNetzbMATHGoogle Scholar - 63.R. Shaltiel. How to get more mileage from randomness extractors. In
*CCC ’06: Proceedings of the 21st Annual IEEE Conference on Computational Complexity*, pages 46–60, 2006.Google Scholar - 67.L. Trevisan and S. Vadhan. Extracting randomness from samplable distributions. In
*Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science*, 2000a.Google Scholar - 71.J. von Neumann. Various techniques used in connection with random digits.
*Applied Math Series*, 12:36–38, 1951.Google Scholar - 74.M. Prabhakaran Y. Dodis, S. J. Ong and A. Sahai. On the (im)possibility of cryptography with imperfect randomness. In
*FOCS 2004*, 2004.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 2011