321 search results - page 5 / 65 » Randomness extractors -- applications and constructions |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We study deterministic extractors for bit-fixing sources (a.k.a. resilient functions) and exposure-resilient functions for small min-entropy. That is, of the n bits given as input...
ECCC
2011
13 years 3 months ago
2011
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
CORR
2011
Springer
13 years 6 days ago
2011
Springer
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...