Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 480

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

LSB: A Lightweight Scalable Blockchain for IoT security and anonymity

Open access
Dorri, Ali, Kanhere, Salil S., Jurdak, Raja, Gauravaram, Praveen·2019·Journal of Parallel and Distributed Computing

Abstract

In recent years, Blockchain has attracted tremendous attention due to its salient features including auditability, immutability, security, and anonymity. Resulting from these salient features, blockchain has been applied in multiple non-monetary applications including the Internet of Things (IoT). However, blockchain is computationally expensive, has limited scalability and incurs significant bandwidth overheads and delays which are not suited for most IoT applications. In this paper, we propose a Lightweight Scalable blockchain (LSB) that is optimized for IoT requirements while also providing end-to-end security. Our blockchain instantiation achieves decentralization by forming an overlay network where high resource devices jointly manage the blockchain. The overlay is organized as distinct clusters to reduce overheads and the cluster heads are responsible for managing the public blockchain. We propose a Distributed Time-based Consensus algorithm (DTC) which reduces the mining processing overhead and delay. Distributed trust approach is employed by the cluster heads to progressively reduce the processing overhead for verifying new blocks. LSB incorporates a Distributed Throughput Management (DTM) algorithm which ensures that the blockchain throughput does not significantly deviate from the cumulative transaction load in the network. We explore our approach in a smart home setting as a representative example for broader IoT applications. Qualitative arguments demonstrate that our approach is resilient to several security attacks. Extensive simulations show that packet overhead and delay are decreased and blockchain scalability is increased compared to relevant baselines.

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1016/j.jpdc.2019.08.005

Cites

44 of 44 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Show all 44 references

Cited by

See all 480

Metadata

Authors
Dorri, A., Kanhere, S. S., Jurdak, R., & Gauravaram, P.
Venue
Journal of Parallel and Distributed Computing
Publisher
Elsevier BV
Published
2019-12
Volume
134
Pages
180-197
ISSN
0743-7315 (ISSN-L)
OpenAlex
W2771747728
Cited by
480
References
44
FWCI
89.04
Type
journal article
Language
en
Open access
green

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: LSB: A Lightweight Scalable Blockchain for IoT security and anonymity. https://app.cochat.ai/papers/10.1016/j.jpdc.2019.08.005
The paper
Dorri, A., Kanhere, S. S., Jurdak, R., & Gauravaram, P. (2019). LSB: A Lightweight Scalable Blockchain for IoT security and anonymity. Journal of Parallel and Distributed Computing. https://doi.org/10.1016/j.jpdc.2019.08.005

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.