Pages that link to "Item:Q2826066"
From MaRDI portal
The following pages link to (Leveled) fully homomorphic encryption without bootstrapping (Q2826066):
Displaying 50 items.
- Polly cracker, revisited (Q285245) (← links)
- Homomorphic AES evaluation using the modified LTV scheme (Q310240) (← links)
- Quantum fully homomorphic encryption scheme based on universal quantum circuit (Q496935) (← links)
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES (Q499658) (← links)
- Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service (Q680776) (← links)
- Cryptanalysis of a homomorphic encryption scheme (Q680918) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- Lattice-based proof of shuffle and applications to electronic voting (Q826259) (← links)
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Secret computation of purchase history data using somewhat homomorphic encryption (Q890595) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Practical private-key fully homomorphic encryption in rings (Q1647860) (← links)
- Homomorphic lower digits removal and improved FHE bootstrapping (Q1648799) (← links)
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data (Q1648801) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- Fixed-point arithmetic in SHE schemes (Q1698658) (← links)
- A full RNS variant of FV like somewhat homomorphic encryption schemes (Q1698661) (← links)
- Security considerations for Galois non-dual RLWE families (Q1698662) (← links)
- An efficient quantum somewhat homomorphic symmetric searchable encryption (Q1705121) (← links)
- STP-LWE: A variant of learning with error for a flexible encryption (Q1718158) (← links)
- A full RNS variant of approximate homomorphic encryption (Q1726685) (← links)
- Unsupervised Machine Learning on encrypted data (Q1726695) (← links)
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes (Q1746962) (← links)
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
- The multiplicative complexity of 6-variable Boolean functions (Q1755188) (← links)
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE (Q2001181) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Homomorphic encryption systems statement: trends and challenges (Q2026280) (← links)
- Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model (Q2031043) (← links)
- Boolean functions with multiplicative complexity 3 and 4 (Q2040305) (← links)
- SPEED: secure, private, and efficient deep learning (Q2051270) (← links)
- Optimal broadcast encryption from pairings and LWE (Q2055600) (← links)
- Impossibility results for lattice-based functional encryption schemes (Q2055607) (← links)
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes (Q2055683) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- An efficient CCA-secure access control encryption for any policy (Q2057135) (← links)
- On the integer polynomial learning with errors problem (Q2061918) (← links)
- Bootstrapping fully homomorphic encryption over the integers in less than one second (Q2061925) (← links)
- Flexible and efficient verifiable computation on encrypted data (Q2061972) (← links)
- LWE from non-commutative group rings (Q2068391) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Keyed-fully homomorphic encryption without indistinguishability obfuscation (Q2096599) (← links)
- Covert authentication from lattices (Q2096622) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- Efficient homomorphic conversion between (ring) LWE ciphertexts (Q2117044) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
