Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources

@article{Beigi2014DeterministicRE,
  title={Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources},
  author={Salman Beigi and Omid Etesami and Amin Gohari},
  journal={SIAM J. Comput.},
  year={2014},
  volume={46},
  pages={1-36}
}
A Santha-Vazirani (SV) source is a sequence of random bits where the conditional distribution of each bit, given the previous bits, can be partially controlled by an adversary. Santha and Vazirani show that deterministic randomness extraction from these sources is impossible. In this paper, we study the generalization of SV sources for non-binary sequences. We show that unlike the binary case, deterministic randomness extraction in the generalized case is sometimes possible. We present a… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 31 references

On sequences of pairs of dependent random variables,

H. S. Witsenhausen
SIAM Journal on Applied Mathematics, • 1975
View 11 Excerpts
Highly Influenced

U

M. Santha
Vazirani, “Generating Quasi-Random Sequences from Slightly- Random Sources,” Proceedings of Symposium on the Foundations of Computer Science, 1984, Journal of Computer and System Sciences, Vol. 33, I. 1 • 1986
View 7 Excerpts
Highly Influenced

V

U. V. Vazirani
V. Vazirani, “Sampling a population with a single semi-random source,” Proc. 6th FST & TCS Conf. • 1986
View 5 Excerpts
Highly Influenced

Random polynomial time is equal to slightly-random polynomial time

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) • 1985
View 5 Excerpts
Highly Influenced

and K

P. Austrin, K. Chung, M. Mahmoody, R. Pass
Seth, “On the impossibility of cryptography with tamperable randomness,” in Advances in Cryptology (CRYPTO) • 2014
View 1 Excerpt

Extractors for varieties

computational complexity • 2009
View 1 Excerpt

C

H. Palaiyanur
Chang and A. Sahai, “Lossy compression of active sources,” IEEE International Symposium on Information Theory, pp. 1977 - 1981 • 2008
View 1 Excerpt

Lossy compression of active sources

2008 IEEE International Symposium on Information Theory • 2008

Similar Papers

Loading similar papers…