ring-LWE

swMATH19028MaRDI QIDQ30859FDOQ30859

Author name not available (Why is that?)

Source code repository: https://github.com/CMMayer/Toolkit-for-Ring-LWE-v1.0

Cited In (46)

• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• Quantum Hardness of Learning Shallow Classical Circuits
• A new Gaussian sampling for trapdoor lattices with arbitrary modulus
• Post-quantum online voting scheme
• Implementation of lattice trapdoors on modules and applications
• Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
• Homomorphic Encryption Standard
• Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy
• A new post-quantum multivariate polynomial public key encapsulation algorithm
• LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE
• A Toolkit for Ring-LWE Cryptography
• On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
• Discretisation and product distributions in ring-LWE
• Towards a ring analogue of the leftover hash lemma
• How (Not) to Instantiate Ring-LWE
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• Tighter security proofs for GPV-IBE in the quantum random oracle model
• Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
• PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model
• Bootstrapping for helib
• Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• Asymptotically quasi-optimal cryptography
• Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
• Efficient pseudorandom correlation generators from ring-LPN
• Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm
• On the hardness of module learning with errors with short distributions
• Adaptive Security with Quasi-Optimal Rate
• Properties of constacyclic codes under the Schur product
• (In)security of ring-LWE under partial key exposure
• Bootstrapping for BGV and BFV revisited
• The closest vector problem in tensored root lattices of type A and in their duals
• Chosen-ciphertext lattice-based public key encryption with equality test in standard model
• Provably Secure NTRU Instances over Prime Cyclotomic Rings
• Improving speed and security in updatable encryption schemes
• Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
• Asymptotically efficient lattice-based digital signatures
• On 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)$
• Worst-case to average-case reductions for module lattices
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
• A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$
• The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs
• The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings
• Rounding in the rings
• Computing Generator in Cyclotomic Integer Rings

This page was built for software: ring-LWE