Journal ArticleDOI
Unbiased bits from sources of weak randomness and probabilistic communication complexity
Benny Chor,Oded Goldreich +1 more
Reads0
Chats0
TLDR
A new model for weak random physical sources is presented that strictly generalizes previous models and provides a fruitful viewpoint on problems studied previously such as Extracting almost-perfect bits from sources of weak randomness.Abstract:
A new model for weak random physical sources is presented. The new model strictly generalizes previous models (e.g., the Santha and Vazirani model [27]). The sources considered output strings according to probability distributions in which no single string is too probable.The new model provides a fruitful viewpoint on problems studied previously such as: • Extracting almost-perfect bits from sources of weak randomness. The question of possibility as well as the question of efficiency of such extraction schemes are addressed. • Probabilistic communication complexity. It is shown that most functions have linear communication complexity in a very strong probabilistic sense. • Robustness of BPP with respect to sources of weak randomness (generalizing a result of Vazirani and Vazirani [32], [33]).read more
Citations
More filters
Journal ArticleDOI
A Pseudorandom Generator from any One-way Function
TL;DR: It is shown how to construct a pseudorandom generator from any one-way function, and it is shown that there is a Pseudorandom Generator if and only ifthere is a one- way function.
Journal ArticleDOI
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
TL;DR: In this article, the authors provide formal definitions and efficient secure techniques for turning noisy information into keys usable for any cryptographic application, and, in particular, reliably and securely authenticating biometric data.
Proceedings ArticleDOI
Pseudo-random generation from one-way functions
TL;DR: From one-way functions of type (1) or (2) it is shown how to construct pseudo-random generators secure against small circuits or fast algorithms, respectively, and vice-versa.
Journal ArticleDOI
Randomness is Linear in Space
Noam Nisan,David Zuckerman +1 more
TL;DR: In this article, it was shown that any randomized algorithm that runs in spaceSand timeT and uses poly(S) random bits can be simulated using only O(S ) random bits in space Sand timeT+poly(S).
Proceedings ArticleDOI
On the power of quantum computation
TL;DR: This work presents here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class.