Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
Two lower bounds for branching programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Efficiency considerations in using semi-random sources
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Combinatorica - Theory of Computing
Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Simulating BPP using a general weak random source
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Journal of Computer and System Sciences
Privacy Amplification Secure Against Active Adversaries
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Randomization and Derandomization in Space-Bounded Computation
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Extracting randomness via repeated condensing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Extracting randomness from samplable distributions
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Exposure-resilient cryptography
Exposure-resilient cryptography
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Extracting Randomness Using Few Independent Sources
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Extractors with weak random seeds
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Independent Unbiased Coin Flips From A Correlated Biased Source: A Finite State Markov Chain
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Dispersers, deterministic amplification, and weak random sources
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Extracting randomness from multiple independent sources
IEEE Transactions on Information Theory
Deterministic extractors for small-space sources
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Invertible extractors and wiretap protocols
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
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
Deterministic extractors for independent-symbol sources
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Randomness condensers for efficiently samplable, seed-dependent sources
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Hi-index | 0.06 |
Extracting essentially uniform randomness from a somewhat random source X is a crucial operation in various applications, in particular in cryptography where an adversary usually possesses some partial information about X. In this paper we formalize and study the most general form of extracting randomness in such a cryptographic setting. Our notion of strong extractors captures in particular the case where the catalyst randomness is neither uniform nor independent of the actual extractor input. This is for example important for privacy amplification, where a uniform cryptographic key is generated by Alice and Bob sharing some partially secret information X by exchanging a catalyst R over an insecure channel accessible to an adversary Eve. Here the authentication information for R creates, from Eve's viewpoint, a dependence between X and R. We provide explicit constructions for this setting based on strong blenders. In addition, we give strong deterministic randomness extractors for lists of random variables, where only an unknown subset of the variables is required to have some amount of min-entropy.