Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Minkowski's convex body theorem and integer programming
Mathematics of Operations Research
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
Note on shortest and nearest lattice vectors
Information Processing Letters
The hardness of approximate optima in lattices, codes, and systems of linear equations
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
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 non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A relation of primal-dual lattices and the complexity of shortest lattice vector problem
Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
An Improved Worst-Case to Average-Case Connection for Lattice Problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximating-CVP to within Almost-Polynomial Factors is NP-Hard
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Improved cryptographic hash functions with worst-case/average-case connection
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Lattice problems and norm embeddings
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast LLL-type lattice reduction
Information and Computation
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Computational Complexity
Efficient reductions among lattice problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Sampling methods for shortest vectors, closest vectors and successive minima
Theoretical Computer Science
Fast LLL-type lattice reduction
Information and Computation
On routing in circulant graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Lattice-based identification schemes secure under active attacks
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Proceedings of the forty-second ACM symposium on Theory of computing
The geometry of lattice cryptography
Foundations of security analysis and design VI
Approximating the closest vector problem using an approximate shortest vector oracle
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Sampling methods for shortest vectors, closest vectors and successive minima
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |