Pages that link to "Item:Q5395738"
From MaRDI portal
The following pages link to On Ideal Lattices and Learning with Errors over Rings (Q5395738):
Displaying 50 items.
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- On the concrete hardness of learning with errors (Q745110) (← links)
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- Lattice-based certificateless encryption scheme (Q1633051) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- On the ring-LWE and polynomial-LWE problems (Q1648786) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- Security considerations for Galois non-dual RLWE families (Q1698662) (← links)
- STP-LWE: A variant of learning with error for a flexible encryption (Q1718158) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
- Security analysis of cryptosystems using short generators over ideal lattices (Q1756730) (← links)
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
- Dual-mode cryptosystem based on the learning with errors problem (Q2014649) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- Verifying solutions to LWE with implications for concrete security (Q2025364) (← links)
- (In)security of ring-LWE under partial key exposure (Q2027270) (← links)
- Towards a ring analogue of the leftover hash lemma (Q2027271) (← links)
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes (Q2055683) (← links)
- MPSign: a signature from small-secret middle-product learning with errors (Q2055685) (← links)
- Lossiness and entropic hardness for ring-LWE (Q2055712) (← links)
- On the security of homomorphic encryption on approximate numbers (Q2056709) (← links)
- On the integer polynomial learning with errors problem (Q2061918) (← links)
- LWE from non-commutative group rings (Q2068391) (← links)
- On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers (Q2095466) (← links)
- Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
- Improved lattice-based mix-nets for electronic voting (Q2104424) (← links)
- Non-commutative ring learning with errors from cyclic algebras (Q2154559) (← links)
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- Algebraically structured LWE. Revisited (Q2175901) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack (Q2415416) (← links)
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle (Q2670855) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- Towards classical hardness of module-LWE: the linear rank case (Q2692385) (← links)
- SLAP: simpler, improved private stream aggregation from ring learning with errors (Q2693220) (← links)
- Post-Quantum Forward-Secure Onion Routing (Q2794504) (← links)
- The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs (Q2827724) (← links)
- How (Not) to Instantiate Ring-LWE (Q2827731) (← links)
- Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes (Q2947538) (← links)
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings (Q2953777) (← links)
- Multi-key FHE from LWE, Revisited (Q3181028) (← links)
- BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU (Q3294884) (← links)
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices (Q3457104) (← links)
- On Learning Ring-Sum-Expansions (Q3990109) (← links)
- Attacks on the Search RLWE Problem with Small Errors (Q4603026) (← links)
- On the hardness of learning with errors with binary secrets (Q4612477) (← links)
