41 search results - page 1 / 9» On extracting common random bits from correlated sources |

CORR

2010

Springer

13 years 5 months ago
2010

Springer

Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of ran...

ECCC

1998

13 years 8 months ago
1998

In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction ...

COCO

2006

Springer

14 years 23 days ago
2006

Springer

Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...

FOCS

2009

IEEE

14 years 3 months ago
2009

IEEE

Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy ampliﬁcation to the case of two cor...

ECCC

2011

13 years 4 months ago
2011

We consider the problem of extracting randomness from sources that are eﬃciently samplable, in the sense that each output bit of the sampler only depends on some small number d ...