Proceedings ArticleDOI
Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources
Umesh Vazirani
- pp 366-378
TLDR
Santha and Vazirani as discussed by the authors consider a general model for imperfect sources of randomness: the slightly random source, which is a black-box model for randomness.Abstract:
Several computational applications, such as randomizing algorithms [Ra], stochastic simulation [SC, KG] and cryptographic protocols [B11, GM, W] assume a fast source of unbiased, independent coin flips. Unfortunately, the available physical sources of randomness, such as noise diodes and geiger counters are at best imperfect [Mu]. Santha and Vazirani [SV] consider a very general model for such imperfect sources of randomness: the slightly random source. A slightly random source is a black boxread 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.
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.
Proceedings ArticleDOI
The bit extraction problem or t-resilient functions
TL;DR: The question addressed is for what values of n, m and t does the adversary necessarily fail in biasing the outcome of f :{0,1}n → {0, 1}m, when being restricted to set t of the input bits of f.
Journal ArticleDOI
Pseudorandom generators without the XOR lemma
TL;DR: The main result of Impagliazzo and Wigderson as discussed by the authors is that if there exists a decision problem solvable in time 2/sup O(n)/ and having circuit complexity 2 /sup /spl Omega/(n)/ (for all but finitely many n) then P=BPP.
Posted Content
Quantum vs. Classical Communication and Computation
TL;DR: In this paper, a simple and general simulation technique that transforms any black-box quantum algorithm (a la Grover's database search algorithm) to a quantum communication protocol for a related problem, in a way that fully exploits the quantum parallelism is presented.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Proceedings ArticleDOI
Some complexity questions related to distributive computing(Preliminary Report)
TL;DR: The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm.
Proceedings ArticleDOI
Probabilistic encryption & how to play mental poker keeping secret all partial information
Shafi Goldwasser,Silvio Micali +1 more
TL;DR: This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the clear-text.
Book ChapterDOI
Probabilistic encryption & how to play mental poker keeping secret all partial information
Shafi Goldwasser,Silvio Micali +1 more
TL;DR: In this article, the authors proposed an encryption scheme that is secure from an adversary who knows the encryption algorithm and is given the cyphertext, but cannot obtain any information about the clear-text.
Related Papers (5)
Unbiased bits from sources of weak randomness and probabilistic communication complexity
Benny Chor,Oded Goldreich +1 more