Improved Constructions of Two-Source Extractors
نویسنده
چکیده
In a recent breakthrough [CZ15], Chattopadhyay and Zuckerman gave an explicit two-source extractor for min-entropy k ≥ log n for some large enough constant C. However, their extractor only outputs one bit. In this paper, we improve the output of the two-source extractor to k, while the error remains n−Ω(1). Our improvement is obtained by giving a better extractor for (q, t, γ) non-oblivious bit-fixing sources, which can output t bits instead of one bit as in [CZ15].
منابع مشابه
Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications
We study the problem of constructing multi-source extractors in the quantum setting, which extract almost uniform random bits against an adversary who collects quantum side information from several initially independent classical random sources. This is a natural generalization of the two much studied problems of seeded randomness extraction against quantum side information, and classical indep...
متن کاملNon-Malleable Extractors - New Tools and Improved Constructions
A non-malleable extractor is a seeded extractor with a very strong guarantee – the output of a non-malleable extractor obtained using a typical seed is close to uniform even conditioned on the output obtained using any other seed. The first contribution of this paper consists of two new and improved constructions of non-malleable extractors: We construct a non-malleable extractor with seed-leng...
متن کاملError Reduction in Extractors
We present a general method to reduce the error of any extractor. Our method works particularly well in the case that the original extractor extracts up to a constant fraction of the source min-entropy and achieves a polynomially small error. In that case, we are able to reduce the error to (almost) any ε, using only O(log(1/ε)) additional truly random bits (while keeping the other parameters o...
متن کاملExtracting Randomness: A Survey and New Constructions
Extractors are Boolean functions that allow, in some precise sense, extraction of randomness from somewhat random distributions, using only a small amount of truly random bits. Extractors, and the closely related ``dispersers,'' exhibit some of the most ``random-like'' properties of explicitly constructed combinatorial structures. In this paper we do two things. First, we survey extractors and ...
متن کاملBetter short-seed extractors against quantum knowledge
We construct a strong extractor against quantum storage that works for every min-entropy k, has logarithmic seed length, and outputs Ω(k) bits, provided that the quantum adversary has at most βk qubits of memory, for any β < 12 . Previous constructions required poly-logarithmic seed length to output such a fraction of the entropy and, in addition, required super-logarithmic seed length for smal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 22 شماره
صفحات -
تاریخ انتشار 2015