MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Sampling under adverse conditions

Download:
Download as a PDF | Download as a PS
by Marius Zimand
ftp://136.160.177.125/pub/sample-adv.ps
Add To MetaCart

Abstract:

It is shown that a good estimation of the mean value of a boolean function f dened on f0; 1g m can be obtained by choosing a number of sample points D that is polynomial in m even if the boolean function is chosen by a malicious adversary that knows the sample points, provided that f is computable by a circuit of size at most D

Citations

506 How to construct random functions – Goldreich, Micali, et al. - 1986
490 Construction of Pseudorandom Generator from any One-Way Function", manuscript – Hastad, Impagliazzo, et al. - 1993
242 A Hard-Core Predicate for all One-Way Functions – Goldreich, Levin - 1989
58 On extracting randomness from weak random sources – Ta-Shma - 1996
49 Extracting randomness: How and why: A survey – Nisan - 1996
39 A sample of samplers - a computational perspective on sampling (survey – Goldreich - 1997
38 Randomness-optimal oblivious sampling. Random Structures and Algorithms – Zuckerman - 1997
26 Constructions of Near-Optimal Extractors Using Pseudo-Random Generators – Trevisan - 1998
18 Very strong one-way functions and pseudo-random generators exist relative to a random oracle – Impagliazzo - 1999
7 Extracting all the randomness from a weakly random source – Vadhan - 1998
5 How to privatize random bits – Zimand - 1996
2 Sampling under adverse conditions with applications to distributed computing – Zimand - 1999
View or Download | Add to My Collection | Correct Errors