Efficient Public Key Encryption Based on Ideal Lattices
From MaRDI portal
Publication:3650717
DOI10.1007/978-3-642-10366-7_36zbMath1267.94132OpenAlexW1491861813MaRDI QIDQ3650717
Keita Xagawa, Ron Steinfeld, Keisuke Tanaka, Damien Stehlé
Publication date: 15 December 2009
Published in: Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10366-7_36
Related Items
Structural cryptanalysis of McEliece schemes with compact keys, Dual lattice attacks for closest vector problems (with preprocessing), On the hardness of module-LWE with binary secret, RLWE/PLWE equivalence for totally real cyclotomic subextensions via quasi-Vandermonde matrices, Lower bounds on lattice sieving and information set decoding, An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption, LWE without modular reduction and improved side-channel attacks against BLISS, A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties, Trapdoors for Ideal Lattices with Applications, Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography, Tightly secure signatures from lossy identification schemes, An extension of Kannan's embedding for solving ring-based LWE problems, On the ring-LWE and polynomial-LWE problems, Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs, On the Efficacy of Solving LWE by Reduction to Unique-SVP, Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems, Quantum algorithms for variants of average-case lattice problems via filtering, Anonymity of NIST PQC round 3 KEMs, Algebraically structured LWE. Revisited, Lattice trapdoors and IBE from middle-product LWE, On the RLWE/PLWE equivalence for cyclotomic number fields, Bonsai trees, or how to delegate a lattice basis, Augmented Learning with Errors: The Untapped Potential of the Error Term, NTRU Fatigue: How Stretched is Overstretched?, On the hardness of module learning with errors with short distributions, Discretization error reduction for high precision torus fully homomorphic encryption, Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings, A thorough treatment of highly-efficient NTRU instantiations, The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings, Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract), Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem, On codes and learning with errors over function fields, Fiat-Shamir signatures based on module-NTRU, Parameter optimization and larger precision for (T)FHE, Subfield attacks on HSVP in ideal lattices, Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP, On module unique-SVP and NTRU, On the hardness of the NTRU problem, Balanced non-adjacent forms, Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE, Polar coding for ring-LWE-based public key encryption, Entropic hardness of Module-LWE from module-NTRU, A full RNS variant of FV like somewhat homomorphic encryption schemes, Lattice-based cryptography: a survey, HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering, Publicly-verifiable deletion via target-collapsing functions, Reductions from module lattices to free module lattices, and application to dequantizing module-LLL, Hardness of (M)LWE with semi-uniform seeds, Towards classical hardness of module-LWE: the linear rank case, Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices, Ring-based identity based encryption -- asymptotically shorter MPK and tighter security, Trapdoor delegation and HIBE from middle-product LWE in standard model, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Strongly secure authenticated key exchange from factoring, codes, and lattices, Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications, Security analysis of cryptosystems using short generators over ideal lattices, Computing Generator in Cyclotomic Integer Rings, One-Shot Verifiable Encryption from Lattices, Short Stickelberger Class Relations and Application to Ideal-SVP, Short Bases of Lattices over Number Fields, A framework for cryptographic problems from linear algebra, Discretisation and product distributions in ring-LWE, Approximate Voronoi cells for lattices, revisited, Cryptographic Assumptions: A Position Paper, On the condition number of the Vandermonde matrix of the \(n\)th cyclotomic polynomial, Limits on the efficiency of (ring) LWE-based non-interactive key exchange, TFHE: fast fully homomorphic encryption over the torus, Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE, (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes, MPSign: a signature from small-secret middle-product learning with errors, On the ideal shortest vector problem over random rational primes, The Geometry of Lattice Cryptography, On the integer polynomial learning with errors problem, LWE from non-commutative group rings, A Subfield Lattice Attack on Overstretched NTRU Assumptions, Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency, Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP, Random self-reducibility of ideal-SVP via Arakelov random walks, Revocable hierarchical identity-based authenticated key exchange, Worst-case to average-case reductions for module lattices, Quantum key search for ternary LWE, Implementation of lattice trapdoors on modules and applications
