Santha-Vazirani sources, deterministic condensers and very strong extractors

07/08/2019
by   Dmitry Gavinsky, et al.
0

The notion of semi-random sources, also known as Santha-Vazirani (SV) sources, stands for a sequence of n bits, where the dependence of the i'th bit on the previous i-1 bits is limited for every i∈[n]. If the dependence of the i'th bit on the remaining n-1 bits is limited, then this is a strong SV-source. Even the strong SV-sources are known not to admit (universal) deterministic extractors, but they have seeded extractors, as their min-entropy is Ω(n). It is intuitively obvious that strong SV-sources are more than just high-min-entropy sources, and this work explores the intuition. Deterministic condensers are known not to exist for general high-min-entropy sources, and we construct for any constants ϵ, δ∈ (0,1) a deterministic condenser that maps n bits coming from a strong SV-source with bias at most δ to Ω(n) bits of min-entropy rate at least 1-ϵ. In conclusion we observe that deterministic condensers are closely related to very strong extractors - a proposed strengthening of the notion of strong (seeded) extractors: in particular, our constructions can be viewed as very strong extractors for the family of strong Santha-Vazirani distributions. The notion of very strong extractors requires that the output remains unpredictable even to someone who knows not only the seed value (as in the case of strong extractors), but also the extractor's outputs corresponding to the same input value with each of the preceding seed values (say, under the lexicographic ordering). Very strong extractors closely resemble the original notion of SV-sources, except that the bits must satisfy the unpredictability requirement only on average.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2023

Extractors for Polynomial Sources over 𝔽_2

We explicitly construct the first nontrivial extractors for degree d ≥ 2...
research
04/11/2023

Optimizing Linear Correctors: A Tight Output Min-Entropy Bound and Selection Technique

Post-processing of the raw bits produced by a true random number generat...
research
04/15/2022

Random Access in Distributed Source Coding

The lossless compression of a single source X^n was recently shown to be...
research
06/29/2023

Extracting Mergers and Projections of Partitions

We study the problem of extracting randomness from somewhere-random sour...
research
05/20/2023

Low-Entropy Latent Variables Hurt Out-of-Distribution Performance

We study the relationship between the entropy of intermediate representa...
research
01/10/2018

An Entropy Lower Bound for Non-Malleable Extractors

A (k,ε)-non-malleable extractor is a function nmExt : {0,1}^n ×{0,1}^d ...
research
05/28/2019

Average Bias and Polynomial Sources

We identify a new notion of pseudorandomness for randomness sources, whi...

Please sign up or login with your details

Forgot password? Click here to reset