New lower bounds for parallel computation
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Some consequences of the existence of pseudorandom generators
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On generating solved instances of computational problems
CRYPTO '88 Proceedings on Advances in cryptology
Computational Politics: Electoral Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
We define the class of trapdoor pseudo-random number generators, and introduce a new technique for using these in cryptography. As an application for this technique, we present a provably secure protocol for One-Bit Disclosures i.e. for giving a one-bit ...