The World Wide Web is experiencing a daily increase in data transmission because of developments in multimedia technologies. Consequently, each user should prioritize preventing illegal access of this data by encrypting it before moving it over the Internet. Numerous color image encryption schemes have been developed to protect data security and privacy, indifferent to the computation cost. However, most of these schemes have high computational complexities. This research proposes a fast color image scrambling and encryption algorithm depending on different chaotic map types and an S-box that relies on a hyperchaotic map principle. The first step involves converting color image values from decimal representation to binary representation in the scrambling stage by changing the location of the bits according to a proposed swapping algorithm. Next, in the second scrambling stage, the same process occurs after returning color image values from binary representation to decimal representation and generating an Sbox with the assistance of two types of chaotic map, namely, a 2D Zaslavsky map and a 3D Hénon map. Thus, this S-box is relied upon to swap the locations of the pixels in the color image. The encryption procedure begins with the production of three key matrices using a hybrid technique that employs two low-complexity types of chaotic map, namely, a 1D Logistic map and a 3D Hénon map, followed by an XORed as a lightweight process between each key generated for the three matrices and the corresponding red, green, and blue image channels. According to the findings, the proposed scheme demonstrates the most efficiency in terms of lowering the computational cost and shows its effectiveness against a wide range of cryptographic attacks.

Data security pressing issue, particularly in terms of ensuring secure and reliable data transfer over a network. Encryption and seganography play a fundamental role in the task of securing data exchanging. In this article, both steganography and cryptography were combined to produce a powerful hybrid securing stego-system. Firstly, a text message is encrypted with a new method using a bits cycling operation to give a cipher text. In the second stage, an enhanced LSB method is used to hide the text bits randomly in an audio file of a wav format. This hybrid method can provide effectually secure data. Peak signal-to-noise ratio (PSNR), mean squared error (MSE) and structural similarity (SSIM) were employed to evaluate the performance of the proposed system. A PSNR was in range (60-65) dB with the enhanced least significant bit (LSB) and the SSIM had been invested to calculate the signal quality, which scored 0.999. The experimental results demonstrated that our algorithm is highly effective in securing data and the capacity size of the secured text. Furthermore, the time consumption was considerably low, at less than 0.3 seconds.

No abstract

Encryption is one of the best methods to safeguard the security and privacy of an image. However, looking through encrypted data is difficult. A number of techniques for searching encrypted data have been devised. However, certain security solutions may not be used in smart devices in IoT-cloud because such solutions are not lightweight. In this article, we present a lightweight scheme that can enable a content-based search through encrypted images. In particular, images are represented using local features. We develop and validate a secure scheme for measuring the Euclidean distance between two feature vectors. In addition, we use a hashing method, namely, locality-sensitive hashing, to devise the searchable index. The use of an locality-sensitive hashing index increases the proficiency and effectiveness of a system, thereby allowing the retrieval of only relevant images with a minimum number of distance evaluations. Refining vector techniques are used to refine relevant results efficiently and securely. Our index construction process ensures that stored data and trapdoors are kept private. Our system also efficiently supports multiuser authentication by avoiding the expensive traditional method, which enables data owners to define who can search for a specific image. Compared with other similarity-based encryption methods predicated upon searchability, the option presented in this study offers superior search speed and storage efficiency.

No abstract

No abstract

Applications for document similarity detection are widespread in diverse communities, including institutions and corporations. However, currently available detection systems fail to take into account the private nature of material or documents that have been outsourced to remote servers. None of the existing solutions can be described as lightweight techniques that are compatible with lightweight client implementation, and this deficiency can limit the effectiveness of these systems. For instance, the discovery of similarity between two conferences or journals must maintain the privacy of the submitted papers in a lightweight manner to ensure that the security and application requirements for limited-resource devices are fulfilled. This paper considers the problem of lightweight similarity detection between document sets while preserving the privacy of the material. The proposed solution permits documents to be compared without disclosing the content to untrusted servers. The fingerprint set for each document is determined in an efficient manner, also developing an inverted index that uses the whole set of fingerprints. Before being uploaded to the untrusted server, this index is secured by the Paillier cryptosystem. This study develops a secure, yet efficient method for scalable encrypted document comparison. To evaluate the computational performance of this method, this paper carries out several comparative assessments against other major approaches.

Data security can involve embedding hidden images, text, audio, or video files within other media to prevent hackers from stealing encrypted data. Existing mechanisms suffer from a high risk of security breaches or large computational costs, however. The method proposed in this work incorporates low-complexity encryption and steganography mechanisms to enhance security during transmission while lowering computational complexity. In message encryption, it is recommended that text file data slicing in binary representation, to achieve different lengths of string, be conducted before text file data masking based on the lightweight Lucas series and mod function to ensure the retrieval of text messages is impossible. The steganography algorithm starts by generating a random key stream using a hybrid of two low-complexity chaotic maps, the Tent map and the Ikeda map. By finding a position vector parallel to the input image vector, these keys are used based on the previously generated position vector to randomly select input image data and create four vectors that can be later used as input for the Lah transform. In this paper, we present an approach for hiding encrypted text files using LSB colour image steganography by applying a low-complexity XOR operation to the most significant bits in 24-bit colour cover images. It is necessary to perform inverse Lah transformation to recover the image pixels and ensure that invisible data cannot be retrieved in a particular sequence. Evaluation of the quality of the resulting stego-images and comparison with other ways of performing encryption and message concealment shows that the stego-image has a higher PSNR, a lower MSE, and an SSIM value close to one, illustrating the suitability of the proposed method. It is also considered lightweight in terms of having lower computational overhead.