Some consequences of the existence of pseudorandom generators
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Immunity and pseudorandomness of context-free languages
Theoretical Computer Science
Collapsing recursive oracles for relativized polynomial hierarchies
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On Approximating Non-regular Languages by Regular Languages
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
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 ...