Construction of extractors using pseudo-random generators (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On Quantum Computation with Some Restricted Amplitudes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the Impossibility of Private Key Cryptography with Weakly Random Keys
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
A Randomnesss-Rounds Tradeoff in Private Computation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Does privacy require true randomness?
TCC'07 Proceedings of the 4th conference on Theory of cryptography
On the security of pseudorandomized information-theoretically secure schemes
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Deterministic extractors for small-space sources
Journal of Computer and System Sciences
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On the impossibility of extracting classical randomness using a quantum computer
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Separating sources for encryption and secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
Random Polynomial Time (Rp) is currently considered to be the class of tractable computational problems. Here one assumes a source of truly random bits. However, the known sources of randomness are imperfect. They can be modeled as an adversary source, called slightly-random source. Slightlyrandom Polynomial Time (SRp) is the class of problems solvable in polynomial time using such a source. SRp is thus a more realistic definition of a tractable computational problem. In this paper we give an affirmative answer to the question "is Rp = SRp?" Our proof method is constructive: given an Rp algorithm for a problem, we show how to obtain an SRp algorithm for it. Studying the relationship between randomized and deterministic computation is currently an important issue. A central question here is "is Rp = P?" Our result may be a step towards answering this question.