Pages that link to "Item:Q3563827"
From MaRDI portal
The following pages link to On Ideal Lattices and Learning with Errors over Rings (Q3563827):
Displaying 50 items.
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (Q92720) (← links)
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Polly cracker, revisited (Q285245) (← links)
- Homomorphic AES evaluation using the modified LTV scheme (Q310240) (← links)
- ETRU: NTRU over the Eisenstein integers (Q488263) (← links)
- Strongly secure authenticated key exchange from factoring, codes, and lattices (Q494585) (← links)
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device (Q742507) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- Secret computation of purchase history data using somewhat homomorphic encryption (Q890595) (← links)
- Cryptanalysis of a public key cryptosystem based on Diophantine equations via weighted LLL reduction (Q1630230) (← links)
- LWE without modular reduction and improved side-channel attacks against BLISS (Q1633471) (← links)
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm (Q1643980) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- The closest vector problem in tensored root lattices of type A and in their duals (Q1692156) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- Post-quantum key exchange for the Internet and the open quantum safe project (Q1698609) (← links)
- An efficient quantum somewhat homomorphic symmetric searchable encryption (Q1705121) (← links)
- Assessing the feasibility of single trace power analysis of Frodo (Q1726676) (← links)
- Analysis of error-correcting codes for lattice-based key exchange (Q1726688) (← links)
- Provably secure NTRUEncrypt over any cyclotomic field (Q1726689) (← links)
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes (Q1746962) (← links)
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption (Q1746967) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- Functional encryption for cubic polynomials and implementation (Q1981766) (← links)
- A simple provably secure AKE from the LWE problem (Q1992397) (← links)
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes (Q2023314) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- Towards isogeny-based password-authenticated key establishment (Q2027265) (← links)
- Discretisation and product distributions in ring-LWE (Q2027267) (← links)
- (In)security of ring-LWE under partial key exposure (Q2027270) (← 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)
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes (Q2055644) (← links)
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes (Q2055683) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- On the integer polynomial learning with errors problem (Q2061918) (← links)
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
- LWE from non-commutative group rings (Q2068391) (← links)
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model (Q2072076) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP (Q2096523) (← links)
- Rounding in the rings (Q2096527) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- Practical product proofs for lattice commitments (Q2096537) (← links)
- Revocable hierarchical attribute-based signatures from lattices (Q2096621) (← links)
- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation (Q2096626) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
