Robust Information Hiding Based on Neural Style Transfer with Artificial Intelligence

This paper proposes an artificial intelligence-based robust information hiding algorithm to address the issue of confidential information being susceptible to noise attacks during transmission.The algorithm we designed aims to mitigate the impact of various noise attacks on the integrity of secret information during transmission.The method we propose involves encoding secret images into stylized encrypted images and applies adversarial transfer to both the style and content features of the original and embedded data.This process effectively enhances the concealment and imperceptibility of confidential information,thereby improving the security of such information during transmission and reducing security risks.Furthermore,we have designed a specialized attack layer to simulate real-world attacks and common noise scenarios encountered in practical environments.Through adversarial training,the algorithm is strengthened to enhance its resilience against attacks and overall robustness,ensuring better protection against potential threats.Experimental results demonstrate that our proposed algorithm successfully enhances the concealment and unknowability of secret information while maintaining embedding capacity.Additionally,it ensures the quality and fidelity of the stego image.The method we propose not only improves the security and robustness of information hiding technology but also holds practical application value in protecting sensitive data and ensuring the invisibility of confidential information.

Coverless Information Hiding Based on the Molecular Structure Images of Material

The traditional information hiding methods embed the secret information by modifying the carrier,which will inevitably leave traces of modification on the carrier.In this way,it is hard to resist the detection of steganalysis algorithm.To address this problem,the concept of coverless information hiding was proposed.Coverless information hiding can effectively resist steganalysis algorithm,since it uses unmodified natural stego-carriers to represent and convey confidential information.However,the state-of-the-arts method has a low hidden capacity,which makes it less appealing.Because the pixel values of different regions of the molecular structure images of material(MSIM)are usually different,this paper proposes a novel coverless information hiding method based on MSIM,which utilizes the average value of sub-image’s pixels to represent the secret information,according to the mapping between pixel value intervals and secret information.In addition,we employ a pseudo-random label sequence that is used to determine the position of sub-images to improve the security of the method.And the histogram of the Bag of words model(BOW)is used to determine the number of subimages in the image that convey secret information.Moreover,to improve the retrieval efficiency,we built a multi-level inverted index structure.Furthermore,the proposed method can also be used for other natural images.Compared with the state-of-the-arts,experimental results and analysis manifest that our method has better performance in anti-steganalysis,security and capacity.

An Information Hiding Algorithm Based on Bitmap Resource of Portable Executable File

An information hiding algorithm is proposed, which hides information by embedding secret data into the palette of bitmap resources of portable executable （PE） files. This algorithm has higher security than some traditional ones because of integrating secret data and bitmap resources together. Through analyzing the principle of bitmap resources parsing in an operating system and the layer of resource data in PE files, a safe and useful solution is presented to solve two problems that bitmap resources are incorrectly analyzed and other resources data are confused in the process of data embedding. The feasibility and effectiveness of the proposed algorithm are confirmed through computer experiments.

A Novel Steganography Scheme Combining Coverless Information Hiding and Steganography

At present,the coverless information hiding has been developed.However,due to the limited mapping relationship between secret information and feature selection,it is challenging to further enhance the hiding capacity of coverless information hiding.At the same time,the steganography algorithm based on object detection only hides secret information in foreground objects,which contribute to the steganography capacity is reduced.Since object recognition contains multiple objects and location,secret information can be mapped to object categories,the relationship of location and so on.Therefore,this paper proposes a new steganography algorithm based on object detection and relationship mapping,which integrates coverless information hiding and steganography.In this method,the coverless information hiding is realized by mapping the object type,color and secret information in object detection method.At the same time,the object detection method is used to find the safe area to hide secret messages.The proposed algorithm can not only improve the steganographic capacity of the two information hiding methods but also make the coverless information hiding more secure and robust.

A novel quantum information hiding protocol based on entanglement swapping of high-level Bell states

Using entanglement swapping of high-level Bell states, we first derive a covert layer between the secret message and the possible output results of the entanglement swapping between any two generalized Bell states, and then propose a novel high-efficiency quantum information hiding protocol based on the covert layer. In the proposed scheme, a covert channel can be built up under the cover of a high-level quantum secure direct communication （QSDC） channel for securely transmitting secret messages without consuming any auxiliary quantum state or any extra communication resource. It is shown that this protocol not only has a high embedding efficiency but also achieves a good imperceptibility as well as a high security.

An Efficient Information Hiding Scheme Based on Closest Paired Tree Structure Vector Quantization

Information hiding schemes based on vector quantization （VQ） usually require lengthy VQ encoding and decoding processes. In this paper, we propose an efficient information hiding method based on closest paired tree structure vector quantization （CPTSVQ）. The simulation result shows that the execution time of the proposed scheme is much shorter than that attained by previous approaches.

Information hiding scheme for vector maps based on fingerprint certification

An information hiding scheme for vector maps is presented to identify the source after the vector map is leaked in some key application areas. In this scheme, the fingerprint image of the map owner can be converted into a character string as the watermark, and then the watermark will be embedded into the coordinate descriptions of the attribute file by the "0-bit value" programming method. This programming algorithm ensures that the accuracy is lossless and the graphics is unchanged for any vector map. Experiments show that the presented hiding scheme has stable robustness, the average similarity rate is 97.2% for fingerprints matching and the false non-match rate is 1.38% in the blocking test. In the opening test, the former reaches 84.46% and the latter reaches 5.56%.

A NOVEL APPROACH OF SECURE COMMUNICATION BASED ON THE TECHNIQUE OF SPEECH INFORMATION HIDING

The proposed secure communication approach adopts the proposed algorithm of Analysis-By- Synthesis （ABS） speech information hiding to establish a Secret Speech Subliminai Channel （SSSC） for speech secure communication over PSTN （Public Switched Telephone Network）, and employs the algorithm of ABS speech information extracting to recovery the secret information, This approach is more reliable, covert and securable than traditional and chaotic secure communication.

STUDY ON AUDIO INFORMATION HIDING METHOD BASED ON MODIFIED PHASE PARTITION

Hiding efficiency of traditional audio information hiding methods is always low since the sentience similarity cannot be guaranteed. A new audio information hiding method is proposed in this letter which can impose the insensitivity with the audio phase for auditory and realize the information hiding through specific algorithm in order to modify local phase within the auditory perception. The algorithm is to introduce the operation of "set 1" and "set 0" for every phase vectors, then the phases must lie on the boundary of a phase area after modified. If it lies on "1" boundary, it comes by set 1 operation. If it lies on "0" boundary, it comes by set 0 operation. The results show that, compared with the legacy method, the proposed method has better auditory similarity, larger information embedding capacity and lower code error rate. As a kind of blind detect method, it fits for application scenario without channel interference.

AN OPTIMAL INFORMATION HIDING ALGORITHM FOR SPEECH IN THE FRACTIONAL FOURIER TRANSFORM DOMAIN

With the increasing requirement of military and security, the technology of information hiding for speech becomes a hotspot and difficulty in the fields of speech signal processing and in-formation security, which is developing rapidly. In order to stand against the stegano-analysis, the paper proposed an optimal information hiding algorithm for speech in the Fractional Fourier Transform (FrFT) domain based on the Minimum Mean Square Error (MMSE) criterion. The results of simulation and experiments show that speech modified by the proposed algorithm has no remarkable changes both in time and frequency domains, which can effectively resist the time and frequency analysis, Otherwise, the algorithm is robust to general signal process attack, and the difference is imperceptible between the original and modified speech.

The Research on Audio Information Hiding Technology

Audio information hiding technology is an important branch of stenography. This article introduces the basic concepts, principles, characteristics and the typical models of the audio information hiding. It then classifies the audio information hiding methods, according to the domain used by them including time, frequency, Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and the compressed., and discusses several mainstream algorithms in various domains. It finally points out that the audio information hiding technology cannot solve the problem of re-record attacks, but it also brings forward the possible solutions to this problem.

A Distributed Secret Sharing Method with QR Code Based on Information Hiding

QR codes are applied widely on the Internet and mobile devices in recent years.Its open standards and the characteristics of easy to generate lead to anyone can generate their QR code easily.Also,the QR code does not have the ability of hiding information,which leads to everyone can get access to read the content in any QR code,including those hiding some secret content in the bytes of QR code.Therefore,in recent years,information tampering and information leakage cases caused by poor security of two-dimensional code occur frequently,especially in the financial field and multi-party verification scenarios.QR codes are almost impossible to use in these scenarios.Therefore,this paper proposes a distributed information sharing method based on information hiding QR code.This method can make secret code in QR code safer and robust,and the secret shared between receivers can be used for decryption and attacking detection.Therefore,on the one hand,the information hiding method can maximize the capacity of embedded secret information,on the other hand,it can prevent attacks by disguised attackers and recover hidden secret information through reconstruction.This paper illustrates the feasibility of this scheme through the form of theoretical proof.

LPC parameters substitution for speech information hiding

Information hiding techniques adopted in secret communication should meet the requirements of high hiding capacity,real-time and high robustness.For the purpose of real-time speech secure communication,an information hiding algorithm based on the analysis-by-synthesis（ABS） speech coding scheme is presented in this article.This algorithm substitutes secret speech data bits for linear predictive coefficients（LPCs） in linear predictive coding（LPC）.Statistics show that the change of voiced signal track is slow and the codebook for LPCs vector is large in ABS coding scheme.Therefore,a new concept,filter similarity,is proposed to determine the LPC parameters for substituting with secret speech information,and to generate multi-codebook for saving storage space to store secret speech information.To achieve the best effects of information hiding,a dynamic threshold is built to make an optimal trade-off among hiding-capacity,security,robustness,transparence and real time.Experiments show that the proposed approach meets the requirements of information hiding and secret communication speech quality.The test results indicate that this approach reaches high hiding capacity with an excellent speech quality and complicating speakers＇ recognition.

Provably Secure Information Hiding via Short Text in Social Networking Tools

Utilizing OnLine Short Text （OLST） in social networking tools such as microblogs, instant messag- ing platforms, and short message service via smart phones has become a routine in daily life. OLST is ap- pealing for personal covert communication because it can hide information in a very short carrier text, and this concealment is hard to detect due to the diversity of normal traffic. However, designing appropriate schemes confronts several challenges： they need to be provably secure, and their performance needs to maintain high efficiency and handy usability due to the short length of OLST messages. In this paper, we propose a family of customized schemes known as HiMix, HiCod, HiOpt, and HiPhs for text steganography in OLST. These schemes are evaluated in terms of their security and their performance with regard to two metrics that address the particular characteristics of OLST： hiding rate and hiding ease. All proposed schemes are proved to be at least computationally secure, and their performance in terms of hiding rate and hiding ease justifies their applicability in social networking tools that utilize OLST.

An Improved Quantum Information Hiding Protocol Based on Entanglement Swapping of χ-type Quantum States

In 2011, Qu et al. proposed a quantum information hiding protocol based on the entanglement swapping of χ-type quantum states. Because a χ-type state can be described by the 4-particle cat states which have good symmetry,the possible output results of the entanglement swapping between a given χ-type state and all of the 16 χ-type states are divided into 8 groups instead of 16 groups of different results when the global phase is not considered. So it is difficult to read out the secret messages since each result occurs twice in each line(column) of the secret messages encoding rule for the original protocol. In fact, a 3-bit instead of a 4-bit secret message can be encoded by performing two unitary transformations on 2 particles of a χ-type quantum state in the original protocol. To overcome this defect, we propose an improved quantum information hiding protocol based on the general term formulas of the entanglement swapping among χ-type states.

Image Hiding Algorithm in Discrete Cosine Transform Domain Based on Grey Prediction and Grey Relational Analysis

Traditional information hiding algorithms cannot maintain a good balance of capacity,invisibility and robustness.In this paper,a novel blind colour image information hiding algorithm based on grey prediction and grey relational analysis in the Discrete Cosine Transform(DCT) domain is proposed.First,this algorithm compresses the secret image losslessly based on the improved grey prediction GM(1,1)(IGM) model.It then chooses the blocks of rich texture in the cover image as the embedding regions using Double-dimension Grey Relational Analysis(DGRA).Finally,it adaptively embeds the compressed secret bits stream into the DCT domain mid-frequency coefficients,which are decided by those blocks' Double-Dimension Grey Correlation Degree(DGCD) and Human Visual System(HVS).This method can ensure an adequate balance between invisibility,capacity and robustness.Experimental results show that the proposed algorithm is robust against JPEG compression(46.724 6 dB when the compression quality factor is 90%),Gaussian noise(45.531 3 dB when the parameter is(0,0.000 5)) etc.,and it is a blind information hiding algorithm that can be extracted without an original carrier.

Information-Theoretic Analysis for the Difficulty of Extracting Hidden Information

The difficulty of extracting hidden information, which is essentially a kindof secrecy, is analyzed by information-theoretic method. The relations between key rate, messagerate, hiding capacity and difficulty of extraction are studied in the terms of unicity distance ofstego-key, and the theoretic conclusion is used to analyze the actual extracting attack on LeastSignificant Bit(LSB) steganographic algorithms.

A New Images Hiding Scheme Based on Chaotic Sequences

We propose a data hidding technique in a still image. This technique is based on chaotic sequence in the transform domain of cover image. We use different chaotic random sequences multiplied by multiple sensitive images, respectively, to spread the spectrum of sensitive images. Multiple sensitive images are hidden in a covert image as a form of noise. The results of theoretical analysis and computer simulation show the new hiding technique have better properties with high security, imperceptibility and capacity for hidden information in comparison with the conventional scheme such as LSB (Least Significance Bit).

Fragile Watermarking Based on Robust Hidden Information

Block-wise fragile watermarks can be used to reveal maliciously tampered areas in multimedia products. However a forged content containing a cloned fragile watermark can be constructed by using a series of watermarked data. To defeat this type of counterfeit attack, a novel fragile watermarking technique is proposed in which different pseudo-random data are selected for different host products, and the generated fragile watermark is dependent upon the selected information. While inserting the fragile watermark, the pseudo-random information is also robustly embedded into the host data. Because of the difference between the selected information, different watermarked data cannot be used to forge illegal contents containing a valid fragile watermark.

An Approach to Hide Secret Speech Information

This paper presented an approach to hide secret speech information in code excited linear prediction (CELP)-based speech coding scheme by adopting the analysis-by-synthesis (ABS)-based algorithm of speech information hiding and extracting for the purpose of secure speech communication. The secret speech is coded in 2.4 Kb/s mixed excitation linear prediction (MELP), which is embedded in CELP type public speech. The ABS algorithm adopts speech synthesizer in speech coder. Speech embedding and coding are synchronous, i.e. a fusion of speech information data of public and secret. The experiment of embedding 2.4 Kb/s MELP secret speech in G.728 scheme coded public speech transmitted via public switched telephone network (PSTN) shows that the proposed approach satisfies the requirements of information hiding, meets the secure communication speech quality constraints, and achieves high hiding capacity of average 3.2 Kb/s with an excellent speech quality and complicating speakers’ recognition.