Simple Direct Reduction of String (1,2)-OT to Rabin's OT without Privacy Amplification
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Increasing the Output Length of Zero-Error Dispersers
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Affine dispersers from subspace polynomials
Proceedings of the forty-first annual ACM symposium on Theory of computing
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors
Journal of the ACM (JACM)
Deterministic extractors for small-space sources
Journal of Computer and System Sciences
Deterministic extractors for independent-symbol sources
IEEE Transactions on Information Theory
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Extractors and lower bounds for locally samplable sources
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
Improving the Hadamard extractor
Theoretical Computer Science
Hi-index | 0.06 |
An $(n,k)$-bit-fixing source is a distribution $X$ over $\{0,1\}^n$ such that there is a subset of $k$ variables in $X_1,\ldots,X_n$ which are uniformly distributed and independent of each other, and the remaining $n-k$ variables are fixed. A deterministic bit-fixing source extractor is a function $E:\{0,1\}^n \rightarrow \{0,1\}^m$ which on an arbitrary $(n,k)$-bit-fixing source outputs $m$ bits that are statistically close to uniform. Recently, Kamp and Zuckerman [Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 92-101] gave a construction of a deterministic bit-fixing source extractor that extracts $\Omega(k^2/n)$ bits and requires $k\sqrt{n}$. In this paper we give constructions of deterministic bit-fixing source extractors that extract $(1-o(1))k$ bits whenever $k(\log n)^c$ for some universal constant $c0$. Thus, our constructions extract almost all the randomness from bit-fixing sources and work even when $k$ is small. For $k \gg \sqrt{n}$ the extracted bits have statistical distance $2^{-n^{\Omega(1)}}$ from uniform, and for $k \le \sqrt{n}$ the extracted bits have statistical distance $k^{-\Omega(1)}$ from uniform. Our technique gives a general method to transform deterministic bit-fixing source extractors that extract few bits into extractors which extract almost all the bits.