On the Hardness of Scheme-Switching Between SIMD FHE Schemes

DOI10.1007/978-3-031-40003-2_8MaRDI QIDQ6493387

Nathan Manohar, Nicholas Genise, Karim Eldefrawy

Publication date: 26 April 2024

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Better bootstrapping for approximate homomorphic encryption
• Homomorphic lower digits removal and improved FHE bootstrapping
• Bootstrapping for approximate homomorphic encryption
• Faster homomorphic linear transformations in HElib
• CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
• 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
• On the security of homomorphic encryption on approximate numbers
• Sine series approximation of the mod function for bootstrapping of approximate HE
• 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
• Homomorphic encryption for arithmetic of approximate numbers
• Fully homomorphic SIMD operations
• Efficient homomorphic comparison methods with optimal complexity
• Bootstrapping for BGV and BFV revisited
• (Leveled) fully homomorphic encryption without bootstrapping
• Practical Bootstrapping in Quasilinear Time
• Algorithms in HElib
• Fully Homomorphic Encryption with Polylog Overhead
• Better Bootstrapping in Fully Homomorphic Encryption
• Homomorphic Evaluation of the AES Circuit
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
• Bootstrapping for HElib
• Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
• On Ideal Lattices and Learning with Errors over Rings
• Additively Homomorphic Encryption with d-Operand Multiplications
• Evaluating Branching Programs on Encrypted Data
• Fully homomorphic encryption using ideal lattices
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
• EvalRound algorithm in CKKS bootstrapping
• Securing approximate homomorphic encryption using differential privacy
• Revisiting homomorphic encryption schemes for finite fields
• Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE

This page was built for publication: On the Hardness of Scheme-Switching Between SIMD FHE Schemes