Electronic Voting Scheme Based on Secure Multi-Party Computation

With advances in Internet technology, electronic voting (e-voting) offers convenience and efficiency but faces privacy challenges. We propose an efficient e-voting scheme based on Secure Multi-Party Computation (MPC) that supports weighted and score-based voting under PLURALITY, RANGE, APPROVAL, VETO, and BORDA rules. Security properties—integrity, accuracy, confidentiality, uniqueness, eligibility, fairness, and anonymity—are ensured via identity authentication, homomorphic encryption, and Private Set Intersection (PSI). Compared with traditional schemes, the proposed scheme reduces communication overhead and boosts computational efficiency by applying dynamic cost adjustment through secure data truncation in PSI and ciphertext batching via ballot reorganization and polynomial packing in homomorphic encryption. Security analysis confirms safety under the semi-honest model. The simulation reports that the authentication time is about 307 milliseconds, and the encryption and communication time is about 198 milliseconds.The proposed scheme is therefore more flexible, secure and efficient.