Multiple Image Based Dual Steganography Using Arnold Transform and Block Code Encoding

Security plays a crucial role in the field of Social media network. Securing the data become one among the largest challenges in the present scenario. Whenever we expect concerning the cyber security, the primary issue that involves our mind is ‘cyber crimes’ that are increasing vastly day by day. Embedding secret message into the image (Steganography) is associated with art and science of secure data communication wherever the key information or confidential information is hidden in host file. It's employed incompletely different helpful applications like secure electronic communication, health care and military. Confidential information’s are unremarkably keep in digital media and transmitted via network cause of rapid growth of internet. In this paper, steganography techniques which might be used to safeguard the information from intruders. Here, Steganographic technique is used to hide multiple secret images into a single 24-bit cover image using Least Significant Bit (LSB) and dual steganography method. Multiple secret images are scrambled and encoded before hiding into cover image using Arnold Transform and Block Code Encoding. The Proposed technique is Block Code Encoding to convert Secret message to binary and bit pairs to form safer information. The main goals of proposed work offers security and high limit based steganography plan of concealing a massive size secret image into a bit size cover image, to enhance security using dual steganography, image quality and to reduce error.

Deep Multi-Image Steganography with Private Keys

In this paper, we propose deep multi-image steganography with private keys. Recently, several deep CNN-based algorithms have been proposed to hide multiple secret images in a single cover image. However, conventional methods are prone to the leakage of secret information because they do not provide access to an individual secret image and often decrypt the entire hidden information all at once. To tackle the problem, we introduce the concept of private keys for secret images. Our method conceals multiple secret images in a single cover image and generates a visually similar container image containing encrypted secret information inside. In addition, private keys corresponding to each secret image are generated simultaneously. Each private key provides access to only a single secret image while keeping the other hidden images and private keys unrevealed. In specific, our model consists of deep hiding and revealing networks. The hiding network takes a cover image and secret images as inputs and extracts high-level features of the cover image and generates private keys. After that, the extracted features and private keys are concatenated and used to generate a container image. On the other hand, the revealing network extracts high-level features of the container image and decrypts a secret image using the extracted feature and a corresponding private key. Experimental results demonstrate that the proposed algorithm effectively hides and reveals multiple secret images while achieving high security.

An Intragroup and Intergroup Multiple Secret Images’ Sharing Scheme with Each Participant Holding One Shadow Image

In some particular situations, participants need to recover different secrets both within a group (i.e., intragroup) and between two groups (i.e., intergroup). However, most of the existing multilevel secret sharing (MLSS) and multigroup secret sharing (MGSS) schemes mainly focus on how to protect a secret between one or more groups. In this paper, we propose a polynomial-based scheme to share multiple secret images both within a group and between groups. The random elements’ utilization model of integer linear programming is used to find polynomial coefficients that meet certain conditions so that each participant holds only one shadow image and some of them can recover secrets of both intergroup and intragroup. In addition, our scheme based on polynomials has the advantage of low computational complexity. Theoretical analysis and experiments show that the proposed scheme is feasible and effective.

Multi-Secret Sharing Visual Cryptography Scheme Based on XOR Algorithm

XOR algorithm can be used to improve the recovery effects of visual cryptography scheme. In this paper, we present a multi-secret visual cryptography scheme by using the matrices of the (k, k)-VCS. We can reveal multiple secret images perfectly by the XOR algorithm and shifting operation on the shares. The visual qualities of recovered images are ideal without any pixel expansion.