A Scheme of Robust Privacy-Preserving Multi-Party Computation Via Public Verification

Gai, Keke and Wang, Dongjue and Yu, Jing and Zhu, Liehuang and Meng, Weizhi (2025) A Scheme of Robust Privacy-Preserving Multi-Party Computation Via Public Verification. IEEE Transactions on Dependable and Secure Computing, 22 (5). pp. 4896-4910. ISSN 1545-5971

Text (TDSC-2024-02-0193.R1_Proof_hi)
TDSC-2024-02-0193.R1_Proof_hi.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (1MB)

Abstract

Multi-Party Computation (MPC), as a distributed computing paradigm, is considered to be a potential solution for providing privacy-preserving for applications following the client-server model. However, traditional MPC solutions cannot satisfy the publicly verifiable requirement of the client-server model. In this paper, we propose a blockchain-based verifiable MPC solution using Pedersen's threshold secret sharing and Lifted ElGamal encryption. We first build a data distribution method using Pedersen's threshold secret sharing and symmetric encryption to protect the privacy of inputs while ensuring robustness. Then, we propose a result processing algorithm using Lifted ElGamal encryption to safeguard the privacy of the outputs. Finally, we employ non-interactive zero-knowledge proof and Pedersen commitment to publicly verify the correctness of the encrypted outputs in the smart contract, enabling the detection of malicious parties. Theoretical analysis indicates that the proposed method can publicly verify the correctness of outputs without revealing plain-text inputs and outputs, which satisfy the privacy-preserving requirements of the client-server model. Experimental evaluations have demonstrated that our proposed approach is efficient regarding computation overhead, communication overhead, and response time in the output verification phase while achieving stronger privacy and robustness.