Faster homomorphic linear transformations in HElib

DOI10.1007/978-3-319-96884-1_4MaRDI QIDQ1673382zbMATH OpenOpenAlexFDO

Authors Shai Halevi, Victor Shoup

Publication date 12 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-96884-1_4

zbMATH Keywords

implementationlinear transformationshomomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Practical bootstrapping in quasilinear time
• FHEW: bootstrapping homomorphic encryption in less than a second
• Algorithms in HElib
• Bootstrapping for helib
• Bootstrapping for HElib

Cited in

(32)

• Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields
• Bootstrapping with RMFE for fully homomorphic encryption
• Faster BGV bootstrapping for power-of-two cyclotomics through homomorphic NTT
• Minimizing the number of bootstrappings in fully homomorphic encryption
• On the security of homomorphic encryption on approximate numbers
• Improved efficiency of a linearly homomorphic cryptosystem
• Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
• Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
• Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
• Practical dense-key bootstrapping with subring secret encapsulation
• On the security and privacy of CKKS-based homomorphic evaluation protocols
• Vive Galois! I: Optimal SIMD packing and packed bootstrapping for FHE
• HElib
• FASTA -- a stream cipher for fast FHE evaluation
• Encoding of rational numbers and their homomorphic computations for FHE-based applications
• Accelerating HE operations from key decomposition technique
• HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
• Bootstrapping for helib
• Maliciously secure matrix multiplication with applications to private deep learning
• Towards private deep learning-based side-channel analysis using homomorphic encryption. Opportunities and limitations
• Field instruction multiple data
• Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
• Faster amortized FHEW bootstrapping using ring automorphisms
• Optimisations and tradeoffs for HElib
• Algorithms in HElib
• Bootstrapping for BGV and BFV revisited
• Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused
• On the Hardness of Scheme-Switching Between SIMD FHE Schemes
• cuHE: a homomorphic encryption accelerator library
• Fast Hensel's lifting implementation using partial fraction decomposition
• Cheap and fast iterative matrix inverse in encrypted domain
• Secure outsourced matrix multiplication with fully homomorphic encryption

This page was built for publication: Faster homomorphic linear transformations in HElib

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