Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes

DOI10.1007/978-3-319-99807-7_16MaRDI QIDQ6108618zbMATH OpenFDO

Authors Sergiu Carpov, Oana Stan

Publication date 30 June 2023

Published in Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99807-7_16

zbMATH Keywords

ciphertextHE schemehomomorphic domainhomomorphic encryption (HE)polynomial evaluation method

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Accelerating homomorphic evaluation on reconfigurable hardware
• Practical homomorphic encryption over the integers for secure computation in the cloud
• Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes
• Fully homomorphic encryption with polylog overhead
• New techniques for multi-value input homomorphic evaluation and applications

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• Algorithms in HElib
• Bootstrapping for HElib
• Efficient evaluation of large polynomials
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption with polylog overhead
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic SIMD operations
• Generation of optimal code for expressions via factorization
• ML confidential: machine learning on encrypted data
• On ideal lattices and learning with errors over rings
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Packed homomorphic encryption based on ideal lattices and its application to biometrics
• Practical packing method in somewhat homomorphic encryption

Cited in

(2)

• On constructing homomorphic encryption schemes from coding theory
• Efficient and Secure Evaluation of Multivariate Polynomials and Applications

This page was built for publication: Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes

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