CoChat

Provably Secure ECC-Based Device Access Control and Key Agreement Protocol for IoT Environment

Open access
Das, Ashok Kumar, Wazid, Mohammad, Yannam, Animi Reddy, Rodrigues, Joel J. P. C., Park, Youngho · 2019 · IEEE Access
Cited by 198

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Abstract

For secure communication between any two neighboring sensing devices on the Internet of Things (IoT) environment, it is essential to design a secure device access control and key agreement protocol, in which the two phases, namely, “node authentication” and “key agreement” are involved. While the node authentication allows two sensing devices to authenticate each other using their own pre-loaded secret credentials in memory, the key agreement phase permits to establish a secret key between them if the mutual authentication is successful. In this paper, we propose a new certificate-based “lightweight access control and key agreement protocol in the IoT environment, called LACKA-IoT,” that utilizes the elliptic curve cryptography (ECC) along with the “collision-resistant one-way cryptographic hash function.” Through a detailed security analysis using the formal security under the “Real-Or-Random (ROR) model,” informal (non-mathematical) security analysis, and formal security verification using the broadly used “Automated Validation of Internet Security Protocols and Applications (AVISPA)” tool, we show that the LACKA-IoT can protect various known attacks that are needed for a secure device access control mechanism in the IoT. Furthermore, through a comparative study of the LACKA-IoT and other relevant schemes, we show that there is a better tradeoff among the security and functionality features and communication and computational costs of the LACKA-IoT as compared to other schemes. Finally, the “practical demonstration using the NS2 simulation” has been carried out on the LACKA-IoT to measure various network parameters.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2019.2912998

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 198

Metadata

Authors
Das, A. K., Wazid, M., Yannam, A. R., Rodrigues, J. J. P. C., & Park, Y.
Venue
IEEE Access
Published
2019
Volume
7
Pages
55382-55397
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2941876624
Cited by
198
References
3
FWCI
13.36
Type
journal article
Language
en
Open access
gold

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.