One-way functions and Pseudorandom generators
Combinatorica - Theory of Computing
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Pseudo-random generators under uniform assumptions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Adi Shamir: On the Universality of the Next Bit Test
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
On the existence of pseudorandom generators
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Most security results can be established both in the non-uniform and the uniform model of computation. Nonetheless, non-uniform results are often much easier to obtain than their uniform version. In this paper we initiate a general framework in which the classical sampling technique can be applied to obtain uniform results. Our main theorem gives sufficient conditions under which a non-uniform result can be extended to a uniform one. As a consequence, we derive the uniform version of Schrift and Shamir's generalization of Yao's theorem on the universality of the next-bit test.