Design and Prototype of a Unified Framework for Error-robust Compression and Encryption in IoT

TL;DR

This paper presents a prototype of ENCRUST that uses energy-efficient operations, as well as a lighter variant called L-ENCRUST, and performs security analysis and compares the performance of ENCRUST and L-ENCRUST with a state-of-the-art solution in terms of memory, encryption time, and energy consumption on a resource-constrained TelosB mote.

Abstract

The Internet of Things (IoT) relies on resource-constrained devices for data acquisition, but the vast amount of data generated and security concerns present challenges for efficient data handling and confidentiality. Conventional techniques for data compression and secrecy often lack energy efficiency for these devices. Compressive sensing has the potential to compress data and maintain secrecy, but many solutions do not address the issue of packet loss or errors caused by unreliable wireless channels. To address these issues, we have developed the ENCRUST scheme, which combines compression, secrecy, and error recovery. In this paper, we present a prototype of ENCRUST that uses energy-efficient operations, as well as a lighter variant called L-ENCRUST. We also perform security analysis and compare the performance of ENCRUST and L-ENCRUST with a state-of-the-art solution in terms of memory, encryption time, and energy consumption on a resource-constrained TelosB mote. Our results show that both ENCRUST and L-ENCRUST outperform the state-of-the-art solution in these metrics.

Figures (14)

• Figure 1: Conventional communication system vs unified framework of the ENCRUST and L-ENCRUST.
• Figure 2: Framework of the ENCRUST scheme
• Figure 3: Illustration of mutual coherence values for a Gaussian distributed matrix, a binary matrix, and sparse matrices for various values of $d$ and $N=256$.
• Figure 4: Random number construction using LFG trinomials and Non-linear function.
• Figure 5: (a) Original first row of $\mathbf{ H}$ at the L-ENCRUST encoding. (b) Reconstructed first row of $\mathbf{ H}$ at the adversary using the known-plaintext attack.