On Ideal Lattices and Learning with Errors over Rings

DOI10.1007/978-3-642-13190-5_1zbMath1279.94099OpenAlexW2098290658WikidataQ57484385 ScholiaQ57484385MaRDI QIDQ3563827

Vadim Lyubashevsky, Chris Peikert, Oded Regev

Publication date: 1 June 2010

Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_1

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (only showing first 100 items - show all)

Structural cryptanalysis of McEliece schemes with compact keys ⋮ SoK: how (not) to design and implement post-quantum cryptography ⋮ On the hardness of module-LWE with binary secret ⋮ How to meet ternary LWE keys ⋮ Lower bounds on lattice sieving and information set decoding ⋮ A trace map attack against special ring-LWE samples ⋮ FFT program generation for ring LWE-based cryptography ⋮ Polly cracker, revisited ⋮ Cryptanalysis of a public key cryptosystem based on Diophantine equations via weighted LLL reduction ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption ⋮ LWE without modular reduction and improved side-channel attacks against BLISS ⋮ Error analysis of weak poly-LWE instances ⋮ Homomorphic AES evaluation using the modified LTV scheme ⋮ Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography ⋮ Improved attacks against key reuse in learning with errors key exchange ⋮ Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm ⋮ An extension of Kannan's embedding for solving ring-based LWE problems ⋮ When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead ⋮ The matrix reloaded: multiplication strategies in FrodoKEM ⋮ On the higher-bit version of approximate inhomogeneous short integer solution problem ⋮ Survey of information security ⋮ Gadget-based iNTRU lattice trapdoors ⋮ Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\) ⋮ Memory lower bounds of reductions revisited ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Application of automorphic forms to lattice problems ⋮ Non-commutative ring learning with errors from cyclic algebras ⋮ Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems ⋮ Unified program generation and verification: a case study on number-theoretic transform ⋮ Lattice-based public-key encryption with equality test supporting flexible authorization in standard model ⋮ 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 ⋮ Asymptotically quasi-optimal cryptography ⋮ Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ Anonymity of NIST PQC round 3 KEMs ⋮ Lattice trapdoors and IBE from middle-product LWE ⋮ Asymptotically efficient lattice-based digital signatures ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants ⋮ Secret computation of purchase history data using somewhat homomorphic encryption ⋮ Efficiently processing complex-valued data in homomorphic encryption ⋮ Flattening NTRU for evaluation key free homomorphic encryption ⋮ The closest vector problem in tensored root lattices of type A and in their duals ⋮ D-NTRU: more efficient and average-case IND-CPA secure NTRU variant ⋮ Efficient authentication from hard learning problems ⋮ Post-quantum key exchange for the Internet and the open quantum safe project ⋮ An efficient quantum somewhat homomorphic symmetric searchable encryption ⋮ Security estimates of a ring-LWE symmetric cryptosystem against chosen plaintext attack ⋮ Assessing the feasibility of single trace power analysis of Frodo ⋮ Analysis of error-correcting codes for lattice-based key exchange ⋮ Provably secure NTRUEncrypt over any cyclotomic field ⋮ Trapdoor delegation and HIBE from middle-product LWE in standard model ⋮ The lattice-based digital signature scheme qTESLA ⋮ ETRU: NTRU over the Eisenstein integers ⋮ 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 ⋮ Functional encryption for cubic polynomials and implementation ⋮ Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes ⋮ HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption ⋮ A simple provably secure AKE from the LWE problem ⋮ (Leveled) Fully Homomorphic Encryption without Bootstrapping ⋮ CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes ⋮ A framework for cryptographic problems from linear algebra ⋮ Towards isogeny-based password-authenticated key establishment ⋮ Discretisation and product distributions in ring-LWE ⋮ (In)security of ring-LWE under partial key exposure ⋮ On the condition number of the Vandermonde matrix of the \(n\)th cyclotomic polynomial ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ Sampling from discrete Gaussians for lattice-based cryptography on a constrained device ⋮ Limits on the efficiency of (ring) LWE-based non-interactive key exchange ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes ⋮ Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes ⋮ On the ideal shortest vector problem over random rational primes ⋮ On the integer polynomial learning with errors problem ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ LWE from non-commutative group rings ⋮ Chosen-ciphertext lattice-based public key encryption with equality test in standard model ⋮ A new scale-invariant homomorphic encryption scheme ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Lattice-based revocable certificateless signature ⋮ Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency ⋮ Strongly leakage resilient authenticated key exchange, revisited ⋮ Hardness of learning problems over Burnside groups of exponent 3 ⋮ Fast reduction of algebraic lattices over cyclotomic fields ⋮ Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP ⋮ Rounding in the rings ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge ⋮ Practical product proofs for lattice commitments ⋮ Revocable hierarchical attribute-based signatures from lattices ⋮ Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security ⋮ Distinguishing attack on the NTRUCipher encryption scheme ⋮ Revocable hierarchical identity-based authenticated key exchange ⋮ Worst-case to average-case reductions for module lattices ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts ⋮ Quantum key search for ternary LWE ⋮ Implementation of lattice trapdoors on modules and applications

This page was built for publication: On Ideal Lattices and Learning with Errors over Rings