SLDEB: Design of a Secure and Lightweight Dynamic Encryption Bio-Inspired Model for IoT Networks
Bibliographic record
Abstract
Designing encryption models for IoT deployments requires analysis of multiple network level constraints.These include, estimation of energy requirements, security strength, encryption & decryption delay, computational complexity, etc.A wide variety of models are proposed to perform these tasks, but most of them are either highly complex, or require higher energy levels for encrypting data samples.Moreover, these models are contextindependent, and cannot be used for application-specific deployments.To overcome these issues, this text proposes design of a novel secure and lightweight dynamic encryption bioinspired model for IoT networks.The proposed model initially uses an Elliptic Curve Cryptography (ECC) process for data security, and optimizes its performance via Bacterial Foraging Optimization (BFO).ECC parameters that are obtained via BFO are further fine-tuned using a Q-Learning based process, which assists in identification of context-specific parametric ranges for different network types.The combination of BFO with Q-Learning results in dynamic ECC curves, which can be used for context-specific deployments.Performance of the model was evaluated on different scaled networks, and compared with other state-of-the-art encryption models in terms of encryption delay, decryption delay, security level under different attacks, and energy consumption levels.Based on this comparison, it was observed that the proposed model showcased 8.5% lower encryption delay, 3.2% lower decryption delay, and 5.9% lower energy consumption while maintaining similar security levels.Due to these enhancements, the proposed model is useful for a wide variety of low complexity IoT deployments.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".