A secure and efficient authentication protocol for anonymous channel in wireless communications

Yang, Chou-Chen; Tang, Yuan-Liang; Wang, Ren-Chiun; Yang, Hung-Wen

doi:10.1016/j.amc.2004.10.073

Cited by 22 publications

(15 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this subsection, we compared our proposed scheme with other similar works that are intended to ensure anonymous interactions between the users and the service provider [8,29]. In Table 3.…”

Section: Performance Analysismentioning

confidence: 98%

A secure and efficient communication scheme with authenticated key establishment and privacy preserving for vehicular ad hoc networks

Hwang

Chu

2008

Computer Communications

195

100

View full text Add to dashboard Cite

Section: Performance Analysismentioning

confidence: 98%

A secure and efficient communication scheme with authenticated key establishment and privacy preserving for vehicular ad hoc networks

Hwang

Chu

2008

Computer Communications

195

100

View full text Add to dashboard Cite

“…At first, we idealize the scheme as follows: The initial assumptions, which are quite standard, are as follows: According to assumption (12) and the freshness conjun-…”

Section: Authentication Proof Based On Burrows-abadi-needham Logicmentioning

confidence: 99%

“…In 2005, Yang et al . proposed a secure and efficient scheme to achieve user anonymity by using symmetric cryptosystems over an anonymous channel in a wireless network. However, Chen et al .…”

Section: Introductionmentioning

confidence: 99%

“…Hsieh and J.-S. Leu because a malicious user can use the hashed token of the same home agent to obtain other users' identities. In 2005, Yang et al [12] proposed a secure and efficient scheme to achieve user anonymity by using symmetric cryptosystems over an anonymous channel in a wireless network. However, Chen et al [11] discovered that this scheme is vulnerable to guessing attacks performed by malicious networks visited by the user.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Anonymous authentication protocol based on elliptic curve Diffie-Hellman for wireless access networks

Hsieh

Leu

2012

Wirel. Commun. Mob. Comput.

View full text Add to dashboard Cite

Anonymous channel tickets have been proposed as a way to provide user anonymity and to reduce the overhead of re‐authentication for authentication in wireless environments. Chen et al. proposed a secure and efficient protocol, based on a protocol proposed by Yang et al., which is resistant to guessing attacks on networks from which users’ secret keys are easy to obtain. However, their scheme is time‐consuming in the phases of ticket issuing and authentication. Furthermore, a malicious attacker can utilize the expired time, Texp, to launch a denial of authentication (DoA) attack, which is a type of denial of service attack. Because Texp is exposed to any user, it would be easy to launch a DoA attack that could make the scheme impractical. To resist against DoAs that the scheme of Chen et al. might suffer, we propose an improved scheme based on elliptic curve cryptography in this paper. Our scheme not only reduces time cost but also enhances security. The basis of the proposed scheme is the elliptic curve discrete logarithm problem. The operations of points of an elliptic curve are faster and use fewer bits to achieve the same level of security. Therefore, our scheme is more suitable for mobile devices, which have limited computing power and storage. Copyright © 2012 John Wiley & Sons, Ltd.

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]. Also, the protocols in [24], [25], [26], [27] are designed to provide SMS security based on asymmetric key cryptography with the exception in [26].…”

Section: Existing Solutionsmentioning

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

A secure and efficient authentication protocol for anonymous channel in wireless communications

Cited by 22 publications

References 10 publications

A secure and efficient communication scheme with authenticated key establishment and privacy preserving for vehicular ad hoc networks

A secure and efficient communication scheme with authenticated key establishment and privacy preserving for vehicular ad hoc networks

Anonymous authentication protocol based on elliptic curve Diffie-Hellman for wireless access networks

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

Contact Info

Product

Resources

About