A Toolkit for Ring-LWE Cryptography

From MaRDI portal
Publication:4924402

DOI10.1007/978-3-642-38348-9_3zbMath1300.94082OpenAlexW31130112MaRDI QIDQ4924402

Vadim Lyubashevsky, Chris Peikert, Oded Regev

Publication date: 31 May 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_3




Related Items (80)

Lattice-based proof of shuffle and applications to electronic votingPAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard ModelImproved Discrete Gaussian and Subgaussian Analysis for Lattice CryptographyEfficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to PrivacyHomomorphic Encryption StandardLWE without modular reduction and improved side-channel attacks against BLISSTrapdoors for Ideal Lattices with ApplicationsProvably Weak Instances of Ring-LWEMemory lower bounds of reductions revisitedOn the ring-LWE and polynomial-LWE problemsFaster Gaussian sampling for trapdoor lattices with arbitrary modulusShort, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofsApplication of automorphic forms to lattice problemsNon-commutative ring learning with errors from cyclic algebrasTightly secure ring-LWE based key encapsulation with short ciphertextsAsymptotically quasi-optimal cryptographyBootstrapping for helibProperties of constacyclic codes under the Schur productPost-quantum online voting schemeAsymptotically efficient lattice-based digital signaturesAugmented Learning with Errors: The Untapped Potential of the Error TermOn the hardness of module learning with errors with short distributionsBatch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulusBatch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortizationOn homomorphic secret sharing from polynomial-modulus LWEPartitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear MapsThe linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer ringsLattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)MuSig-L: lattice-based multi-signature with single-round online phaseVerifiable decryption in the headThe closest vector problem in tensored root lattices of type A and in their dualsLattice signature with efficient protocols, application to anonymous credentialsPolar coding for ring-LWE-based public key encryptionEfficient lattice-based inner-product functional encryptionBatched fully dynamic multi-key FHE from FHEW-like cryptosystemsPost-quantum key exchange for the Internet and the open quantum safe project\textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulationHardness of (M)LWE with semi-uniform seedsImproving speed and security in updatable encryption schemesSimpler statistically sender private oblivious transfer from ideals of cyclotomic integersBootstrapping for BGV and BFV revisitedRing-based identity based encryption -- asymptotically shorter MPK and tighter securityA Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$Provably secure NTRUEncrypt over any cyclotomic fieldEfficient, actively secure MPC with a dishonest majority: a surveyEfficient public-key encryption with equality test from latticesOn the Scaled Inverse of $(x^i-x^j)$ modulo Cyclotomic Polynomial of the form $\Phi_{p^s}(x)$ or $\Phi_{p^s q^t}(x)$Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemesHILA5: on reliability, reconciliation, and error correction for Ring LWE encryptionFinite interval-time transition system for real-time actorsLP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWEProvably Secure NTRU Instances over Prime Cyclotomic RingsComputing Generator in Cyclotomic Integer RingsConstraint-Hiding Constrained PRFs for NC $$^1$$ from LWEOn Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEALGroup signatures and more from isogenies and lattices: generic, simple, and efficientDiscretisation and product distributions in ring-LWE(In)security of ring-LWE under partial key exposureTowards a ring analogue of the leftover hash lemmaAdaptive Security with Quasi-Optimal RateTighter security proofs for GPV-IBE in the quantum random oracle modelTwo-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from latticesTwo-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from latticesSampling from discrete Gaussians for lattice-based cryptography on a constrained deviceHomomorphic Evaluation of Lattice-Based Symmetric Encryption SchemesOn the security of homomorphic encryption on approximate numbersOn Quantum Chosen-Ciphertext Attacks and Learning with ErrorsThe Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEsHow (Not) to Instantiate Ring-LWEThree’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWEProgrammable Hash Functions from Lattices: Short Signatures and IBEs with Small Key SizesChosen-ciphertext lattice-based public key encryption with equality test in standard modelQuantum Hardness of Learning Shallow Classical CircuitsA new Gaussian sampling for trapdoor lattices with arbitrary modulusAlgebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman AlgorithmRounding in the ringsEfficient pseudorandom correlation generators from ring-LPNA new post-quantum multivariate polynomial public key encapsulation algorithmWorst-case to average-case reductions for module latticesImplementation of lattice trapdoors on modules and applications


Uses Software



This page was built for publication: A Toolkit for Ring-LWE Cryptography