Accelerating HE operations from key decomposition technique

DOI10.1007/978-3-031-38551-3_3MaRDI QIDQ6190098zbMATH OpenOpenAlexFDO

Authors Miran Kim, Dong Won Lee, 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

zbMATH Keywords

homomorphic encryptionexternal productgadget decomposition

Mathematics Subject Classification ID

Cryptography (94A60) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38)

Recommendations

• Faster fully homomorphic encryption
• Faster homomorphic linear transformations in HElib
• Revisiting homomorphic encryption schemes for finite fields
• (Leveled) fully homomorphic encryption without bootstrapping
• FHEW: bootstrapping homomorphic encryption in less than a second

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A full RNS variant of FV like somewhat homomorphic encryption schemes
• A full RNS variant of approximate homomorphic encryption
• An improved RNS variant of the BFV homomorphic encryption scheme
• Better bootstrapping for approximate homomorphic encryption
• Bootstrapping for approximate homomorphic encryption
• Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
• Efficient homomorphic comparison methods with optimal complexity
• FHEW: bootstrapping homomorphic encryption in less than a second
• Faster homomorphic linear transformations in HElib
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption using ideal lattices
• HEAWS: An Accelerator for Homomorphic Encryption on the Amazon AWS FPGA
• High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
• High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Homomorphic evaluation of the AES circuit
• Improved bootstrapping for approximate homomorphic encryption
• Numerical method for comparison on homomorphically encrypted numbers
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• TFHE: fast fully homomorphic encryption over the torus

Cited in

(2)

• Practical randomized lattice gadget decomposition with application to FHE
• \textsf{Plover}: masking-friendly hash-and-sign lattice signatures

This page was built for publication: Accelerating HE operations from key decomposition technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190098)