Communications of the ACM
How to construct random functions
Journal of the ACM (JACM)
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
When won't membership queries help?
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Cryptographic hardness of distribution-specific learning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient noise-tolerant learning from statistical queries
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
SFCS '88 Proceedings of the 29th 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
No better ways to generate hard NP instances than picking uniformly at random
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds
Computational Complexity
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
HB-MP: A further step in the HB-family of lightweight authentication protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
How to Encrypt with the LPN Problem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
| Hi-index | 0.00 |