A sieve algorithm for the shortest lattice vector problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM SIGACT News
Improved cryptographic hash functions with worst-case/average-case connection
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
On Interactive Proofs with a Laconic Prover
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Shortest Vector Problem in Lattices with Many Cycles
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
On interactive proofs with a laconic prover
Computational Complexity
Journal of the ACM (JACM)
Hardness of approximating the shortest vector problem in lattices
Journal of the ACM (JACM)
Zero-knowledge against quantum attacks
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Lattice problems and norm embeddings
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Hardness of approximating the Shortest Vector Problem in high ℓp norms
Journal of Computer and System Sciences - Special issue on FOCS 2003
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lattices that admit logarithmic worst-case to average-case connection factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword
Computational Complexity
Limits on the Hardness of Lattice Problems in lp Norms
Computational Complexity
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Explicit Hard Instances of the Shortest Vector Problem
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Sampling methods for shortest vectors, closest vectors and successive minima
Theoretical Computer Science
New NP-Complete Problems Associated with Lattices
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Digital Signature Scheme Based on NP-Complete Lattice Problems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Algorithmic problems for metrics on permutation groups
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Asymptotically efficient lattice-based digital signatures
TCC'08 Proceedings of the 5th conference on Theory of cryptography
General properties of quantum zero-knowledge proofs
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Towards non-black-box lower bounds in cryptography
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Generalized compact knapsacks are collision resistant
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Proof of plaintext knowledge for the ajtai-dwork cryptosystem
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Theoretical Computer Science
Concurrent zero knowledge without complexity assumptions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
The leakage-resilience limit of a computational problem is equal to its unpredictability entropy
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
A leakage-resilient zero knowledge proof for lattice problem
CSS'12 Proceedings of the 4th international conference on Cyberspace Safety and Security
| Hi-index | 0.00 |