Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/126169
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Journal article |
Title: | BVPSMS: A batch verification protocol for end-to-end secure SMS for mobile users |
Author: | Saxena, N. Shen, H. Komninos, N. Choo, K.K.R. Chaudhari, N.S. |
Citation: | IEEE Transactions on Dependable and Secure Computing, 2020; 17(3):550-565 |
Publisher: | IEEE |
Issue Date: | 2020 |
ISSN: | 1545-5971 1941-0018 |
Statement of Responsibility: | Neetesh Saxena, Hong Shen, Nikos Komninos, Kim-Kwang Raymond Choo and Narendra S. Chaudhari |
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 many other users simultaneously. The reliability of the protocol is discussed along with an algorithm to detect malicious user requests 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. |
Keywords: | Authentication; batch verification; mobile subscriber; SMS; symmetric key cryptosystem |
Description: | Date of publication 30 Jan. 2018; date of current version 13 May 2020. |
Rights: | © 2018 IEEE. |
DOI: | 10.1109/TDSC.2018.2799223 |
Grant ID: | http://purl.org/au-research/grants/arc/DP150104871 |
Published version: | http://dx.doi.org/10.1109/tdsc.2018.2799223 |
Appears in Collections: | Aurora harvest 8 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.