This study proposes a secure mobile voting system that integrates elliptic curve cryptography (ECC) with secure multiparty computation (SMPC) to guarantee vote confidentiality, integrity, and verifiability. Designed to enable scalable, privacy-preserving elections via mobile devices, the system authenticates voters using registered numbers and records ballots as encrypted points on an elliptic curve. Encrypted votes are published on a public bulletin board alongside zero-knowledge proofs to ensure their validity. To safeguard decryption, Shamir’s secret sharing distributes keys among trusted authorities, enabling collective tallying without exposing individual votes. The system incorporates ECC-based secret sharing, homomorphic encryption, and zero-knowledge proofs, leveraging the hardness of the elliptic curve discrete logarithm problem (ECDLP) for robust security. Both experimental and theoretical evaluations demonstrate that ECC significantly improves computational efficiency and scalability, making the system well-suited for resource-constrained environments. Overall, the integration of ECC and SMPC offers a practical, efficient, and secure framework for mobile elections, effectively balancing privacy, security, and performance.
Domven et al. (Fri,) studied this question.