Low Communication Threshold Fully Homomorphic Encryption

Low Communication Threshold Fully Homomorphic Encryption

연구 분야: Cryptography

학회: International Conference on the Theory and Application of Cryptology and Information Security

This work investigates constructions of threshold fully homomorphic encryption with low communication, i.e., with small output ciphertexts and small partial decryption shares. In this context, we discuss in detail the technicalities for achieving full-fledged threshold FHE, and put forward limitations regarding prior works, including an attack against the recent construction of Boudgoust and Scholl [ASIACRYPT 2023]. In light of our observations, we generalize the definition of threshold fully homomorphic encryption by adding an algorithm which allows to introduce additional randomness in ciphertexts before they are decrypted by parties. In this setting, we are able to propose a construction which offers small ciphertexts and small decryption shares.