Average case complete problems
SIAM Journal on Computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Random instances of a graph coloring problem are hard
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the theory of average case complexity
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
Journal of Computer and System Sciences
The little book of big primes
Proof or recursive unsolvability of Hilbert's tenth problem
American Mathematical Monthly
Number-theoretic aspects of computational complexity.
Number-theoretic aspects of computational complexity.
Using average case intractability in cryptography
AIC'04 Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications
A secret sharing scheme using matrices
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
| Hi-index | 0.00 |