Lattice-based Cryptography
From MaRDI portal
Publication:3613268
DOI10.1007/978-3-540-88702-7_5zbMath1161.81324OpenAlexW1598269861MaRDI QIDQ3613268
Daniele Micciancio, Oded Regev
Publication date: 12 March 2009
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88702-7_5
Related Items (89)
Lattice-based key exchange on small integer solution problem ⋮ Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy ⋮ Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ A trace map attack against special ring-LWE samples ⋮ Polly cracker, revisited ⋮ Homomorphic Encryption Standard ⋮ Homomorphic AES evaluation using the modified LTV scheme ⋮ Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity ⋮ Coded-BKW: Solving LWE Using Lattice Codes ⋮ Provably Weak Instances of Ring-LWE ⋮ Cryptanalysis of the Co-ACD Assumption ⋮ Solving the search-LWE problem over projected lattices ⋮ An extension of Kannan's embedding for solving ring-based LWE problems ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ On the Efficacy of Solving LWE by Reduction to Unique-SVP ⋮ Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems ⋮ Tightly secure ring-LWE based key encapsulation with short ciphertexts ⋮ A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme ⋮ The polynomial learning with errors problem and the smearing condition ⋮ Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\) ⋮ A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors ⋮ Properties of constacyclic codes under the Schur product ⋮ Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms ⋮ Sharper bounds on four lattice constants ⋮ Cryptanalysis of the CLR-cryptosystem ⋮ Predicting the concrete security of LWE against the dual attack using binary search ⋮ Estimation of the hardness of the learning with errors problem with a restricted number of samples ⋮ PotLLL: a polynomial time version of LLL with deep insertions ⋮ Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ Generalized attack on ECDSA: known bits in arbitrary positions ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings ⋮ Preventing Adaptive Key Recovery Attacks on the GSW Levelled Homomorphic Encryption Scheme ⋮ The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings ⋮ EHNP strikes back: analyzing SM2 implementations ⋮ Solving LWR via BDD Strategy: Modulus Switching Approach ⋮ Handle the traces: revisiting the attack on ECDSA with EHNP ⋮ A bivariate polynomial-based cryptographic hard problem and its applications ⋮ A closest vector problem arising in radiation therapy planning ⋮ On the asymptotic complexity of solving LWE ⋮ The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem ⋮ Fast practical lattice reduction through iterated compression ⋮ Does the dual-sieve attack on learning with errors even work? ⋮ Statistical-computational trade-offs in tensor PCA and related problems via communication complexity ⋮ A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion ⋮ Lattice-Based Proof of a Shuffle ⋮ Concrete security from worst-case to average-case lattice reductions ⋮ Finding and evaluating parameters for BGV ⋮ On elliptic curve $L$-functions integrated encryption scheme ⋮ Attacks on the Search RLWE Problem with Small Errors ⋮ Estimating quantum speedups for lattice sieves ⋮ Tuple lattice sieving ⋮ Improved combinatorial algorithms for the inhomogeneous short integer solution problem ⋮ Quantum Cryptography: Key Distribution and Beyond ⋮ Public key compression for constrained linear signature schemes ⋮ Unnamed Item ⋮ An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem ⋮ Fractional LWE: A Nonlinear Variant of LWE ⋮ Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ A Signcryption Scheme Based Learning with Errors over Rings Without Trapdoor ⋮ New Algorithms for Learning in Presence of Errors ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ The polynomial approximate common divisor problem and its application to the fully homomorphic encryption ⋮ Bounds for the \(l_1\)-distance of \(q\)-ary lattices obtained via constructions \(\mathrm D\), \(\mathrm D'\) and \(\overline{\mathrm D}\) ⋮ Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ On the complexity of the BKW algorithm on LWE ⋮ Generating shorter bases for hard random lattices ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Unnamed Item ⋮ Rigorous and Efficient Short Lattice Vectors Enumeration ⋮ Finding Shortest Lattice Vectors in the Presence of Gaps ⋮ Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme ⋮ Post-Quantum Forward-Secure Onion Routing ⋮ Improvements in the analysis of Kannan's CVP algorithm ⋮ Better Key Sizes (and Attacks) for LWE-Based Encryption ⋮ Integer Version of Ring-LWE and Its Applications ⋮ Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures ⋮ On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem ⋮ Advanced lattice sieving on GPUs, with tensor cores ⋮ The Geometry of Lattice Cryptography ⋮ On the success probability of solving unique SVP via BKZ ⋮ The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs ⋮ How (Not) to Instantiate Ring-LWE ⋮ Worst-case to average-case reductions for module lattices ⋮ Deciding Orthogonality in Construction-A Lattices ⋮ The remote set problem on lattices
This page was built for publication: Lattice-based Cryptography
