An efficient certificateless aggregate signature without pairing

Qu, Yunyun; Mu, Quanwu

doi:10.1504/ijesdf.2018.090961

Cited by 12 publications

(11 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…

{scriptA}_{1}

can replace the public or secret key of a user, but cannot obtain the master secret key of KGC.

{scriptA}_{2}

can access the master secret key of KGC, but cannot replace a user's public or secret key …”

Section: Security Model Cls and Clas Schemesmentioning

confidence: 99%

“…Theorem A CLAS scheme is provably‐secure provided no polynomial‐time adversaries

{scriptA}_{1}

and

{scriptA}_{2}

can win the games III and IV, respectively with a nonnegligible probability …”

Section: Security Model Cls and Clas Schemesmentioning

confidence: 99%

“…In Reference , the authors proposed a pairing‐based CLAS scheme and demonstrated that it is secure under the intractability of the computational Diffie‐Hellman (CDH) problem. A new CLAS scheme without bilinear pairing was proposed in Reference to address the efficiency issue in the previous schemes. Unfortunately, Du et al showed that the scheme in Reference is insecure against forgery attack by a type I adversary.…”

Section: Introductionmentioning

confidence: 99%

“…A new CLAS scheme without bilinear pairing was proposed in Reference to address the efficiency issue in the previous schemes. Unfortunately, Du et al showed that the scheme in Reference is insecure against forgery attack by a type I adversary. Yang et al put forward a short CLAS scheme based on bilinear pairing which can withstand coalition attacks.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On the security of privacy‐preserving authentication scheme with full aggregation in vehicular ad hoc network

Kamil

Ogundoyin²

2020

Security and Privacy

View full text Add to dashboard Cite

Certificateless aggregate signature (CLAS) scheme is a very important cryptographic technique used in many internet of things (IoT) applications like healthcare wireless sensor networks, industrial IoT, smart agriculture, and smart transportation to achieve privacy and integrity of transmitted information, and improved efficiency. Recently, a privacy-preserving authentication scheme based on CLAS scheme for secure communication in vehicular ad hoc network (VANET) which can achieve complete aggregation was proposed. The authors demonstrated that their scheme is semantically secure in the random oracle model based on the intractability of the computational Diffie-Hellman (CDH) problem under the consideration of type I and II attacks. However, by giving two concrete attacks, we show that the scheme is insecure in the standard security model. Consequently, we propose a fix by modifying the sign, verify, and aggregate-verify algorithms of the scheme. Afterwards, we demonstrate that with this modification, the improved scheme is semantically secure against forgery attacks in the random oracle model under the intractability of the CDH problem. An analysis of the performance of the proposed scheme and the related schemes shows the former is much more efficient and suitable for practical application. K E Y W O R D Saggregate signature, certificateless, computational Diffie-Hellman, privacy, random oracle, vehicular ad hoc networks INTRODUCTIONIntelligent transportation system (ITS) employs the applications of sensing, control, communication, and data analytic technologies to provide inventive services that can effectively address the traffic-related issues inherent in the traditional transportation system. In recent times, vehicles equipped with communication devices known as on-board units (OBUs) are emerging. Furthermore, roadside units (RSUs) are also being deployed along the roadside and at intersections to allow communication between vehicles and infrastructure. This new paradigm has innovated a self-organizing network known as vehicular ad hoc network (VANET). In general, as shown in Figure 1, a VANET consists of a trusted authority (TA), OBU-installed vehicles, and RSUs. Communication among vehicles, and between an RSU and an OBU is referred to as vehicle-to-vehicle (V2V) and is achieved using a dedicated short-range communication (DSRC) protocol 1 ; while the TA, RSUs, and an application server (AS) communicate using a secure wired channel such as the Internet. 2 According Security Privacy. 2020;3:e104. wileyonlinelibrary.com/journal/spy2

show abstract

“…

{scriptA}_{1}

can replace the public or secret key of a user, but cannot obtain the master secret key of KGC.

{scriptA}_{2}

can access the master secret key of KGC, but cannot replace a user's public or secret key …”

Section: Security Model Cls and Clas Schemesmentioning

confidence: 99%

“…Theorem A CLAS scheme is provably‐secure provided no polynomial‐time adversaries

{scriptA}_{1}

and

{scriptA}_{2}

can win the games III and IV, respectively with a nonnegligible probability …”

Section: Security Model Cls and Clas Schemesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On the security of privacy‐preserving authentication scheme with full aggregation in vehicular ad hoc network

Kamil

Ogundoyin²

2020

Security and Privacy

View full text Add to dashboard Cite

show abstract

“…But it has high computation and communication overheads because of the usage of expensive pairing operations for verification purpose. Hence, identity based schemes without pairing operations are proposed to reduce overheads [13], [14], [17]. Even though the computation and communication overheads are reduced when compared to that of schemes with pairing operations it still have high overheads.…”

Section: Related Workmentioning

confidence: 99%

Identity based Scheme A gainst Sybil Attacks in Wireless Sensor Networks

Sujatha*¹,

Anita²

2019

IJEAT

View full text Add to dashboard Cite

Wireless sensor networks are insecure against various security attacks. One such harmful, yet easy to promote an attack is the sybil attack which creates multiple identities to achieve access to the wireless sensor networks. A new identity based scheme to provide security against Sybil attacks is proposed in this paper. It detects as well as broadcast information about the attackers to all the nearby sensor nodes. Expensive MapToPoint and pairing operations are not used in this scheme to reduce overheads. It also provides other essential security features. Aggregate-verification to verify several messages at the same time is also proposed in this paper. The performance of the proposed scheme is compared with other recent schemes and the results show that the proposed scheme has reduced amount of overheads and better performance.

show abstract

An efficient certificateless aggregate signature scheme for the Internet of Vehicles

Zhao

Hou

Wang

et al. 2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

In recent years, the research of Internet of vehicles (IoV) has received extensive attention. In IoV, vehicles can make intelligent decisions by exchanging the real‐time traffic information between other vehicles and IoV infrastructures, thereby reducing the probability of traffic jams and accidents. Although IoV has many advantages, it is necessary to ensure that the data are not edited, forged, or disclosed during the transmission. Also, the certificateless signature (CLS) seems to be the solution to this problem. While in the high‐intensity data transmission environment, the CLS scheme is inefficient for application. To improve the efficiency, the function of aggregation was introduced into the CLS. The certificateless aggregate signature (CL‐AS) can aggregate multiple signatures into a brief signature, reducing the computational cost and the size of signature. Nevertheless, most of the recent proposed CL‐AS schemes have problems of security or efficiency. In this paper, we presented an advanced efficient CL‐AS scheme with elliptic curve cryptography for the IoV environment. In addition, the proposed scheme uses pseudonyms in communications to prevent vehicles from revealing their identity. We proved the security of our proposal in the random oracle based on computational Diffie‐Hellman assumption. Also, the efficiency analysis and simulation show the superiority of our scheme.

show abstract

An efficient certificateless aggregate signature without pairing

Cited by 12 publications

References 0 publications

On the security of privacy‐preserving authentication scheme with full aggregation in vehicular ad hoc network

On the security of privacy‐preserving authentication scheme with full aggregation in vehicular ad hoc network

Identity based Scheme A gainst Sybil Attacks in Wireless Sensor Networks

An efficient certificateless aggregate signature scheme for the Internet of Vehicles

Contact Info

Product

Resources

About