(Batch) fully homomorphic encryption over integers for non-binary message spaces
From MaRDI portal
Recommendations
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
- Batch fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- FHE over the integers and modular arithmetic circuits
Cited in
(12)- Homomorphic lower digits removal and improved FHE bootstrapping
- FHE over the integers and modular arithmetic circuits
- Polynomial expressions of \(p\)-ary auction functions
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Multi-bit leveled homomorphic encryption via dual LWE-based
- Towards constructing fully homomorphic encryption without ciphertext noise from group theory
- Provably secure (broadcast) homomorphic signcryption
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- Fully homomorphic encryption scheme and Fermat’s little theorem
- On compression functions over groups with applications to homomorphic encryption
- A new scale-invariant homomorphic encryption scheme
This page was built for publication: (Batch) fully homomorphic encryption over integers for non-binary message spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948343)