Malathi, V. and R, R. (2025) Elliptic curve Menezes–Qu–Vanstone-based message authentication code (ECMQV-MAC) with blockchain technology for e-voting systems. International Journal of System Assurance Engineering and Management. ISSN 09756809
Full text not available from this repository.Abstract
For secure electronic vote transmission, a blockchain (BC)-based electronic voting (e-voting) system that uses the Elliptic Curve Menezes–Qu–Vanstone-based Message Authentication Code (ECMQV-MAC) algorithm is presented in this study. Among the several obstacles that e-voting must overcome are issues of authenticity, confidentiality, data integrity, openness, and credibility. However, BC technology (BCT), which was standard over a decade ago, suggests new solutions to numerous complications. Remote authentication, anonymity, and end-to-end (E2E) verification are all unresolved complications. An e-voting system utilizing BC Network (BCN) can securely store votes in shared, decentralized, and distributed ledgers. Votes stored in the BCN are immutable and transparent. However, electronic votes can be tampered during online transmission from client to server. Cryptography algorithms can be used for the protected transmission of electronic votes. The proposed ECMQV-MAC Cryptography algorithm combines Elliptic Curve Cryptography (ECC) and the Menezes–Qu–Vanstone (MQV) key agreement protocol to ensure message authentication and integrity in polled voting. The ECMQV-MAC model was developed using MATLAB in an Amazon Elastic Computing Cloud simulation network, spanning a range of 100 to 500 nodes. The performance of the ECMQV-MAC algorithm was compared with other standard encryption algorithms, such as the Advanced Encryption Standard (AES) algorithm, Rivest Shamir Adelman (RSA) algorithm, Blowfish, and Data Encryption Standard (DES). Throughput (T), latency, encryption time (ET), decryption time (DT), computational time, privacy leakage, and security performance are used as performance metrics for evaluation. ECMQV-MAC algorithm reported maximum throughput of 1876.11 kbps, minimum latency of 5.198 s, minimum encryption time of 7.333 ms, minimum decryption time of 15.784 ms, minimum computation time of 21.56 ms, minimum privacy leakage of 40.76%, and highest security performance measure of 96.18% with 500 nodes. Results show that ECMQV-MAC reported better results compared to other standard algorithms, such as AES, RSA, Blowfish, and DES. Hence, the ECMQV-MAC algorithm can be used for the protected transmission of electronic votes in a BC-based e-voting system. © The Author(s) under exclusive licence to The Society for Reliability Engineering, Quality and Operations Management (SREQOM), India and The Division of Operation and Maintenance, Lulea University of Technology, Sweden 2025.
| Item Type: | Article |
|---|---|
| Depositing User: | Unnamed user with email techsupport@mosys.org |
| Date Deposited: | 16 Dec 2025 09:58 |
| Last Modified: | 16 Dec 2025 10:02 |
| URI: | https://ir.vmrfdu.edu.in/id/eprint/5626 |
Dimensions
Dimensions