The complexity of promise problems with applications to public-key cryptography
Information and Control
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
An efficient probabilistic public key encryption scheme which hides all partial information
Proceedings of CRYPTO 84 on Advances in cryptology
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Does co-NP have short interactive proofs?
Information Processing Letters
A hierarchy of polynomial time lattice basis reduction algorithms
Theoretical Computer Science
Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On relationships between statistical zero-knowledge proofs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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
Some optimal inapproximability results
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
Random walks and an O*(n5) volume algorithm for convex bodies
Random Structures & Algorithms
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
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Public-Key Cryptosystems from Lattice Reduction Problems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A Complete Promise Problem for Statistical Zero-Knowledge
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations 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
On the Inapproximability of the Shortest Vector in a Lattice Within Some Constant Factor
On the Inapproximability of the Shortest Vector in a Lattice Within Some Constant Factor
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the complexity of computing short linearly independent vectors and short bases in a lattice
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The Complexity of the Extended GCD Problem
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
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
Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Adiabatic quantum state generation and statistical zero knowledge
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
ACM Transactions on Algorithms (TALG)
Progress in computational complexity theory
Journal of Computer Science and Technology
Foundations and Trends® in Theoretical Computer Science
Efficient lattice-based signature scheme
International Journal of Applied Cryptography
A new transference theorem in the geometry of numbers
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On routing in circulant graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Hypercubic lattice reduction and analysis of GGH and NTRU signatures
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
A digital signature scheme based on CV P∞
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
| Hi-index | 0.00 |