Accelerating HE operations from key decomposition technique
From MaRDI portal
Publication:6190098
DOI10.1007/978-3-031-38551-3_3OpenAlexW4385654563MaRDI QIDQ6190098
Dongwon Lee, Miran Kim, Jinyeong Seo, Yongsoo Song
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38551-3_3
Cryptography (94A60) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38)
Cites Work
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Better bootstrapping for approximate homomorphic encryption
- Bootstrapping for approximate homomorphic encryption
- Faster homomorphic linear transformations in HElib
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- A full RNS variant of approximate homomorphic encryption
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- Numerical method for comparison on homomorphically encrypted numbers
- An improved RNS variant of the BFV homomorphic encryption scheme
- Improved bootstrapping for approximate homomorphic encryption
- TFHE: fast fully homomorphic encryption over the torus
- Homomorphic encryption for arithmetic of approximate numbers
- Efficient homomorphic comparison methods with optimal complexity
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- On Ideal Lattices and Learning with Errors over Rings
- HEAWS: An Accelerator for Homomorphic Encryption on the Amazon AWS FPGA
- Fully homomorphic encryption using ideal lattices
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Accelerating HE operations from key decomposition technique
