Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing

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): “We model the adversary by an interactive procedure (communicating Turing machine).”
The PCP theorem by gap amplification (2006, unknown): “To get an error-probability of 12 one can apply the expander-neighborhood sampler of [19] (see also [16, Section C.”
Recent Developments in Explicit Constructions of Extractors (2002, methodology): “Reference min-entropy threshold seed length output length [ILL89] any k d = O(n) m = k +d O(1) [NZ96] k = ( d = O(log2n) m = ( [ GW97 ] k > n=2 d = O(n k) m = k +d O(1) [SZ99] any k d = O(k + logn) m = k +d O(1) [SZ99] k n1=2+ d = O(log2n) m = k(1)”