Randomness-optimal oblivious sampling

We present the first efficient oblivious sampler that uses an optimal number of random bits, up to an arbitrary constant factor bigger than 1. Specifically, for any α > 0, it uses (1 +α)(m+ log γ−1) random bits to output d = poly( −1, log γ−1,m) sample points z1, . . . , zd ∈ {0, 1} such that for any function f : {0, 1} → [0, 1], Pr [ ∣∣∣ 1 d ∑di=1f(zi)−Ef ∣∣∣ ≤ ] ≥ 1− γ. Our proof is based on an improved extractor construction. An extractor is a procedure which takes as input the output of a defective random source and a small number of truly random bits, and outputs a nearly-random string. We present the first optimal extractor, up to constant factors, for defective random sources with constant entropy rate. We give applications to constructive leader election and reducing randomness in interactive proofs.

[1]  Avi Wigderson,et al.  Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1993, Comb..

[2]  Silvio Micali,et al.  An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..

[3]  Noam Nisan,et al.  Extracting randomness: how and why. A survey , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[4]  Noam Nisan,et al.  Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..

[5]  Aravind Srinivasan,et al.  Explicit dispersers with polylog degree , 1995, STOC '95.

[6]  Ran Canetti,et al.  Lower Bounds for Sampling Algorithms for Estimating the Average , 1995, Inf. Process. Lett..

[7]  Nathan Linial,et al.  Fast perfect-information leader-election protocols with linear immunity , 1993, Comb..

[8]  Amnon Ta-Shma,et al.  On Extracting Randomness From Weak Random Sources , 1995, Electron. Colloquium Comput. Complex..

[9]  Aravind Srinivasan,et al.  Computing with very weak random sources , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  Mihir Bellare,et al.  Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[11]  Rafail Ostrovsky,et al.  Simple and efficient leader election in the full information model , 1994, STOC '94.

[12]  Avi Wigderson,et al.  Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing , 1997, Electron. Colloquium Comput. Complex..

[13]  David Gillman,et al.  A Chernoff bound for random walks on expander graphs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[14]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[15]  David Zuckerman,et al.  Simulating BPP using a general weak random source , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[16]  David Zuckerman,et al.  General weak random sources , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[17]  Mihir Bellare,et al.  Randomness in interactive proofs , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[18]  Noga Alon,et al.  Coin-flipping games immune against linear-sized coalitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[19]  Avi Wigderson,et al.  Dispersers, deterministic amplification, and weak random sources , 1989, 30th Annual Symposium on Foundations of Computer Science.

[20]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[21]  Michael E. Saks A Robust Noncryptographic Protocol for Collective Coin Flipping , 1989, SIAM J. Discret. Math..

[22]  Silvio Micali,et al.  Optimal algorithms for Byzantine agreement , 1988, STOC '88.

[23]  János Komlós,et al.  Deterministic simulation in LOGSPACE , 1987, STOC.

[24]  Miklos Santha,et al.  Generating Quasi-random Sequences from Semi-random Sources , 1986, J. Comput. Syst. Sci..

[25]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[26]  Oded Goldreich,et al.  Unbiased bits from sources of weak randomness and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[27]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[28]  Manuel Blum,et al.  Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1984, Comb..

[29]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..