Abstract
In this paper, we consider the task of deterministically extracting randomness from sources consisting of a sequence of n independent symbols from {0,1}d. The only randomness guarantee on such a source is that the whole source has min-entropy k. We give an explicit deterministic extractor which can extract Ω(logk – logd – loglog(1/ε)) bits with error ε, for any n,d,k ∈ ℕ and ε∈(0,1). For sources with a larger min-entropy, we can extract even more randomness. When k≥n 1/2 + γ, for any constant γ∈(0,1/2), we can extract m=k–O(d log(1/ε)) bits with any error \(\varepsilon \ge 2^{-\Omega(n^{\gamma})}\). When k≥logc n, for some constant c>0, we can extract m=k–d (1/ε)O(1) bits with any error ε≥k − − Ω(1). Our results generalize those of Kamp & Zuckerman and Gabizon et al. which only work for bit-fixing sources (with d=1 and each bit of the source being either fixed or perfectly random). Moreover, we show the existence of a non-explicit deterministic extractor which can extract m=k–O(log(1/ε)) bits whenever k=ω(d+log(n/ε)). Finally, we show that even to extract from bit-fixing sources, any extractor, seeded or not, must suffer an entropy loss k–m = Ω(log(1/ε)). This generalizes a lower bound of Radhakrishnan & Ta-Shma with respect to general sources.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Goldreich, O.: Simple constructions of almost k-wise independent random variables. In: FOCS 1990, pp. 544–553 (1990)
Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567–583 (1986)
Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. In: FOCS 2004, pp. 384–393 (2004)
Barak, B., Kindler, G., Shaltiel, R., Sudakov, B., Wigderson, A.: Simulating Independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors. In: STOC 2005, pp. 1–10 (2005)
Bourgain, J.: More on the sum-product phenomenon in prime fields and its applications. International Journal of Number Theory 1(1), 1–32 (2005)
Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17(2), 230–261 (1988)
Chor, B., Goldreich, O., Håstad, J., Friedman, J., Rudich, S., Smolensky, R.: The bit extraction problem of t-resilient functions. In: FOCS 1985, pp. 396–407 (1985)
Dodis, Y., Elbaz, A., Oliveira, R., Raz, R.: Improved randomness extraction from two independent sources. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 334–344. Springer, Heidelberg (2004)
Gabizon, A., Raz, R., Shaltiel, R.: Deterministic extractors for bit-fixing sources by obtaining an independent seed. FOCS 2004, 394–403 (2004)
Impagliazzo, R., Shaltiel, R., Wigderson, A.: Extractors and pseudo-random generators with optimal seed length. In: STOC 2000, pp. 1–10 (2000)
Jukna, S.: Extremal Combinatorics. Springer, Heidelberg (2001)
Kamp, J., Rao, A., Vahan, S., Zuckerman, D.: Deterministic extractors for small-space sources. In: STOC 2006 (2006)
Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. In: FOCS 2003, pp. 92–101 (2003)
König, R., Maurer, U.: Generalized strong extractors and deterministic privacy amplification. In: Proc. Cryptography and Coding, pp. 322–339 (2005)
Lee, C.-J., Lu, C.-J., Tsai, S.-C., Tzeng, W.-G.: Extracting randomness from multiple independent sources. IEEE Transactions on Information Theory 51(6), 2224–2227 (2005)
Lu, C.-J.: Encryption against storage-bounded adversaries from on-line strong extractors. J. Cryptology 17(1), 27–42 (2004)
Lu, C.-J., Reingold, O., Vadhan, S., Wigderson, A.: Extractors: Optimal up to constant factors. In: STOC 2003, pp. 602–611 (2003)
Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22(4), 838–856 (1993)
Nisan, N., Ta-Shma, A.: Extracting randomness: A survey and new constructions. J. Comput. Syst. Sci. 58(1), 148–173 (1999)
Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci. 52(1), 43–52 (1996)
Raz, R.: Extractors with weak random seeds. In: STOC 2005, pp. 11–20 (2005)
Raz, R., Reingold, O., Vadhan, S.: Extracting all the randomness and reducing the error in Trevisan’s extractors. In: STOC 1999, pp. 149–158 (1999)
Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discrete Math. 13(1), 2–24 (2000)
Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. In: FOCS 2000, pp. 12–14 (2000)
Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the European Association for Theoretical Computer Science 77, 67–95 (2002)
Shaltiel, R., Umans, C.: Simple extractors for all min-entropies and a new pseudo-random generator. In: FOCS 2001, pp. 648–657 (2001)
Ta-Shma, A., Umans, C., Zuckerman, D.: Loss-less condensers, unbalanced expanders, and extractors. In: STOC 2001, pp. 143–152 (2001)
Ta-Shma, A., Zuckerman, D.: Extractor codes. STOC 2001, pp. 193–199 (2001)
Trevisan, L.: Extractors and pseudorandom generators. JACM 48(4), 860–879 (2001)
Vadhan, S.: Constructing locally computable extractors and cryptosystems in the bounded-storage model. J. Cryptology 17(1), 43–77 (2004)
Wigderson, A., Zuckerman, D.: Expanders that beat the eigenvalue bound: Explicit construction and applications. Combinatorica 19(1), 125–138 (1999)
Zuckerman, D.: General weak random sources. In: FOCS 1990, pp. 534–543 (1990)
Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica 16(4/5), 367–391 (1996)
Zuckerman, D.: Randomness-optimal oblivious sampling. Random Structures and Algorithms 11, 345–367 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, CJ., Lu, CJ., Tsai, SC. (2006). Deterministic Extractors for Independent-Symbol Sources. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786986_9
Download citation
DOI: https://doi.org/10.1007/11786986_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35904-3
Online ISBN: 978-3-540-35905-0
eBook Packages: Computer ScienceComputer Science (R0)