Design of Lightweight Counting based Secret Sharing Schemes for Images

Abstract

In this thesis, we address the challenges of securely distributing multimedia data particularly images in resource-constrained environments by proposing lightweight and newlinescalable counting-based secret image sharing schemes (CBSS). Traditional secret sharing methods, such as Boolean XOR, polynomial interpolation, and bitwise operations, newlineare often computationally intensive and poorly suited for multimedia applications due newlineto their high processing costs and limited compatibility with low-power devices like newlineIoT systems, embedded platforms, and mobile devices. To overcome these limitations, we propose a progressive series of counting-based schemes CBSS, CBSSSRCE, and LSIS-BPPC each enhancing security, computational efficiency, and scalability for multimedia applications. newlineThe first scheme, CBSS (Counting-Based Secret Sharing), introduces a lightweight newline(n,n) secret sharing mechanism for images, employing horizontal bit counting with newlineBoolean logic and additive modulo arithmetic. These multiplication- and division-free newlineoperations significantly reduce computational overhead, making the scheme ideal for newlinereal-time multimedia systems. The use of arbitrary images in share generation further newlineimproves randomness and security, ensuring that fewer than n shares reveal no information about the original secret, as detailed in the proposed algorithms for even and odd share generation.