A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth 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
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
On the limits of nonapproximability of lattice problems
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
A sieve algorithm for the shortest lattice vector problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Public-Key Cryptosystems from Lattice Reduction Problems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A personal view of average-case complexity
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
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
Cryptographic Hardness for Learning Intersections of Halfspaces
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Worst-Case to Average-Case Reductions Based on Gaussian Measures
SIAM Journal on Computing
Lossy trapdoor functions and their applications
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Trapdoors for hard lattices and new cryptographic constructions
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
Multi-bit cryptosystems based on lattice problems
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
On lattices, learning with errors, random linear codes, and cryptography
Journal of the ACM (JACM)
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Toward basing fully homomorphic encryption on worst-case hardness
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Additively homomorphic encryption with d-operand multiplications
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Efficient chosen-ciphertext security via extractable hash proofs
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Accelerating lattice reduction with FPGAs
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Chosen-Ciphertext Security via Correlated Products
SIAM Journal on Computing
Better key sizes (and attacks) for LWE-based encryption
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Black-box circular-secure encryption beyond affine functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Making NTRU as secure as worst-case problems over ideal lattices
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
New algorithms for learning in presence of errors
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The geometry of lattice cryptography
Foundations of security analysis and design VI
Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
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
Generalized learning problems and applications to non-commutative cryptography
ProvSec'11 Proceedings of the 5th international conference on Provable security
On noise-tolerant learning of sparse parities and related problems
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Improving the parallel schnorr-euchner lll algorithm
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
(Leveled) fully homomorphic encryption without bootstrapping
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Public-key encryption schemes with auxiliary inputs
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Public-key cryptographic primitives provably as secure as subset sum
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
More constructions of lossy and correlation-secure trapdoor functions
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
On ideal lattices and learning with errors over rings
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Public-Key encryption in the bounded-retrieval model
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
A simple BGN-Type cryptosystem from LWE
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
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
Parallel shortest lattice vector enumeration on graphics cards
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Efficient threshold encryption from lossy trapdoor functions
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Functional encryption for inner product predicates from learning with errors
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
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 general NTRU-Like framework for constructing lattice-based public-key cryptosystems
WISA'11 Proceedings of the 12th international conference on Information Security Applications
A new lattice-based public-key cryptosystem mixed with a knapsack
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Cryptography from learning parity with noise
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Identity-Based (lossy) trapdoor functions and applications
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Message authentication, revisited
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Multiparty computation with low communication, computation and interaction via threshold FHE
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Trapdoors for lattices: simpler, tighter, faster, smaller
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Pseudorandom functions and lattices
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Lattice signatures without trapdoors
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Lossy Trapdoor Functions and Their Applications
SIAM Journal on Computing
On homomorphic encryption and chosen-ciphertext security
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Public-Key cryptography from new multivariate quadratic assumptions
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Functional encryption for threshold functions (or fuzzy IBE) from lattices
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
From selective to full security: semi-generic transformations in the standard model
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Circular and KDM security for identity-based encryption
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
NTRUCCA: how to strengthen NTRUEncrypt to chosen-ciphertext security in the standard model
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Strongly secure authenticated key exchange from factoring, codes, and lattices
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Correlated product security from any one-way function
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Extended-DDH and lossy trapdoor functions
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Multi-Committer threshold commitment scheme from lattice
PAISI'12 Proceedings of the 2012 Pacific Asia conference on Intelligence and Security Informatics
Inner-product lossy trapdoor functions and applications
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Revocable identity-based encryption from lattices
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Full lattice basis reduction on graphics cards
WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
Lattice-Based hierarchical inner product encryption
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
On the design of hardware building blocks for modern lattice-based encryption schemes
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Zero-Knowledge proofs with low amortized communication from lattice assumptions
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Fully anonymous attribute tokens from lattices
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
New attacks for knapsack based cryptosystems
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
A ciphertext policy attribute-based encryption scheme without pairings
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
IND-CCA secure cryptography based on a variant of the LPN problem
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Solving BDD by enumeration: an update
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Attribute-Based functional encryption on lattices
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Attribute-based encryption for circuits
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Reusable garbled circuits and succinct functional encryption
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Classical hardness of learning with errors
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
How to share a lattice trapdoor: threshold protocols for signatures and (H)IBE
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
On Ideal Lattices and Learning with Errors over Rings
Journal of the ACM (JACM)
Lattice-based FHE as secure as PKE
Proceedings of the 5th conference on Innovations in theoretical computer science
Efficient Linear Homomorphic Encryption from LWE Over Rings
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
We construct public-key cryptosystems that are secure assuming theworst-case hardness of approximating the minimum distance on n-dimensional lattices to within small Poly(n) factors. Prior cryptosystems with worst-case connections were based either on the shortest vector problem for a special class of lattices (Ajtai and Dwork, STOC 1997; Regev, J. ACM 2004), or on the conjectured hardness of lattice problems for quantum algorithms (Regev, STOC 2005). Our main technical innovation is a reduction from variants of the shortest vector problem to corresponding versions of the "learning with errors" (LWE) problem; previously, only a quantum reduction of this kind was known. As an additional contribution, we construct a natural chosen ciphertext-secure cryptosystem having a much simpler description and tighter underlying worst-case approximation factor than prior schemes.