Efficient and Secure Certificateless Aggregate Signature-Based Authentication Scheme for Vehicular <i>Ad Hoc</i> Networks

Gowri, T.; Rao, G. Srinivasa; Reddy, P. Jayarama; Gayathri, N.; Reddy, D. V. Rama Koti; Padmavathamma, M.

doi:10.1109/jiot.2020.3019304

Cited by 85 publications

(64 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the length of signature is 2|G 1 | + H, where H is hash function's output. The length of signature in scheme [38,34,36,39] is 2|G 1 |, which is little less than our scheme. However, our scheme not only provides lower computational cost in the aggregate signature verification phase, but also has unconditional anonymity compared with other CLAS schemes.…”

Section: Communication Costmentioning

confidence: 76%

“…Let the ring size n = 10, as shown in Figure 2, it is clear that our CLARS scheme have the less computational cost in aggregate verification among the schemes of Zhang et al [38], Cheng et al [34], Kumar et al [36] and Thumbur et al [39]. Zhang et al [38] 3Ts + T h 4Tp (3 + n)Tp + 2nT h Cheng et al [34] 4Ts 3Tp + 2Ts 3Tp + 2nTs Kumar et al [36] 3Ts 3Tp + 3Ts 3Tp + nTs Thumbur et al [39] Ts 2Tp + 3Ts (3n − 1)Tp + (2n + 1)Ts Our scheme 2Ts 2Tp + Ts 2Tp + nTs Fig. 2 Computational cost comparison…”

Section: Computation Costmentioning

confidence: 94%

See 1 more Smart Citation

A Lightweight Certificateless Aggregate Ring Signature Scheme for Privacy-preserving in Smart Grids

Wang

Wen

et al. 2021

Preprint

View full text Add to dashboard Cite

There exists a problem of user privacy leakage in the smart grids (SGs) that malicious attackers may intercept or tamper with electricity data and associate the stolen data with real users to commit crimes. Besides, node equipment resources in the SGs are limited. Aiming at the problems above, most of the existing privacy-preserving schemes apply aggregate signature to ensure the integrity of message and improve communication efficiency. However, they cannot realize the anonymity of users to block link attacks, and most of the aggregate signature verification has a high computational cost. Therefore, we propose a certificateless aggregate ring signature (CLARS) scheme based on computational Diffie-Hellman problem and decisional Diffie-Hellman problem. Our scheme is suitable for privacy-preserving in SGs. In this scheme, certificateless cryptosystem is used to avoid key escrow and certificates management problems and ring signature is used to ensure the unconditional anonymity of users. In addition, our scheme is proved to be unforgeability and unconditional anonymity under adaptively chosen message attacks against Type I and Type II adversaries in the random oracle model. Compared with previous certificateless aggregate signature (CLAS) schemes, our CLARS scheme has lower computational cost, which only needs two pairing operations.

show abstract

Section: Communication Costmentioning

confidence: 76%

Section: Computation Costmentioning

confidence: 94%

A Lightweight Certificateless Aggregate Ring Signature Scheme for Privacy-preserving in Smart Grids

Wang

Wen

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…AC2P or PICS is denoted by E, and all other components are said to be C. And let the topology is true mesh Z(Z-1)/2 where Z=N / +M+|C, L denotes key length, W is the message size, s, t, and x are system param of size smaller than N. Suppose the mesh includes two drones except cluster head, then the evaluation results given are: the data sending rate is 2NW+L+W, the computation overhead is 2O(n), and the storage overhead is L, param. So, by comparing the proposed scenarios with [41], [45], [46], [55] and [56], it is clear that our method is better, whereas I represent data rate, II represents computational overheads, and III for storage overheads; as shown in Table III. (n-1)Tβ+2Tѱ (n-1)Tα-(n-1)Tβ+(2n-1)Tχ nTα+3Tβ+Tχ 3Tβ+ Tѱ+2GTx ----(n-1)Tα+Tβ+Tχ IV (n-1)Tα+(n-1)Tx (n-1)Tα-(n-1)Tβ+(2n-1)Tχ nTα+3Tβ+Tχ 2 Tβ 1Tα+n Tβ (n-1)Tα+Tβ+Tχ…”

Section: Performance and Comparison Analysismentioning

confidence: 96%

“…Suppose, Tα is the time required for the execution of multiplication, Tβ is the time for generating bilinear paring from a map, Tγ represents exponentiation execution time in bilinearity, and Tѱ, the execution of addition in random number group. So, the performance comparison analysis for the proposed scheme with [41], [45], [46], [55] and [56] as show in table II. Where I denote the data broadcasting between AC2P/PICS → Reconnaissance Drone, II: AC2P/PICS→ Attacking Drone, III: Reconnaissance Drone → AC2P/PICS, and IV: Attacking Drone → AC2P/PICS.…”

Section: Performance and Comparison Analysismentioning

confidence: 99%

Identity and Aggregate Signature-Based Authentication Protocol for IoD Deployment Military Drone

Jan

Khan²

2021

IEEE Access

View full text Add to dashboard Cite

With the rapid miniaturization in sensor technology, ruddervator, arduino, and multi-rotor system, drone technology catches much attention of the researchers. It can be controlled remotely by a seated operator sitting to a powerful intelligence computer system (PICS) or an airborne control and command platform (AC2P). The two types of drones (reconnaissance and attacking) can communicate with each other and with the PICS or AC2P through wireless network channels referred to as Flying Ad Hoc Network or Unmanned Aerial Vehicular Network (FANET or UAVN). When the line of sight is broken, communication is mainly carried out through satellite using GPS (Global Positioning System) signals. Both GPS and UAVN/FANET use open network channels for data broadcasting, exposed to several threats, and its security is challenging for the researchers. Monitoring data transmission traffic, espionage, troop movement, border surveillance, searching and warfare battlefield phenomenon, etc., can auspiciously be achieved by developing a robust authentication scheme for IoD deployment military drone. Therefore, this research illustrates the designing of two separate protocols based on aggregate signature, identity, pairing cryptography, and Computational Diffie-Hellman Problem (CDHP) to guarantee data integrity, authorization, and confidentiality among drones and AC2P/PICS. The outdated data transmission flaw has also been tackled, which is frequently noted in prior protocols. The security of these protocols will formally be verified using a random oracle model (ROM), a real-or-random (ROR) model, and informally using pragmatic illustration and mathematical lemmas. Nonetheless, the performance analysis section will be executed using the algorithmic big-O notation. The results show that these protocols are verifiably protected in the Random Oracle Model (ROM) and Real-Or-Random (ROR) model using the CDHP.

show abstract

“…These characteristics have made biometrics adaptable to general use in authentication systems [23]. Based on the employed cryptographic mechanism, Lu et al [6] distinguished the privacy-preserving authentication scheme of VANETs into five categories, including public key infrastructure (PKI)-based [11,[24][25][26][27][28], symmetric cryptography-based [29][30][31], identity (ID)-based signature [32][33][34][35][36][37], certificateless signature (CLS)-based [38,39], and group signature-based [8,9,40].…”

Section: Introductionmentioning

confidence: 99%

An improved efficient anonymous authentication with conditional privacy-preserving scheme for VANETs

Cahyadi

Hwang

2021

PLoS ONE

View full text Add to dashboard Cite

The study of security and privacy in vehicular ad hoc networks (VANETs) has become a hot topic that is wide open to discussion. As the quintessence of this aspect, authentication schemes deployed in VANETs play a substantial role in providing secure communication among vehicles and the surrounding infrastructures. Many researchers have proposed a variety of schemes related to information verification and computation efficiency in VANETs. In 2018, Kazemi et al. proposed an evaluation and improvement work towards Azees et al.’s efficient anonymous authentication with conditional privacy-preserving (EAAP) scheme for VANETs. They claimed that the EAAP suffered from replaying attacks, impersonation attacks, modification attacks, and cannot provide unlinkability. However, we also found out if Kazemi et al.’s scheme suffered from the unlinkability issue that leads to a forgery attack. An adversary can link two or more messages sent by the same user by applying Euclid’s algorithm and derives the user’s authentication key. To remedy the issue, in this paper, we proposed an improvement by encrypting the message using a shared secret key between sender and receiver and apply a Nonce in the final message to guarantee the unlinkability between disseminated messages.

show abstract

Efficient and Secure Certificateless Aggregate Signature-Based Authentication Scheme for Vehicular Ad Hoc Networks

Cited by 85 publications

References 39 publications

A Lightweight Certificateless Aggregate Ring Signature Scheme for Privacy-preserving in Smart Grids

A Lightweight Certificateless Aggregate Ring Signature Scheme for Privacy-preserving in Smart Grids

Identity and Aggregate Signature-Based Authentication Protocol for IoD Deployment Military Drone

An improved efficient anonymous authentication with conditional privacy-preserving scheme for VANETs

Contact Info

Product

Resources

About