Verifiable Threshold Multi-Party Fully Homomorphic Encryption from Share Resharing
Threshold multi-party fully homomorphic encryption (TMFHE) schemes enable efficient computation to be performed on sensitive data while maintaining privacy. These schemes allow a subset of parties to perform threshold decryption of evaluation results via a distributed protocol without the need for a...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-04-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/15/9/4745 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850155776286392320 |
|---|---|
| author | Yuqi Xie Ruwei Huang Junbin Qiu |
| author_facet | Yuqi Xie Ruwei Huang Junbin Qiu |
| author_sort | Yuqi Xie |
| collection | DOAJ |
| description | Threshold multi-party fully homomorphic encryption (TMFHE) schemes enable efficient computation to be performed on sensitive data while maintaining privacy. These schemes allow a subset of parties to perform threshold decryption of evaluation results via a distributed protocol without the need for a trusted dealer, and provide a degree of fault tolerance against a set of corrupted parties. However, existing TMFHE schemes can only provide correctness and security against honest-but-curious parties. We construct a compact TMFHE scheme based on the Learning with Errors (LWE) problem. The scheme applies Shamir secret sharing and share resharing to support an arbitrary t-out-of-N threshold access structure, and enables non-interactive reconstruction of secret key shares using additive shares derived from the current set of online participants. Furthermore, the scheme implements commitment and non-interactive zero-knowledge (NIZK) proof techniques to verify the TMFHE operations. Finally, our experiments demonstrate that the proposed scheme achieves active security against malicious adversaries. It overcomes the limitation of existing TMFHE schemes that can only guarantee correct computation under passive semi-honest adversaries. |
| format | Article |
| id | doaj-art-65f765361e6948fd87a2e3b9fd4e2492 |
| institution | OA Journals |
| issn | 2076-3417 |
| language | English |
| publishDate | 2025-04-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj-art-65f765361e6948fd87a2e3b9fd4e24922025-08-20T02:24:47ZengMDPI AGApplied Sciences2076-34172025-04-01159474510.3390/app15094745Verifiable Threshold Multi-Party Fully Homomorphic Encryption from Share ResharingYuqi Xie0Ruwei Huang1Junbin Qiu2School of Computer and Electronic Information, Guangxi University, Nanning 530004, ChinaSchool of Computer and Electronic Information, Guangxi University, Nanning 530004, ChinaSchool of Computer and Electronic Information, Guangxi University, Nanning 530004, ChinaThreshold multi-party fully homomorphic encryption (TMFHE) schemes enable efficient computation to be performed on sensitive data while maintaining privacy. These schemes allow a subset of parties to perform threshold decryption of evaluation results via a distributed protocol without the need for a trusted dealer, and provide a degree of fault tolerance against a set of corrupted parties. However, existing TMFHE schemes can only provide correctness and security against honest-but-curious parties. We construct a compact TMFHE scheme based on the Learning with Errors (LWE) problem. The scheme applies Shamir secret sharing and share resharing to support an arbitrary t-out-of-N threshold access structure, and enables non-interactive reconstruction of secret key shares using additive shares derived from the current set of online participants. Furthermore, the scheme implements commitment and non-interactive zero-knowledge (NIZK) proof techniques to verify the TMFHE operations. Finally, our experiments demonstrate that the proposed scheme achieves active security against malicious adversaries. It overcomes the limitation of existing TMFHE schemes that can only guarantee correct computation under passive semi-honest adversaries.https://www.mdpi.com/2076-3417/15/9/4745multi-party fully homomorphic encryptionshare resharingcommitmentsnon-interactive zero-knowledge proofsmalicious adversary |
| spellingShingle | Yuqi Xie Ruwei Huang Junbin Qiu Verifiable Threshold Multi-Party Fully Homomorphic Encryption from Share Resharing Applied Sciences multi-party fully homomorphic encryption share resharing commitments non-interactive zero-knowledge proofs malicious adversary |
| title | Verifiable Threshold Multi-Party Fully Homomorphic Encryption from Share Resharing |
| title_full | Verifiable Threshold Multi-Party Fully Homomorphic Encryption from Share Resharing |
| title_fullStr | Verifiable Threshold Multi-Party Fully Homomorphic Encryption from Share Resharing |
| title_full_unstemmed | Verifiable Threshold Multi-Party Fully Homomorphic Encryption from Share Resharing |
| title_short | Verifiable Threshold Multi-Party Fully Homomorphic Encryption from Share Resharing |
| title_sort | verifiable threshold multi party fully homomorphic encryption from share resharing |
| topic | multi-party fully homomorphic encryption share resharing commitments non-interactive zero-knowledge proofs malicious adversary |
| url | https://www.mdpi.com/2076-3417/15/9/4745 |
| work_keys_str_mv | AT yuqixie verifiablethresholdmultipartyfullyhomomorphicencryptionfromshareresharing AT ruweihuang verifiablethresholdmultipartyfullyhomomorphicencryptionfromshareresharing AT junbinqiu verifiablethresholdmultipartyfullyhomomorphicencryptionfromshareresharing |