Improved cryptographic hash functions with worst-case/average-case connection
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
New lattice based cryptographic constructions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The inapproximability of lattice and coding problems with preprocessing
Journal of Computer and System Sciences - Special issue on computational complexity 2002
New lattice-based cryptographic constructions
Journal of the ACM (JACM)
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fast quantum algorithms for computing the unit group and class group of a number field
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Hardness of approximating the shortest vector problem in lattices
Journal of the ACM (JACM)
Hardness of Approximating the Closest Vector Problem with Pre-Processing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
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
Hardness of approximating the Shortest Vector Problem in high ℓp norms
Journal of Computer and System Sciences - Special issue on FOCS 2003
Reconstructing noisy polynomial evaluation in residue rings
Journal of Algorithms
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
Optimal routing in double loop networks
Theoretical Computer Science
Designs, Codes and Cryptography
Foundations and Trends® in Theoretical Computer Science
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
Trapdoors for hard lattices and new cryptographic constructions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Finding short lattice vectors within mordell's inequality
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Limits on the Hardness of Lattice Problems in lp Norms
Computational Complexity
Cryptography Based on Quadratic Forms: Complexity Considerations
Research in Cryptology
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Broadcast Attacks against Lattice-Based Cryptosystems
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
On lattices, learning with errors, random linear codes, and cryptography
Journal of the ACM (JACM)
Low-dimensional lattice basis reduction revisited
ACM Transactions on Algorithms (TALG)
Parallel Lattice Basis Reduction Using a Multi-threaded Schnorr-Euchner LLL Algorithm
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Fixed complexity LLL algorithm
IEEE Transactions on Signal Processing
Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Efficient Public Key Encryption Based on Ideal Lattices
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Fast LLL-type lattice reduction
Information and Computation
The finite-dimensional Witsenhausen counterexample
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Cryptanalysis of the Paeng-Jung-Ha cryptosystem from PKC 2003
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Multi-bit cryptosystems based on lattice problems
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Improved analysis of Kannan's shortest lattice vector algorithm
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Algorithmic problems for metrics on permutation groups
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Proceedings of the forty-second ACM symposium on Theory of computing
Faster exponential time algorithms for the shortest vector problem
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Adaptively secure identity-based identification from lattices without random oracles
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
The Euclidean distortion of flat tori
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Improved zero-knowledge identification with lattices
ProvSec'10 Proceedings of the 4th international conference on Provable security
NTRU-like public key cryptosystems beyond dedekind domain up to alternative algebra
Transactions on computational science X
An LLL-reduction algorithm with quasi-linear time complexity: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Algorithms for the shortest and closest lattice vector problems
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
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
Random sampling for short lattice vectors on graphics cards
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Predicting subset sum pseudorandom generators
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
On the degree of univariate polynomials over the integers
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Generalized compact knapsacks are collision resistant
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Adapting density attacks to low-weight knapsacks
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
On finding a shortest path in circulant graphs with two jumps
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Cryptanalysis of the quadratic generator
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Implicit factoring with shared most significant and middle bits
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Bonsai trees, or how to delegate a lattice basis
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Efficient lattice (H)IBE in the standard model
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On bounded distance decoding for general lattices
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Rankin's constant and blockwise lattice reduction
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Parallel shortest lattice vector enumeration on graphics cards
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Learning a parallelepiped: cryptanalysis of GGH and NTRU signatures
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
A decision procedure for monotone functions over bounded and complete lattices
TARSKI'02-05 Proceedings of the 2006 international conference on Theory and Applications of Relational Structures as Knowledge Instruments - Volume 2
Practical modifications of leadbitter et al.'s repeated-bits side-channel analysis on (EC)DSA
WISA'05 Proceedings of the 6th international conference on Information Security Applications
Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices
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
An effective branch-and-bound algorithm for convex quadratic integer programming
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Efficient pairing computation on ordinary elliptic curves of embedding degree 1 and 2
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Public key identification based on the equivalence of quadratic forms
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Sampling methods for shortest vectors, closest vectors and successive minima
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Fully anonymous attribute tokens from lattices
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Security and Communication Networks
Adaptively secure efficient lattice (H)IBE in standard model with short public parameters
SPACE'12 Proceedings of the Second international conference on Security, Privacy, and Applied Cryptography Engineering
On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
Designs, Codes and Cryptography
On certain computations of Pisot numbers
Information Processing Letters
Theoretical Computer Science
Anonymous lattice-based broadcast encryption
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
SEC'13 Proceedings of the 22nd USENIX conference on Security
Improvements in closest point search based on dual HKZ-bases
Theoretical Computer Science
On the probability of generating a lattice
Journal of Symbolic Computation
Recovering a sum of two squares decomposition
Journal of Symbolic Computation
Lattice-based completely non-malleable public-key encryption in the standard model
Designs, Codes and Cryptography
| Hi-index | 0.01 |