Average case complete problems
SIAM Journal on Computing
Random-self-reducibility of complete sets
SIAM Journal on Computing
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the hardness of computing the permanent of random matrices
Computational Complexity
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A public-key cryptosystem with worst-case/average-case equivalence
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the limits of nonapproximability of lattice problems
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
A note on the non-NP-hardness of approximate lattice problems under general Cook reductions
Information Processing Letters
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Randomness vs time: derandomization under a uniform assumption
Journal of Computer and System Sciences
Hiding Instances in Multioracle Queries
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
An Improved Worst-Case to Average-Case Connection for Lattice Problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A personal view of average-case complexity
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
SIAM Journal on Computing
New lattice-based cryptographic constructions
Journal of the ACM (JACM)
The complexity of constructing pseudorandom generators from hard functions
Computational Complexity
On Constructing Parallel Pseudorandom Generators from One-Way Functions
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
On basing one-way functions on NP-hardness
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Foundations and Trends® in Theoretical Computer Science
On Worst-Case to Average-Case Reductions for NP Problems
SIAM Journal on Computing
Worst-Case to Average-Case Reductions Based on Gaussian Measures
SIAM Journal on Computing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
To release or not to release: evaluating information leaks in aggregate human-genome data
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
| Hi-index | 0.00 |