Fully homomorphic encryption scheme based on public key compression and batch processing

DOI10.1007/978-3-319-75160-3_16MaRDI QIDQ1745035zbMATH OpenOpenAlexFDO

Authors Liquan Chen, Muyang Wang, Ming-Huat Lim

Publication date 20 April 2018

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

zbMATH Keywords

fully homomorphic encryptionbatch technologypublic key compressionquadratic parameter

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 6672298
• Efficient fully homomorphic encryption from (standard) LWE
• Fully homomorphic encryption from approximate ideal lattices
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption

Cited in

(6)

• An overview of torus fully homomorphic encryption
• Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption
• Efficient integer encoding for homomorphic encryption via ring isomorphisms
• Finding and evaluating parameters for BGV
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• TFHE public-key encryption revisited

This page was built for publication: Fully homomorphic encryption scheme based on public key compression and batch processing

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