HERDS: multi-key fully homomorphic encryption with sublinear bootstrapping

DOI10.1007/978-3-032-25327-9_8MaRDI QIDQ7304112zbMATH OpenFDO

Authors Binwu Xiang, Seonhong Min, Intak Hwang, Zhiwei Wang, Haoqi He, Yuanju Wei, Kang Yang, Jiang Zhang, Yi Deng, Yu Yu

Publication date 24 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-25327-9_8

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A practical TFHE-based multi-key homomorphic encryption with linear complexity and low noise growth
• Adding distributed decryption and key generation to a ring-LWE based CCA encryption scheme
• An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
• Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Low communication threshold FHE from standard (module-)LWE
• Low communication threshold fully homomorphic encryption
• Multi-identity and multi-key leveled FHE from learning with errors
• Multi-key FHE from LWE, revisited
• Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
• Multi-key homomorphic encryption from TFHE
• Multiparty computation with low communication, computation and interaction via threshold FHE
• NTRU-based bootstrapping for MK-FHEs without using overstretched parameters
• Oblivious message retrieval
• 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
• Revisiting key decomposition techniques for FHE: simpler, faster and more generic
• Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
• TFHE: fast fully homomorphic encryption over the torus
• Threshold fully homomorphic encryption over the torus
• Tiresias: large scale, UC-secure threshold Paillier
• Towards practical multi-key TFHE: parallelizable, key-compatible, quasi-linear complexity
• Two round multiparty computation via multi-key FHE

This page was built for publication: HERDS: multi-key fully homomorphic encryption with sublinear bootstrapping

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