article · Mikailalsys Journal of Advanced Engineering International
A secure mobile voting framework combines elliptic curve cryptography with secure multiparty computation to safeguard confidentiality, integrity, and verifiability during elections. Voters authenticate through registered numbers, after which ballots are recorded as encrypted points on an elliptic curve. These encrypted votes are displayed on a public bulletin board accompanied by zero-knowledge proofs to establish validity without compromising ballot secrecy. Decryption authority is divided among multiple trusted parties using Shamir's secret sharing, which allows collective tallying while keeping individual selections completely hidden. The architecture unites elliptic curve discrete logarithm problem security, homomorphic encryption, and distributed secret sharing to lower computational overhead. Both theoretical analysis and experimental evaluations show notable gains in processing efficiency and scalability, demonstrating that the framework functions effectively within resource-constrained mobile environments while preserving security standards.
Running elections on mobile phones creates challenges in protecting voter privacy while proving results are legitimate. By combining efficient mathematical techniques with shared authority models, this approach allows trustworthy remote voting even on everyday mobile devices with limited processing power, preventing election officials or outside attackers from viewing individual votes or altering the outcome.
This technology could support mobile voting applications for election bodies, student unions, or membership organisations requiring tamper-proof remote polling. The research has undergone theoretical and experimental testing, demonstrating functional viability in resource-constrained settings. It sits at an applied research stage, meaning further development, software hardening, and real-world pilot deployments would be required before commercial adoption.
AI-generated from the published abstract. Always read the original work before citing.
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.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.58578/mjaei.v2i3.6804
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.
