The DOI matches its Crossref record; 35 of the 36 references it cites were found in a registry or an index.
Lightweight Mutual Authentication for IoT and Its Applications
Abstract
The Internet of Things (IoT) provides transparent and seamless incorporation of heterogeneous and different end systems. It has been widely used in many applications including smart cities such as public water system, power grid, water management, and vehicle traffic control system. In these smart city applications, a large number of IoT devices are deployed that can sense, communicate, compute, and potentially actuate. The uninterrupted and accurate functioning of these devices are critical to smart city applications as crucial decisions will be made based on the data received. One of the challenging tasks is to assure the authenticity of the devices so that we can rely on the decision making process with a very high confidence. One of the characteristics of IoT devices deployed in such applications is that they have limited battery power. A challenge is to design a secure mutual authentication protocol which is affordable to resource constrained devices. In this paper, we propose a lightweight mutual authentication protocol based on a novel public key encryption scheme for smart city applications. The proposed protocol takes a balance between the efficiency and communication cost without sacrificing the security. We evaluate the performance of our protocol in software and hardware environments. On the same security level, our protocol performance is significantly better than existing RSA and ECC based protocols. We also provide security analysis of the proposed encryption s…
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Furthermore, the authors demonstrated that this scheme takes only around 125ms for mutual authentication on constrained devices.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [116]
In the citing paper
“However, the evaluation has only been conducted on a Texas development kit.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [116]
In the citing paper
“Similarly, authors in [116] proposed a publickey encryption approach and demonstrated the efficacy of using it for a mutual authentication mechanism in constrained devices.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [116]
In the citing paper
“The proposed encryption scheme is not computationally expensive, so it may be suitable for constrained devices.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [116]
In the citing paper
“This mutual authentication protocol is shown to have benefits over other methods such as AE, NTRU, and Elliptic Curve Cryptography (ECC).”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [116]
Citations
Cites
Internet of Things for Smart Cities
Zanella, A., Bui, N., Castellani, A., Vangelista, L., & Zorzi, M. (2014) · IEEE Internet of Things Journal · doi:10.1109/jiot.2014.2306328 · Cited by 6,292
On the security of public key protocols
Dolev, D., & Yao, A. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056650 · Cited by 5,833
Contiki - a lightweight and flexible operating system for tiny networked sensors
Dunkels, A., Gronvall, B., & Voigt, T. (2004) · 29th Annual IEEE International Conference on Local Computer Networks · doi:10.1109/lcn.2004.38 · Cited by 2,680
Using encryption for authentication in large networks of computers
Needham, R. M., & Schroeder, M. D. (1978) · Communications of the ACM · doi:10.1145/359657.359659 · Cited by 2,362
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2005) · Proceedings of the thirty-seventh annual ACM symposium on Theory of computing · doi:10.1145/1060590.1060603 · Cited by 2,313
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947 · cited 3×
“NTRU [6] is a lattice based public key cryptosystem proposed in 1996.”
BackgroundInfluentialSmart Cities and the Future Internet: Towards Cooperation Frameworks for Open Innovation
Schaffers, H., Komninos, N., Pallot, M., Trousse, B., Nilsson, M., & Oliveira, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20898-0_31 · Cited by 1,188
Artin, E. (1947) · The Annals of Mathematics · doi:10.2307/1969218 · Cited by 969
An attack on the Needham-Schroeder public-key authentication protocol
Lowe, G. (1995) · Information Processing Letters · doi:10.1016/0020-0190(95)00144-2 · Cited by 647 · cited 2×
“However, the protocol is insecure against the man-in-the-middle attack [35].”
BackgroundMethodMaking NTRU as Secure as Worst-Case Problems over Ideal Lattices
Stehlé, D., & Steinfeld, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_4 · Cited by 444
New Public-Key Cryptosystem Using Braid Groups
Ko, K. H., Lee, S. J., Cheon, J. H., Han, J. W., Kang, J.-S., & Park, C. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_10 · Cited by 408
Vaudenay, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-76900-2_5 · Cited by 390
How public key cryptography influences wireless sensor node lifetime
Piotrowski, K., Langendoerfer, P., & Peter, S. (2006) · Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks · doi:10.1145/1180345.1180366 · Cited by 211
Quantum resistant public key cryptography: a survey
Perlner, R. A., & Cooper, D. A. (2009) · Proceedings of the 8th Symposium on Identity and Trust on the Internet · doi:10.1145/1527017.1527028 · Cited by 137 · cited 2×
“It takes about 100 microseconds on contemporary computing platforms [24].”
BackgroundEC-RAC (ECDLP Based Randomized Access Control): Provably Secure RFID authentication protocol
Lee, Y. K., Batina, L., & Verbauwhede, I. M. R. (2008) · IEEE International Conference on RFID · doi:10.1109/rfid.2008.4519370 · Cited by 128
A Vertical Handoff Method via Self-Selection Decision Tree for Internet of Vehicles
Wang, S., Fan, C., Hsu, C., Sun, Q., & Yang, F. (2014) · IEEE Systems Journal · doi:10.1109/jsyst.2014.2306210 · Cited by 120
Pgp in constrained wireless devices
Brown, M., Cheung, D., Hankerson, D., Hernandez, J. L., Kirkup, M., & Menezes, A. (2000) · Cited by 107
Low-cost untraceable authentication protocols for RFID
Lee, Y. K., Batina, L., Singelée, D., & Verbauwhede, I. M. R. (2010) · Wireless Network Security · doi:10.1145/1741866.1741877 · Cited by 97
A Practical Attack on Some Braid Group Based Cryptographic Primitives
Hofheinz, D., & Steinwandt, R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36288-6_14 · Cited by 91
New Key Agreement Protocols in Braid Group Cryptography
Anshel, I. L., Anshel, M., Fisher, B., & Goldfeld, D. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45353-9_2 · Cited by 88
Untraceable RFID authentication protocols: Revision of EC-RAC
Lee, Y. K., Batina, L., & Verbauwhede, I. M. R. (2009) · IEEE International Conference on RFID · doi:10.1109/rfid.2009.4911179 · Cited by 75
Offloading mobile data traffic for QoS-aware service provision in vehicular cyber-physical systems
Wang, S., Lei, T., Zhang, L., Hsu, C., & Yang, F. (2015) · Future Generation Computer Systems · doi:10.1016/j.future.2015.10.004 · Cited by 69
New Signature Scheme Using Conjugacy Problem.
Ko, K. H., Choi, D., Cho, M. S., & Lee, J.-W. (2002) · Cited by 68
Hermans, J., Vercauteren, F., & Preneel, B. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11925-5_6 · Cited by 67
Proper RFID Privacy: Model and Protocols
Hermans, J., Peeters, R., & Preneel, B. (2014) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2014.2314127 · Cited by 50
Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups
Lee, S., & Lee, E.-K. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_2 · Cited by 49
An Elliptic Curve Cryptography-Based RFID Authentication Securing E-Health System
Lee, C., & Chien, H. (2015) · International Journal of Distributed Sensor Networks · doi:10.1155/2015/642425 · Cited by 41
On-Line/Off-Line Digital Schemes
Even, S., Goldreich, O., & Micali, S. (1989) · International Cryptology Conference · Cited by 32
Pseudorandomness from Braid Groups
Lee, E.-K., Lee, S., & Hahn, S. G. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_29 · Cited by 30
Efficient identity authentication and encryption technique for high throughput RFID system
Hsu, C., Wang, S., Zhang, D., Chu, H. E., & Lu, N. (2016) · Security and Communication Networks · doi:10.1002/sec.1488 · Cited by 19
Short expressions of permutations as products and cryptanalysis of the Algebraic Eraser
Kalka, A., Teicher, M., & Tsaban, B. (2012) · Advances in Applied Mathematics · doi:10.1016/j.aam.2012.03.001 · Cited by 16
On the Security of the Algebraic Eraser Tag Authentication Protocol
Blackburn⋆, S. R., & Robshaw, M. J. B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-39555-5_1 · Cited by 13
IBIHOP: Proper Privacy Preserving Mutual RFID Authentication
Peeters, R., Jens, H., & Fan, J. (2013) · IOS Press eBooks · doi:10.3233/978-1-61499-328-5-45 · Cited by 11
Defeating the Kalka--Teicher--Tsaban linear algebra attack on the Algebraic EraserPreprint
Goldfeld, D. M., & Gunnells, P. E. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1202.0598 · Cited by 3
Defeating the Ben-Zvi, Blackburn, and Tsaban Attack on the Algebraic EraserPreprint
Anshel, I. L., Atkins, D., Goldfeld, D. M., & Gunnells, P. E. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.04780 · Cited by 3
Research works printed but not linked: 2
- anshel, 2006, Key agreement, the Algebraic Eraser $^{TM}$ , and lightweight crytography, Contemporary Math, 416, 1
- ben-zvi, 2015, A practical cryptography of the algebraic eraser, IACR Cryptology ePrint Archive, 2015, 1102
Cited by
A Review on the Use of Blockchain for the Internet of Things
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2018) · IEEE Access · doi:10.1109/access.2018.2842685 · Cited by 1,078
Zero Trust Architecture (ZTA): A Comprehensive Survey
Syed, N. F., Shah, S. W., Shaghaghi, A., Anwar, A., Baig, Z., & Doss, R. (2022) · IEEE Access · doi:10.1109/access.2022.3174679 · Cited by 406
“Similarly, authors in [116] proposed a public-key encryption approach and demonstrated the efficacy of using it for a mutual authentication mechanism in constrained devices.”
BackgroundBhushan, B., Khamparia, A., Sagayam, K. M., Sharma, S. K., Ahad, M. A., & Debnath, N. C. (2020) · Sustainable Cities and Society · doi:10.1016/j.scs.2020.102360 · Cited by 353
Blockchain Meets Edge Computing: A Distributed and Trusted Authentication System
Guo, S., Hu, X., Guo, S., Qiu, X., & Qi, F. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2938001 · Cited by 319
“, cooperative message authentication protocols [20], group-oriented-range-bound authenticated key agreements [21], lightweight mutual authentication protocols [22], etc.”
BackgroundAn overview of security and privacy in smart cities' IoT communications
Al‐Turjman, F., Zahmatkesh, H., & Shahroze, R. (2022) · Transactions on Emerging Telecommunications Technologies · doi:10.1002/ett.3677 · Cited by 313
“Moreover, a lightweight authentication protocol was developed in the work of Li et al 69 to secure smart cities' applications by using a public key encryption strategy.”
Method
Metadata
- Authors
- Li, N., Liu, D., & Nepal, S.
- Affiliations
- Data61 (AU)
- Venue
- IEEE Transactions on Sustainable Computing
- Published
- 2017-10-01
- Volume
- 2
- Issue
- 4
- Pages
- 359-370
- ISSN
- 2377-3782 (ISSN-L)
- 2377-3790
- OpenAlex
- W2706591630
- Semantic Scholar
- d02d740d8ad1d188f89cd72bc5a5b3c4c6ca4cb3
- Cited by
- 166
- References
- 36
- Citations by year
- 2026: 3 · 2025: 17 · 2024: 17 · 2023: 15 · 2022: 25 · 2021: 24 · 2020: 21 · 2019: 27 · 2018: 14 · 2017: 3
- FWCI
- 11.84
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Sustainable Computing (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Keywords
- mutual authentication, Internet of Things, smart cities, lightweight authentication protocol, resource-constrained devices, public-key encryption, device authentication, battery-constrained devices, communication overhead, security analysis
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.