Threshold Homomorphic Encryption From Provably Secure NTRU

Page view(s)
15
Checked on Jan 27, 2023
Threshold Homomorphic Encryption From Provably Secure NTRU
Title:
Threshold Homomorphic Encryption From Provably Secure NTRU
Other Titles:
The Computer Journal
Publication Date:
11 September 2022
Citation:
Xu, K., Hong Meng Tan, B., Wang, L.-P., Mi Mi Aung, K., & Wang, H. (2022). Threshold Homomorphic Encryption From Provably Secure NTRU. The Computer Journal. https://doi.org/10.1093/comjnl/bxac126
Abstract:
Abstract Homomorphic Encryption (HE) supports computation on encrypted data without the need to decrypt, enabling secure outsourcing of computing to an untrusted cloud. Motivated by application scenarios where private information is offered by different data owners, Multi-Key Homomorphic Encryption (MKHE) and Threshold Homomorphic Encryption (ThHE) were proposed. Unlike MKHE, ThHE schemes do not require expensive ciphertext extension procedures and are therefore as efficient as their underlying single-key HE schemes. In this work, we propose a novel NTRU-type ThHE scheme which caters to the computation scenarios with pre-defined participants. In addition to inheriting the simplicity of NTRU scheme, our construction has no expensive relinearization and correspondingly no costly evaluation keys. Controlling noise to make it increase linearly and then using a wide key distribution, our scheme is immune to the subfield lattice attacks and its security follows from the hardness of the standard R-LWE problem. Finally, based on the {0,1}-linear secret sharing and noise flooding techniques, we design a single round distributed threshold decryption protocol, where the decryption is able to be completed even when only given a subset (say $t$-out-of-$k$) of partial decryptions. To the best of our knowledge, our construction is the first NTRU-type ThHE scheme.
License type:
Publisher Copyright
Funding Info:
This research / project is supported by the A*STAR - Advanced Manufacturing and Engineering (AME) Programmatic Programme
Grant Reference no. : A19E3b0099

The work was supported by the National Natural Science Foundation of China (Grant No. 61872355).
Description:
This is a pre-copyedited, author-produced version of an article accepted for publication in The Computer Journalfollowing peer review. The version of record Xu, K., Hong Meng Tan, B., Wang, L.-P., Mi Mi Aung, K., & Wang, H. (2022). Threshold Homomorphic Encryption From Provably Secure NTRU. The Computer Journal. https://doi.org/10.1093/comjnl/bxac126 is available online at: doi.org/10.1093/comjnl/bxac126
ISSN:
0010-4620
1460-2067
Files uploaded:

File Size Format Action
thhe.pdf 433.27 KB PDF Request a copy