Computing with very weak random sources

By Aravind Srinivasan, David Zuckerman. 1994

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

On the Difficulties of Disclosure Prevention in Statistical Databases or The Case for Differential Privacy (2010, methodology): “The seed length is O(n), and we can even use logarithmic-sized seeds using almost pairwise independence [23, 32].”
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes (2007, methodology): “It is obtained by combining our condenser with the ideas from the early constructions of extractors [Zuckerman 1996, 1997; Nisan and Zuckerman 1996; Srinivasan and Zuckerman 1999; Goldreich and Wigderson 1997].”
Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing (1997, methodology): “The only previousresult achieving such a quality-size trade-o is by Nisan and Zuckerman [29].”
Recent Developments in Explicit Constructions of Extractors (2002, methodology): “family. It follows from [ILL89] that the function Ext(x;y) = y hy(x) is an (m + 2 log(1= ); )extractor for every > 0. Exact details can be found (for example) in [ SZ99 ].”
Extractors and pseudorandom generators (2001, methodology): “Constructions of expanders via constructions of extractors and the Wigderson-Zuckerman connection appeared in [Nisan and Zuckerman 1993; Srinivasan and Zuckerman 1994; Ta-Shma 1996], among others.”
Leftover Hashing Against Quantum Side Information (2010, methodology): “Proof: As in the classical approach of [29], we concatenate two hash functions using Lemma 8 with some clever choice of the parameters.”