Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Deterministic Extractors for Affine Sources over Large Fields
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Extractors for a constant number of polynomially small min-entropy independent sources
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Deterministic extractors for small-space sources
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
Computational Complexity
Extracting Computational Entropy and Learning Noisy Linear Functions
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
How many oblivious transfers are needed for secure multiparty computation?
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Achieving leakage resilience through dual system encryption
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the impossibility of extracting classical randomness using a quantum computer
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Deterministic extractors for independent-symbol sources
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Public-Key encryption in the bounded-retrieval model
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
The Twist-AUgmented technique for key exchange
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Our data, ourselves: privacy via distributed noise generation
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Generalized strong extractors and deterministic privacy amplification
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Separating sources for encryption and secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
We give an efficient deterministic algorithm which extracts \Omega (n^{2\gamma } ) almost-random bits from sources where n^{\frac{1}{2} + \gamma } of the n bits are uniformly random and the rest are fixed in advance. This improves on previous constructions which required that at least n/2 of the bits be random. Our construction also gives explicit adaptive exposure-resilient functions and in turn adaptive all-or-nothing transforms. For sources where instead of bits the values are chosen from [d], for d 2, we give an algorithm which extracts a constant fraction of the randomness. We also give bounds on extracting randomness for sources where the fixed bits can depend on the random bits..