${\cal CPAS}$: An Efficient Conditional Privacy-Preserving Authentication Scheme for Vehicular Sensor Networks

Shim, Kyung-Ah

doi:10.1109/tvt.2012.2186992

Cited by 314 publications

(209 citation statements)

References 18 publications

Supporting

Mentioning

209

Contrasting

Order By: Relevance

“…We attempt to provide the correct proof for Shim's IBS using a completely different approach. In our proof, we show that the IBS scheme in [21] is CID-CMA secure. 4.…”

Section: Introductionmentioning

confidence: 76%

“…We find that there is a flaw in the proof of the IBS in [21]. Although it is claimed to be CID-CMA, we show that the proof of the corresponding theorem cannot attend the claimed security.…”

Section: Introductionmentioning

confidence: 87%

“…Recently, Shim [21] proposed a conditional privacy-preserving authentication scheme for vehicular sensor networks. It is based on an Identity-based Signature (IBS) scheme proposed in the same paper.…”

Section: Introductionmentioning

confidence: 99%

“…We describe a list of security risks in VANETs for deploying an authentication scheme which is only CID-NMA secure. In other words, if the scheme in [21] is used, it cannot prove that it can resist such kinds of attacks. 3.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Improvements on an authentication scheme for vehicular sensor networks

Liu

Yuen

et al. 2014

Expert Systems with Applications

111

View full text Add to dashboard Cite

In a recent paper, Shim (2012) presented a very interesting authentication scheme for vehicular sensor networks. Shim claimed that the scheme is secure against the highest adopted level of attack, namely the chosen-message attack (CID-CMA). Nevertheless, we find that the proof in Shim's paper does not actually prove that the scheme is secure in this level. Instead, it can only ensure that the scheme is secure in a strictly weaker level of attack, the adaptive chosen-identity and no-message attack (CID-NMA). In this paper, first we show that there exist some security risks in vehicular networks if a scheme, which is only secure against CID-NMA but not CID-CMA, is deployed. Hence, having the proof that the scheme is only CID-NMA is insufficient for the aforementioned application. That is, Shim did not prove that the proposed scheme can resist these kinds of attack. Here, we use a different approach to prove the scheme for security against CID-CMA. We note that this proof is essential to ensure that the scheme can indeed be used for the aforementioned scenario. In addition, we also show that the batch verification of the scheme, proposed in the same paper, may have non-negligible error. Two invalid signatures may give a positive result. We further improve the batch verification part so that the error rate can be reduced to negligible level. AbstractIn a recent paper, Shim [21] presented a very interesting authentication scheme for vehicular sensor networks. Shim claimed that the scheme is secure against the highest adopted level of attack, namely the chosen-message attack (CID-CMA). Nevertheless, we find that the proof in Shim's paper does not actually prove that the scheme is secure in this level. Instead, it can only ensure that the scheme is secure in a strictly weaker level of attack, the adaptive chosenidentity and no-message attack (CID-NMA). In this paper, first we show that there exist some security risks in vehicular networks if a scheme, which is only secure against CID-NMA but not CID-CMA, is deployed. Hence, having the proof that the scheme is only CID-NMA is insufficient for the aforementioned application. That is, Shim did not prove that the proposed scheme can resist these kinds of attack. Here, we use a different approach to prove the scheme for security against CID-CMA. We note that this proof is essential to ensure that the scheme can indeed be used for the aforementioned scenario. In addition, we also show that the batch verification of the scheme, proposed in the same paper, may have non-negligible error. Two invalid signatures may give a positive result. We further improve the batch verification part so that the error rate can be reduced to negligible level.

show abstract

“…We attempt to provide the correct proof for Shim's IBS using a completely different approach. In our proof, we show that the IBS scheme in [21] is CID-CMA secure. 4.…”

Section: Introductionmentioning

confidence: 76%

“…We find that there is a flaw in the proof of the IBS in [21]. Although it is claimed to be CID-CMA, we show that the proof of the corresponding theorem cannot attend the claimed security.…”

Section: Introductionmentioning

confidence: 87%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improvements on an authentication scheme for vehicular sensor networks

Liu

Yuen

et al. 2014

Expert Systems with Applications

111

View full text Add to dashboard Cite

show abstract

“…So the size of an element in group G 1 is 1024 bits using an elliptic curve with 160 bits q. By standard compression technique [27], the size of an element in group G 1 can be reduced to 65 bytes. The size of an element in G 2 is 1024 bits.…”

Section: Performance Discussionmentioning

confidence: 99%

Identity-based deniable authenticated encryption and its application to e-mail system

Zheng

Jin

2015

Telecommun Syst

View full text Add to dashboard Cite

An authenticated encryption (AE) scheme simultaneously achieves two security goals: confidentiality and authenticity. AE can be divided into symmetric AE and asymmetrical (public key) AE. In a symmetric AE scheme, deniability is gained automatically. However, a public key AE scheme can not gain deniability automatically; on the contrary, it provides non-repudiation. In this paper, we address a question on deniability of public key AE. Of course, we can achieve this goal by "deniable authentication followed by encryption" method. However, such method has the following two weaknesses: (1) the computational cost and communication overhead are the sum of two cryptographic primitives; (2) it is complex to design cryptographic protocols with deniable authentication and confidentiality using two cryptographic primitives. To overcome the two weaknesses, we propose a new concept called deniable authenticated encryption (DAE) that can achieve both the functions of deniable authentication and public key encryption simultaneously, at a cost significantly lower than that required by the "deniable authentication followed by encryption" method. This single cryptographic primitive can simplify the design of cryptographic protocols with deniable authentication and confidentiality. In particular, we construct an identity-based deniable authenticated encryption (IBDAE) scheme. Our construction uses tag-key encapsulation mechanism (KEM) and data encapsulation mechanism (DEM) hybrid techniques, which is more practical for true applications. We show how to construct an IBDAE scheme using an identity-based deniable authenticated tag-KEM (IBDATK) and a DEM. We also propose an IBDATK scheme and prove its security in the random oracle model. For typical security level, our scheme is at least 50.7 and 22.7 % faster than two straightforward "deniable authentication followed by encryption" schemes, respectively. The communication overhead is respectively reduced at least 21.3 and 31.1 %. An application of IBDAE to an e-mail system is described.B

show abstract

An intelligent and robust conditional privacy preserving authentication and group‐key management scheme for vehicular ad hoc networks using elliptic curve cryptosystem

Pulagara

Alphonse

2019

Concurrency and Computation

View full text Add to dashboard Cite

Summary From the last decade, every developing nations are focusing on the smart cities. Smart city will provide all necessary services, ie, water management, waste management, traffic management, and health services, to its citizens effectively. A new paradigm in the smart vehicles is able to form a network called vehicular ad hoc network (VANET). There is a wireless enabled roadside unit (RSU) through which the vehicle drivers can effectively exchange the important traffic data and take proper driving decisions. Each roadside unit is capable of managing some vehicles, which can form a group. There are many schemes available for data transmission in VANET group but they are less secured. In this paper, we propose an intelligent conditional privacy preserving scheme for vehicular ad hoc networks using elliptic curve cryptography. The security analysis showed that the proposed scheme is intelligent, efficient, and easily deployable.

show abstract

${\cal CPAS}$: An Efficient Conditional Privacy-Preserving Authentication Scheme for Vehicular Sensor Networks

Cited by 314 publications

References 18 publications

Improvements on an authentication scheme for vehicular sensor networks

Improvements on an authentication scheme for vehicular sensor networks

Identity-based deniable authenticated encryption and its application to e-mail system

An intelligent and robust conditional privacy preserving authentication and group‐key management scheme for vehicular ad hoc networks using elliptic curve cryptosystem

Contact Info

Product

Resources

About