<![CDATA[Electronic voting (e-voting) is presented as a digital solution to replace the conventional election system where the process of recording, storing, and calculating voter vote data will be done digitally, with the aim of accelerating the vote recapitulation process and minimizing human errors. In its implementation, strict security guarantees are required for crucial aspects such as voter anonymity and vote integrity from manipulation in its implementation. To address these challenges, this study proposes a network-based e-voting model integrated with four cryptographic pillars: the AES-256 algorithm used to encrypt vote data symmetrically and ensure the confidentiality of each individual's choices efficiently; the RSA-2048 algorithm, an asymmetric cryptographic system used to secure AES key exchange and provide authentication for each data transaction; and the Blind Signature scheme that allows the server to verify and sign votes without knowing their contents, thus effectively separating the voter's identity from his or her choice. Experimental results show that the proposed system successfully meets five fundamental security properties: anonymity (deanonymization probability ≈ 1/2²⁰⁴⁸ ≈ 3.23 × 10⁻⁶¹⁷), integrity (100% manipulation detection rate via HMAC-SHA256), confidentiality (via AES-256-CBC double encryption), legitimacy (via voter registration verification), and singleness (100% prevention of duplicate voting). Performance evaluations show an average processing time of 763 milliseconds per voter, confirming that the level of cryptographic security does not compromise the overall system responsiveness. With this architecture, the proposed model not only promises a more efficient election process but also increases the level of public trust through a transparent and cryptographically secure system.]]>
Copyrights © 2026
