An Improved Medical Image Watermarking Technique Based on Weber’s Law Descriptors

In distributed m-health communication, it is a major challenge to develop an efficient blind watermarking method to protect the confidential medical data of patients. This paper proposes an efficient blind watermarking for medical images, which boasts a very high embedding capacity, a good robustness, and a strong imperceptibility. Three techniques, namely, discrete cosine transform (DCT), Weber’s descriptors (WDs), and Arnold chaotic map, were integrated to our method. Specifically, the Arnold chaotic map was used to scramble the watermark image. Then, the medical image was partitioned into non-over lapping blocks, and each block was subjected to DCT. After that, the scrambled watermark image data were embedded in the middle-band DCT coefficients of each block, such that two bits were embedded in each block. Simulation results show that the proposed watermarking method provides better imperceptibility, robustness, and computational complexity results with higher embedding capacity than the contrastive method.

High-Capacity Robust Behavioral Steganography Method Based on Timestamp Modulation across Social Internet of Things

Social Internet of Things (SIoT) is an emerging field that combines IoT and Internet, which can provide many novel and convenient application scenarios but still faces challenges in data privacy protection. In this paper, we propose a robust behavioral steganography method with high embedding capacity across social networks based on timestamp modulation. Firstly, the IoT devices on the sending end modulate the secret message to be embedded into a timestamp by using the common property on social networks. Secondly, the accounts of multiple social networks are used as the vertices, and the timestamp mapping relationship generated by the interaction behaviors between them is used as the edges to construct a directed secret message graph across social networks. Then, the frequency of interaction behaviors generated by users of mainstream social networks is analyzed; the corresponding timestamps and social networks are used to implement interaction behaviors based on the secret message graph and the frequency of interaction behaviors. Next, we analyze the frequency of interaction behaviors generated by users in mainstream social networks, implement the interaction behaviors according to the secret message graph and the frequency of interaction behaviors in the corresponding timestamps and social networks, and combine the redundant mapping control to complete the embedding of secret message. Finally, the receiver constructs the timestamp mapping relationship through the shared account, key, and other parameters to achieve the extraction of secret message. The algorithm is robust and does not have the problem that existing multimedia-based steganography methods are difficult to extract the embedded messages completely. Compared with existing graph theory-based social network steganography methods, using timestamps and behaviors frequencies to hide message in multiple social networks increases the cost of detecting covert communication and improves concealment of steganography. At the same time, the algorithm uses a directed secret message graph to increase the number of bits carried by each behavior and improves the embedding capacity. A large number of tests have been conducted on mainstream social networks such as Facebook, Twitter, and Weibo. The results show that the proposed method successfully distributes secret message to multiple social networks and achieves complete extraction of embedded message at the receiving end. The embedding capacity is increased by 1.98–4.89 times compared with the existing methods SSN, NGTASS, and SGSIR.

Efficient Reversible Data Hiding Scheme for AMBTC-Compressed Images

Reversible data hiding has attracted significant attention from researchers because it can extract an embedded secret message correctly and recover a cover image without distortion. In this paper, a novel, efficient reversible data hiding scheme is proposed for absolute moment block truncation code (AMBTC) compressed images. The proposed scheme is based on the high correlation of neighboring values in two mean tables of AMBTC-compressed images to further losslessly encode these values and create free space for containing a secret message. Experimental results demonstrated that the proposed scheme obtained a high embedding capacity and guaranteed the same PSNRs as the traditional AMBTC algorithm. In addition, the proposed scheme achieved a higher embedding capacity and higher efficiency rate than those of some previous schemes while maintaining an acceptable bit rate.

Image Security using Steganography and Cryptography

Cryptography and Steganography could be used to provide data security, each of them has a problem. Cryptography problem is that, the cipher text looks meaningless, so the attacker will interrupt the transmission or make more careful checks on the data from the sender to the receiver. Steganography problem is that once the presence of hidden information is revealed or even suspected, the message is become known . According to my proposed work in which both steganography and cryptography are combine and give good security for data. Firstly, the encrypted images has been hidden using image steganography method. Secondly, the Hash function algorithm has been modified and used to encrypt the stego image by using 128 digit hexa-key. Therefore, two levels of security have been provided using the proposed technique. In addition, the proposed technique provides high embedding capacity and better quality stego images.

An approach for Secured Image Transmission: A High Capacitive and Confidentiality based Image Steganography using Private Stego-Key

In the proposed paper an approach for image transmission with security and also improvement of the gray-scale (8-bit image) image flexible stenographic system using LSB approach. In this process a secret key of 80 bits is applied while embedding the message into the cover image. To provide high security and also confidentiality of the data a key stego-key is applied. The proposed method the information bits are embedded adaptively into the cover-image pixels. With this method a high embedding capacity in terms of hiding the data is provided and also better imperceptibility is also achieved. The major advantage of this method verifies by the Security method of Digital Signature. It is to be verified whether the attacker has made a trials to change the Secret information in the present inside the stego-image which is intended to be kept secret throughout the communication process. In this technique the embedding process to hide the message data present in the transformed spatial domain of the cover image and makes use of a simple Exclusive-OR operation based on Security checking method of verifying the signature digitally by using key size value of 140 bits is used to check the integrity from the stego-image. The confidential data which is embedded can be retrieved from stego-images. The security level is enhanced by using the stego key and by adaptive steganography data inconspicuousness is improved.

A Dynamic Steganography Method for Web Images with Average Run-Length-Coding

Web page has many redundancies, especially the dynamic html multimedia object. This paper proposes a novel method to employ the commonly used image elements on web pages. Due to the various types of image format and complexity of image contents and their position information, secret message bits could be coded to embed in these complex redundancies. Together with a specific covering code called average run-length-coding, the embedding efficiency could be reduced to a low level and the resulting capacity outperforms traditional content-based image steganography, which modifies the image data itself and causes a real image quality degradation. Our experiment result demonstrates that the proposed method has limited processing latency and high embedding capacity. What’s more, this method has a low algorithm complexity and less image quality distortion compared with existing steganography methods.

Steganography in Color Animated Image Sequence for Secret Data Sharing Using Secure Hash Algorithm

This paper presents a high capacity steganographic approach with secret message validation scheme at the receiver end. The proposed idea develops specifically for animated GIF, the cover media, to conceal secret text messages where Least Significant Digit (LSD) method is employed to embed secret information in the form of ASCII value. To validate the secret information at the receiver end, the secret text is encoded with Secure Hash Algorithm-1(SHA1) which is subsequently embedded in certain pre-defined portion of the cover media. The proposed algorithm is experimented on a large set of colored animated image sequences by varying text messages which produces satisfactory results. The proposed method also maintains good visual perceptibility while securing high embedding capacity