b-SPECS+: Batch Verification for Secure Pseudonymous Authentication in VANET

Horng, Shi–Jinn; Tzeng, Shiang-Feng; Pan, Yi; Fan, Pingzhi; Wang, Xian; Li, Tianrui; Khan, Muhammad Khurram

doi:10.1109/tifs.2013.2277471

Cited by 235 publications

(172 citation statements)

References 20 publications

Supporting

Mentioning

171

Contrasting

Order By: Relevance

“…The exclusive-or operations (XOR) and concatenate operations are negligible in the following analysis of computation cost because their execution time is much less than that of a hash to number function operation. 35 scheme consists of two bilinear pairing operations, 2n scalar multiplication operations, n operations of MapToPoint hash function, and n operations of one-way hash function. So the total computation cost of BMV is 2T bp + 2nT b:m + nT H + nT h .…”

Section: Computation Cost Analysis and Comparisonmentioning

confidence: 99%

Efficient location-based conditional privacy-preserving authentication scheme for vehicle ad hoc networks

Fan

Xie

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Due to the real-time requirement of message in vehicle ad hoc networks, it is a challenge to design an authentication for vehicle ad hoc networks to achieve security, efficiency, and conditional privacy-preserving. To address the challenge, many conditional privacy-preserving authentication schemes using bilinear pairing or ideal tamper-proof device have been proposed for vehicle ad hoc networks in recent years. However, the bilinear pairing operation is one of the most complex cryptographic operations and the assumption of tamper-proof device is very strong. In this article, an efficient location-based conditional privacy-preserving authentication scheme without the bilinear pairing and tamper-proof device is proposed. Compared with the most recently proposed authentication schemes, the proposed scheme markedly decreases the computation costs of message signing and message verification phase, while satisfies all security requirements of vehicle ad hoc networks and provides conditional privacy-preserving.

show abstract

Section: Computation Cost Analysis and Comparisonmentioning

confidence: 99%

Efficient location-based conditional privacy-preserving authentication scheme for vehicle ad hoc networks

Fan

Xie

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…For example, a number of protocols have been proposed for the value added services in Vehicular Ad-hoc Networks (VANET) [12], [13], [14], public-private key-based vehicular communication system [15], [16], [17], and digital signatures in batch to achieve high efficiency [18], [19]. Several SMS-based wireless protocols [20], [21], [22], [23], lightweight AKA [7] and SMS-based attacks and their countermeasures are discussed in [8].…”

Section: Existing Solutionsmentioning

confidence: 99%

“…However, RAISE [12] does not provide mutual authentication and is only partially secure against impersonation attacks. We observe that user privacy is preserved in ABAKA [14] and RAISE [12], but both SPECS [17] and b-SPECS+ [15] suffer from replay attack. Our proposed protocol, on the other hand, fulfills all the mentioned requirements.…”

Section: Ind-cpamentioning

confidence: 99%

BVPSMS: A Batch Verification Protocol for End-to-End Secure SMS for Mobile Users

Saxena

Shen

Komninos

et al. 2018

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

Abstract-Short Message Service (SMS) is a widely used communication medium for mobile applications, such as banking, social networking, and e-commerce. Applications of SMS services also include real-time broadcasting messages, such as notification of natural disasters (e.g., bushfires and hurricane) and terrorist attacks, and sharing the current whereabouts to other users, such as notifying urgent business meeting information, transmitting quick information in the battlefield to multiple users, notifying current location to our friends and sharing market information. However, traditional SMS is not designed with security in mind (e.g., messages are not securely sent). It is also possible to extract international mobile subscriber identity of the mobile user. In the literature, there is no known protocol that could enable secure transmission of SMS from one user to multiple users simultaneously. In this paper, we introduce a batch verification authentication and key agreement protocol, BVPSMS, which provides end-to-end message security over an insecure communication channel between different mobile subscribers. Specifically, the proposed protocol securely transmits SMS from one mobile user to multiple users simultaneously. The reliability of the protocol is discussed along with an algorithm to detect malicious user request in a batch. We then evaluate the performance of the proposed protocol in terms of communication and computation overheads, protocol execution time, and batch and re-batch verification times. The impacts of the user mobility, and the time, space and cost complexity analysis are also discussed. We then present a formal security proof of the proposed protocol. To the best of our knowledge, this is the first provably-secure batch verification protocol that delivers end-to-end SMS security using symmetric keys.

show abstract

“…Zaverucha et al [8] presented and compared some group testing algorithms for finding invalid signatures. Zhang et al [10] adopted the group testing technique to find invalid signatures in a batch in mobile networks. Lee et al [9] proposed a secure batch verification with group testing to improve the real-time performance of mobile networks.…”

Section: IImentioning

confidence: 99%

Based Scheme of Batch Identiﬁcation for Invalid Signatures using Game Theory Model in Wireless Mobile Networks

Jelin¹

2018

IJRASET

View full text Add to dashboard Cite

Batch cryptography technique is a powerful tool to reduce verification time. There will be two directions to apply the batch cryptography concept in WMNs: Batch verification and Batch identification. It is unrealistic to completely prevent all adversaries (attackers) from generating false messages with invalid signatures. A paramount concern in signature verification is reducing the verification delay to ensure the network QoS. To address this issue, researchers have proposed the batch validation technology Thus, to guarantee the performance of batch verification, we should identify invalid signatures in a batch rapidly. Batch identification is a technique to find the poor signatures within a batch when the batch verification fails. Due to the inefficiency of individual identification, divide and conquer techniques have been proposed to improve the performance of batch identification. In this paper, we propose a batch validation for wireless mobile networks, enabling nodes to find invalid signatures with the optimal delay under heterogeneous and dynamic attack scenarios. Specifically, we design an incomplete information of game model of history between a verifier and its attackers, and prove the existence of Nash Equilibrium, to select the dominant algorithm for identifying invalid signatures. Moreover, we propose an auto-match protocol to optimize the identification algorithm selection, when the attack strategies can be estimated based on history information. Comprehensive simulation results demonstrate that GBIM can identify invalid signatures more efficiently than existing algorithms.

show abstract

b-SPECS+: Batch Verification for Secure Pseudonymous Authentication in VANET

Cited by 235 publications

References 20 publications

Efficient location-based conditional privacy-preserving authentication scheme for vehicle ad hoc networks

Efficient location-based conditional privacy-preserving authentication scheme for vehicle ad hoc networks

BVPSMS: A Batch Verification Protocol for End-to-End Secure SMS for Mobile Users

Based Scheme of Batch Identiﬁcation for Invalid Signatures using Game Theory Model in Wireless Mobile Networks

Contact Info

Product

Resources

About