Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM
From MaRDI portal
Publication:832329
DOI10.1007/978-3-030-81652-0_3zbMath1485.94122OpenAlexW3184762043MaRDI QIDQ832329
Jonathan Takeshita, Dayane Reis, Michael Niemier, Taeho Jung, Ting Gong, Xiaobo Sharon Hu
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81652-0_3
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Accelerating homomorphic evaluation on reconfigurable hardware
- Accelerating LTV based homomorphic encryption in reconfigurable hardware
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- Speeding up the number theoretic transform for faster ideal lattice-based cryptography
- An improved RNS variant of the BFV homomorphic encryption scheme
- Homomorphic encryption for arithmetic of approximate numbers
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Bootstrapping for HElib
- A Custom Accelerator for Homomorphic Encryption Applications
- Fast base extension using a redundant modulus in RNS
- ASYMPTOTIC PROPERTIES OF THE MAXIMUM LIKELIHOOD ESTIMATOR FOR STOCHASTIC PARABOLIC EQUATIONS WITH ADDITIVE FRACTIONAL BROWNIAN MOTION
- A study of the residue-to-binary converters for the three-moduli sets
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Discrete Convolutions via Mersenne Transforms
This page was built for publication: Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM