An ECC-Based Digital Signature Scheme for Privacy Protection in Wireless Communication Network

Abstract

Aiming at the security problems of wireless communication network and the shortcomings of Elliptic Curve Digital Signature Algorithm (ECDSA), this paper designed a forward secure digital signature scheme and proved that the scheme has forward security and unforgeability in the random oracle model. Experimental simulations are done in this paper, and the results show that the proposed scheme has the highest efficiency compared with the ECDSA scheme and the three existing forward secure schemes. This scheme not only meets the forward security and protects the users’ privacies but also reduces the requirement of computing power of the user in the wireless communication network.

An Efficient Certificateless Forward-Secure Signature Scheme for Secure Deployments of the Internet of Things

“…), and elliptic curve multiplication (E CM) in the proposed scheme and those of Kim et al [21], Oh et al [22], Ko et al [23], and Zhang et al [26], respectively. The comparative outcomes are presented in Table 2, based on major operations in the proposed scheme and those of Kim et al [21], Oh et al [22], Ko et al [23], and Zhang et al [26].…”

“…), and elliptic curve multiplication (E CM) in the proposed scheme and those of Kim et al [21], Oh et al [22], Ko et al [23], and Zhang et al [26], respectively. The comparative outcomes are presented in Table 2, based on major operations in the proposed scheme and those of Kim et al [21], Oh et al [22], Ko et al [23], and Zhang et al [26]. The analysis based on time in milliseconds (ms) is included in Table 3, between Kim et al [21], Oh et al [22], Ko et al [23], and Zhang et al [26], and the proposed scheme.…”

“…The session key generation is dynamic, which could be changed in every session, which makes the scheme resistant to known session key attacks and guarantees pure forward secrecy. In 2022, based on an elliptic curve, a forward-secure digital signature scheme was proposed by Ping et al [26] for privacy protection in wireless communication networks and proved its forward security and unforgeability in the random oracle model. However, this scheme suffers from three major flaws: (1) high computational cost, (2) more communication overhead, and (3) a key escrow problem.…”

“…The comparative outcomes are presented in Table 2, based on major operations in the proposed scheme and those of Kim et al [21], Oh et al [22], Ko et al [23], and Zhang et al [26]. The analysis based on time in milliseconds (ms) is included in Table 3, between Kim et al [21], Oh et al [22], Ko et al [23], and Zhang et al [26], and the proposed scheme. Note that we have calculated the values used in Table 3 based on the experimental setup of [28], which includes hardware and software specifications such as a PC Intel Corei7, random access memory (RAM) of 8 GB, and a multi-precision integer and rational arithmetic C library, in which Xe needs 1.…”

A Study on Efficient Information Security using Elliptic Curves

“…According to the study, the revised system is ideal for wireless communication networks, providing excellent security and efficiency. Recent work concentrate on implementing the system in real-world wireless communication network environments [31].…”