Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
From MaRDI portal
Recommendations
- Faster homomorphic evaluation of discrete Fourier transforms
- Accelerating homomorphic computations on rational numbers
- Accelerating homomorphic evaluation on reconfigurable hardware
- Faster fully homomorphic encryption
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- On Faster Integer Calculations Using Non-arithmetic Primitives
- Accelerating integer based fully homomorphic encryption using frequency domain multiplication
- Optimised Multiplication Architectures for Accelerating Fully Homomorphic Encryption
- Efficient computation outsourcing for inverting a class of homomorphic functions
Cited in
(11)- Bootstrapping for approximate homomorphic encryption
- Accelerating homomorphic evaluation on reconfigurable hardware
- Homomorphic lower digits removal and improved FHE bootstrapping
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data
- When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead
- Efficiently processing complex-valued data in homomorphic encryption
- PIE: p-adic encoding for high-precision arithmetic in homomorphic encryption
- Privacy-friendly forecasting for the smart grid using homomorphic encryption and the group method of data handling
- Faster homomorphic evaluation of discrete Fourier transforms
- An efficient technique for obtaining unate implementation of functions through input encoding
- A full RNS variant of approximate homomorphic encryption
This page was built for publication: Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114651)
