Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption

DOI10.1007/978-981-99-8736-8_2MaRDI QIDQ6605316zbMATH OpenFDO

Authors Joon Woo Lee, Eunsang Lee, Young-Sik Kim, Jong-Seon No

Publication date 13 September 2024

zbMATH Keywords

fully homomorphic encryptionprivacy-preserving machine learningBrakerski/Fan-Vercauteran (BFV) schemesCheon-Kim-Kim-Song (CKKS) schemeshierarchical rotation key

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Privacy of data (68P27)

Recommendations

• Fast homomorphic evaluation of deep discretized neural networks
• Fully homomorphic encryption using ideal lattices
• Research based on batch fully homomorphic encryption-symmetric encryption
• Fast blind rotation for bootstrapping FHEs
• Homomorphic evaluation of lattice-based symmetric encryption schemes

Cites work

• A full RNS variant of approximate homomorphic encryption
• Algorithms in HElib
• Better bootstrapping for approximate homomorphic encryption
• Bootstrapping for approximate homomorphic encryption
• Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
• Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
• Faster homomorphic linear transformations in HElib
• Finding and evaluating parameters for BGV
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• 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
• How to simulate it -- a tutorial on the simulation proof technique
• Improved bootstrapping for approximate homomorphic encryption
• Optimum branchings
• Transciphering framework for approximate homomorphic encryption
• \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption

This page was built for publication: Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption

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