How to construct random functions
Journal of the ACM (JACM)
NP is as easy as detecting unique solutions
Theoretical Computer Science
Matching is as easy as matrix inversion
Combinatorica
Two remarks concerning the Goldwasser-Micali-Rivest signature scheme
Proceedings on Advances in cryptology---CRYPTO '86
How to generate factored random numbers
SIAM Journal on Computing - Special issue on cryptography
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
How to sign given any trapdoor function
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The Strength of Weak Learnability
Machine Learning
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Public-key cryptosystems provably secure against chosen ciphertext attacks
STOC '90 Proceedings of the twenty-second 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
CRYPTO '89 Proceedings on Advances in cryptology
On-line/off-line digital signatures
CRYPTO '89 Proceedings on Advances in cryptology
SIAM Journal on Computing
Elements of information theory
Elements of information theory
An improved boosting algorithm and its implications on learning complexity
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Cryptographic hardness of distribution-specific learning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
Cryptographic primitives based on hard learning problems
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the learnability of discrete distributions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
An Efficient Existentially Unforgeable Signature Scheme and its Applications
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Cryptography and Machine Learning
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Synthesizers and their application to the parallel construction of pseudo-random functions
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Private data release via learning thresholds
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
PAC learning axis-aligned mixtures of gaussians with no separation assumption
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Characterizing pseudoentropy and simplifying pseudorandom generator constructions
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |