Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2208.11207

Investigating the Requirements for Building a Blockchain Simulator for IoT Applications

Adel Albshri·Bakri Awaji·and Ellis Solaiman
View original source ↗Read source document ↗Export metadata ↓

Abstract

The pervasiveness of the Internet of Things (IoT) has enabled the administration of a large number of intelligent devices. However, IoT is based on centralised models, which introduce a number of problems, such as a single point of failure and security risks. Blockchain may offer a viable option for addressing these concerns. Practically, both blockchain and IoT are complex technologies posing further challenges in assessing application performance. The availability of a reliable simulation environment for Blockchain based IoT applications would be a major aid in the development and evaluation of such applications. Our research has found that currently there are no simulators with a comprehensive set of features, for the development and evaluation of blockchain based IoT applications, which is the main motivation for our work. The purpose of this study is to gather the opinions of experts regarding the creation of a simulation environment for IoT based blockchain applications. To do this, we utilise two separate investigations. First, a questionnaire is developed to ensure that the development of such simulation software would be of significant use. Second, interviews with participants are performed to gain their perspectives on the primary issues they face with blockchain-based IoT applications. In addition, the interviews focused on collecting the perspectives of participants on how blockchain may improve IoT and how to identify blockchain's applicability in IoT. Our findings demonstrate that the participants had a great deal of confidence in blockchain to resolve IoT issues. However, they lack the tools necessary to assess this concept. This highlights their requirement for a simulator to analyse the integration of blockchain and IoT.

Explore related subjects

cs.CRcs.DC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adel Albshri, Bakri Awaji, and Ellis Solaiman. 2022-08-23. Investigating the Requirements for Building a Blockchain Simulator for IoT Applications. https://arxiv.org/abs/2208.11207

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MIRANDA: short signatures from a leakage-free full-domain-hash scheme

We present $\mathsf{Miranda}$, the first family of full-domain-hash signatures based on matrix codes. This signature scheme fulfils the paradigm of Gentry, Peikert and Vaikuntanathan ($\mathsf{GPV}$), which gives strong security guarantees. Our trapdoor is very simple and generic: if we propose it with matrix codes, it can actually be instantiated in many other ways since it only involves a subcode of a decodable code (or lattice) in a unique decoding regime of parameters. Though $\mathsf{Miranda}$ signing algorithm relies on a decoding task where there is exactly one solution, there are many possible signatures given a message to sign and we ensure that signatures are not leaking information on their underlying trapdoor by means of a very simple procedure involving the drawing of a small number of uniform bits. In particular $\mathsf{Miranda}$ does not use a rejection sampling procedure which makes its implementation a very simple task contrary to other $\mathsf{GPV}$-like signatures schemes such as $\mathsf{Falcon}$ or even $\mathsf{Wave}$. We instantiate $\mathsf{Miranda}$ with the famous family of Gabidulin codes represented as spaces of matrices and we study thoroughly its security (in the EUF-CMA security model). For~$128$ bits of classical security, the signature sizes are as low as~$90$ bytes and the public key sizes are in the order of~$2.6$ megabytes.

cs.CR↗
arXiv2026

SteganoBackdoor: Evading Data-Poisoning Defenses via Steganographic Backdoors

Transformer-based models are highly susceptible to backdoor attacks via supervised fine-tuning (SFT). To red-team existing data-poisoning defenses, prior work has increasingly focused on stylized triggers, synthetic artifacts, and token-level perturbations designed to evade detection. However, this trend has shifted threat models away from naturally occurring semantic triggers and realistic low-budget poisoning settings. Addressing this gap, we introduce SteganoBackdoor, an optimization-based framework that transforms semantic-trigger seeds through autoregressive token replacement, sequentially minimizing embedding overlap with the inference-time trigger while preserving a strong per-sample training-time payload. The resulting SteganoPoisons maintain linguistic fluency and encode the payload across ordinary tokens, such that no individual token carries a concentrated signal and the full payload instead emerges from their exact combination and ordering. Across 18 encoder-based and decoder-only models spanning 120M to 14B parameters, SteganoBackdoor achieves high attack success under sub-percent poisoning budgets and exposes limitations in existing data-poisoning defenses.

cs.CR↗
arXiv2026

Foundations and Design Principles of Lightweight Cryptography for IoT Systems

The successful deployment of the Internet of Things (IoT) applications relies heavily on their robust security, and lightweight cryptography is considered an emerging solution in this context. While existing surveys have been examining lightweight cryptographic techniques from the perspective of hardware and software implementations or performance evaluation, there is a significant gap in addressing different security aspects, such as design principles, specific to the IoT environment. This study aims to bridge this gap. This research presents an examination with focusing on the security evaluation of symmetric lightweight ciphers commonly used in IoT systems. The objective of this study is to provide a concise overview of lightweight ciphers with emphasizing on their security challenges which is an essential consideration for real-time and resource-constrained applications.

cs.CR↗