A practical TFHE-based multi-key homomorphic encryption with linear complexity and low noise growth

DOI10.1007/978-3-031-50594-2_1MaRDI QIDQ6550607zbMATH OpenFDO

Authors Yavuz Akın, Jakub Klemsa, Melek Önen

Publication date 5 June 2024

zbMATH Keywords

multi-key homomorphic encryptionsecure cloud computingTFHE scheme

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer security (68M25)

Recommendations

• Multi-key homomorphic encryption from TFHE
• On the security of multikey homomorphic encryption
• Multi-key fully-homomorphic encryption in the plain model
• Lattice-based fully dynamic multi-key FHE with short ciphertexts
• Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension

Cites work

• Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension
• Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption for arithmetic of approximate numbers
• Lattice-based fully dynamic multi-key FHE with short ciphertexts
• Multi-identity and multi-key leveled FHE from learning with errors
• Multi-key FHE from LWE, revisited
• Multi-key homomorphic encryption from TFHE
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the concrete hardness of learning with errors
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• TFHE: fast fully homomorphic encryption over the torus
• Two round multiparty computation via multi-key FHE

This page was built for publication: A practical TFHE-based multi-key homomorphic encryption with linear complexity and low noise growth

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