Extracting randomness from multiple independent sources

Authors:
C. -J. Lee;C. -J. Lu;S. -C. Tsai;W. -G. Tzeng
Affiliations:
Dept. of Comput. Sci. & Inf. Eng., Nat. Chiao-Tung Univ., Hsinchu, Taiwan;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 4

Extracting Computational Entropy and Learning Noisy Linear Functions

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Deterministic extractors for independent-symbol sources

IEEE Transactions on Information Theory
Deterministic extractors for independent-symbol sources

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Generalized strong extractors and deterministic privacy amplification

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding

Quantified Score

Hi-index	754.90

Visualization

Abstract

We study the problem of deterministically extracting almost perfect random bits from multiple weakly random sources that are mutually independent. With two independent sources, we have an explicit extractor which can extract a number of random bits that matches the best construction currently known, via the generalized leftover hash lemma. We also extend our construction to extract randomness from more independent sources. One nice feature is that the extractor still works even with all but one source exposed. Finally, we apply our extractor for a cryptographic task in which a group of parties wants to agree on a secret key for group communication over an insecure channel, without using ideal local randomness.