Pages that link to "Item:Q3650717"
From MaRDI portal
The following pages link to Efficient Public Key Encryption Based on Ideal Lattices (Q3650717):
Displaying 50 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Strongly secure authenticated key exchange from factoring, codes, and lattices (Q494585) (← links)
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- LWE without modular reduction and improved side-channel attacks against BLISS (Q1633471) (← links)
- On the ring-LWE and polynomial-LWE problems (Q1648786) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- A full RNS variant of FV like somewhat homomorphic encryption schemes (Q1698661) (← links)
- Security analysis of cryptosystems using short generators over ideal lattices (Q1756730) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- Discretisation and product distributions in ring-LWE (Q2027267) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- On the condition number of the Vandermonde matrix of the \(n\)th cyclotomic polynomial (Q2033513) (← links)
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange (Q2051406) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes (Q2055644) (← links)
- MPSign: a signature from small-secret middle-product learning with errors (Q2055685) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- On the integer polynomial learning with errors problem (Q2061918) (← links)
- LWE from non-commutative group rings (Q2068391) (← links)
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP (Q2096523) (← links)
- Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
- Revocable hierarchical identity-based authenticated key exchange (Q2104408) (← links)
- Quantum key search for ternary LWE (Q2118530) (← links)
- Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography (Q2143125) (← links)
- An extension of Kannan's embedding for solving ring-based LWE problems (Q2149793) (← links)
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427) (← links)
- Quantum algorithms for variants of average-case lattice problems via filtering (Q2170094) (← links)
- Anonymity of NIST PQC round 3 KEMs (Q2170102) (← links)
- Algebraically structured LWE. Revisited (Q2175901) (← links)
- Lattice trapdoors and IBE from middle-product LWE (Q2175903) (← links)
- Trapdoor delegation and HIBE from middle-product LWE in standard model (Q2229268) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- TFHE: fast fully homomorphic encryption over the torus (Q2303454) (← links)
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency (Q2334442) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption (Q2629405) (← links)
- On the RLWE/PLWE equivalence for cyclotomic number fields (Q2668220) (← 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)
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security (Q2697891) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- A Subfield Lattice Attack on Overstretched NTRU Assumptions (Q2835586) (← links)
- Augmented Learning with Errors: The Untapped Potential of the Error Term (Q2948191) (← links)
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings (Q2953777) (← links)
