Deterministic Extractors for Affine Sources over Large Fields
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Extracting Computational Entropy and Learning Noisy Linear Functions
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Extractors Using Hardness Amplification
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors
Journal of the ACM (JACM)
Simpler constant-seed condensers
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Two-source extractors secure against quantum adversaries
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Deterministic extractors for independent-symbol sources
IEEE Transactions on Information Theory
Computational randomness from generalized hardcore sets
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
On the error parameter of dispersers
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Deterministic extractors for independent-symbol sources
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Distributed computing with imperfect randomness
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Generalized strong extractors and deterministic privacy amplification
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
| Hi-index | 0.06 |
The following model for a weak random source is considered. The source is asked only once for R bits, and the source outputs an R-bit string such that no string has probability more than 2/sup - delta R/ of being output. for some fixed delta 0. A pseudorandom generator that runs in time n/sup O(log n)/ and simulates RP using as a seed a string from such a source is exhibited. Under the generalized Paley graph conjecture, a generator that runs in polynomial time and simulates RP is given, as well as a different generator that produces almost perfectly random bits at a rate arbitrarily close to optimal using as seeds strings from a constant number of independent weak random sources.