以即时通信语音流为载体的隐写模型与方法

提出一种采用HOOK机制实现以即时通信语音流为隐藏载体的隐写模型,在通信软件的发送端挂接两个"钩子",采集即时通信语音流作为载体进行实时机密信息嵌入与提取,实现交互式的隐蔽通信过程。选择目前普遍使用的Google talk软件作为研究对象,重点研究Gtalk的iSAC语音编码的隐写方法,建立一种基于LPC参数量化的隐写算法,实现iSAC语音编码下的隐写方法。实验结果表明,该隐写模型适用于目前的即时通信软件的隐蔽通信,拓展了基于VoIP的信息隐写的应用范围;该隐写算法具有良好的隐写容量和隐写速率。     

基于变步长量化的安全图像隐写

图像隐写通过将信息隐藏在载体图像中进行秘密传送,实现隐蔽通信.提出了VSQS图像隐写算法,利用密钥控制生成高斯序列并取整,用于对经伪随机排列后的图像像素进行变步长量化,根据量化像素与秘密信息之间的关系来修改像素,实现信息的嵌入.同时给出了该算法的一种扩展(称为TLQS隐写).实验结果表明,VSQS和TLQS图像隐写可提供较大的隐藏容量,并能抵抗几种常见的隐写分析方法.     

基于隐写编码和Markov模型的自适应图像隐写算法

如何构造大容量、低失真和高统计安全的隐写算法一直是隐写研究的难点和热点.提出一种兼顾感知失真和二阶统计安全的自适应图像隐写算法设计思路.算法将载体各部分的平滑度引入隐写编码的生成过程,自适应地利用一簇隐写编码在载体各部分的合理运用降低载密图像失真度;在隐秘信息嵌入方式上利用基于Markov链模型的动态补偿方法提高载密图像统计安全性;算法对载体最低有效位和次最低有效位进行嵌入以保证嵌入容量.实验表明算法在相同嵌入量下相较双层随机LSB匹配算法以及仅使用一种隐写编码的算法,失真度更低且载体统计分布的改变更小,而在失真度和统计分布改变相近时嵌入容量更大.     

基于小波包分解与矩阵编码的自适应音频隐写算法

针对音频隐写算法载体利用率较低、不可感知性较差、嵌入效率不高的问题,提出了一种基于小波包分解与矩阵编码的自适应音频隐写算法。算法通过对比音频文件在MP3压缩前后小波包分解系数上的差异,将小波系数不变的位数作为嵌入载体,有效提高了嵌入容量;另外采用混沌模型产生随机三元组对矩阵编码算法进行改进,提高了算法的安全性与嵌入效率。算法在容量方面较直接选取中频子带小波系数作为嵌入载体的隐写算法提升约30%;信噪比(SNR)较使用固定三元组的矩阵编码隐写算法提升约9%。实验结果证明了算法的正确性,能基本满足大容量安全通信的需要。     

基于注意力机制的高容量通用图像隐写模型

随着深度学习与隐写技术的发展,深度神经网络在图像隐写领域的应用越发广泛,尤其是图像嵌入图像这一新兴的研究方向.主流的基于深度神经网络的图像嵌入图像隐写方法需要将载体图像和秘密图像一起输入隐写模型生成含密图像,而最近的研究表明,隐写模型仅需要秘密图像作为输入,然后将模型输出的含密扰动添加到载体图像上,即可完成秘密图像的嵌入过程.这种不依赖载体图像的嵌入方式极大地扩展了隐写的应用场景,实现了隐写的通用性.但这种嵌入方式目前仅验证了秘密图像嵌入和恢复的可行性,而对隐写更重要的评价标准,即隐蔽性,未进行考虑和验证.提出一种基于注意力机制的高容量通用图像隐写模型USGAN,利用注意力模块, USGAN的编码器可以在通道维度上对秘密图像中像素位置的扰动强度分布进行调整,从而减小含密扰动对载体图像的影响.此外,利用基于CNN的隐写分析模型作为USGAN的目标模型,通过与目标模型进行对抗训练促使编码器学习生成含密对抗扰动,从而使含密图像同时成为攻击隐写分析模型的对抗样本.实验结果表明,所提模型不仅可以实现不依赖载体图像的通用嵌入方式,还进一步提高了隐写的隐蔽性.     

基于压缩视频的隐写算法研究

视频隐写是以视频为载体的隐写技术,根据嵌入时载体视频是否经过压缩编码将视频隐写分为基于原始视频的隐写和基于压缩视频的隐写两个大类。该文介绍了几种常见的基于压缩视频的隐写算法,给出了一般原理模型,对AC系数、DC系数和运动矢量等编码单元上隐写算法进行了简单介绍,提出了提高隐藏率的基本思想。     

基于多尺度滤波器的空域图像隐写增强算法

隐写是一种利用图像、视频、音频等多媒体载体实现隐蔽传输的技术.如何在尽可能减少对载体影响的情况下嵌入尽可能多的信息一直是隐写算法的研究重点.随着双层校验格码(syndrome tellis codes, STC)的引入,隐写算法的嵌入效率能够达到理论上界.因此,隐写算法的设计重心变为了设计用于衡量图像像素嵌入安全性的失真函数.失真函数是自适应隐写算法的核心.对于空域图像隐写而言,失真函数通常是基于图像的复杂性原则,即载体图像中的纹理区域通常具有较低的失真代价,而平坦区域通常具有更高的失真代价.然而,基于图像内容的多样性,这种准则并不能适用于一幅图像中的所有像素点.提出了一种适用于空域隐写算法的隐写增强算法,通过多尺度滤波器对载体图像进行增强,使得在增强不同尺度的纹理区域的同时减少对图像平坦区域的增强.增强后的失真代价遵循了复杂性原则,并解决了失真代价分配不当的问题.实验结果表明：所提出的算法能够适用于现有的空域隐写算法,并且能够提升它们的抗隐写分析检测能力.     

基于基音周期预测的低速率语音隐写

为了在保证语音通信实时性和一定隐藏容量的同时降低隐写失真以达到较好的不可感知性,提出了一种以低速率语音为载体的双层隐写算法.通过限制语音子帧基音周期值的搜索集合,实现了第一层隐写;利用搜索集合内基音周期取值的任意性,实现了第二层隐写.双层嵌入过程中,以最小化修改幅度为原则决定基音周期的取值,降低了隐写失真.实验结果表明,算法在实时性方面性能优越,并可较好地抵抗隐写分析算法的检测,在嵌入率达到100 bps时仍保持了良好的语音听觉质量.     

基于边缘计算的进化多目标优化图像隐写算法

边缘计算解决了终端因计算资源有限而不能运行复杂应用的弊端,在实际应用中可以支持计算资源受限的终端实现基于图像隐写的隐蔽通信.提出了一种适用于边缘计算场景的进化多目标优化图像隐写算法,首先将优化隐写不可察觉性和隐写安全性作为目标函数,给出了图像隐写的形式化定义;其次通过多个定向和非定向的高通滤波器对图像进行预处理,得到叠加的滤波残差作为秘密信息嵌入的候选位置;然后利用遗传算法中的基因操作,在候选位置中逐代寻找适应度高的个体以得到进化多目标优化问题的最优解;最后,在最优解对应的像素位置实现秘密信息的嵌入.通过和现有算法的仿真对比分析结果表明：提出的算法能够很好地保持图像质量,具有较好的抵抗隐写分析的能力.     

一种融合湿纸码和STC码的高效隐写算法

为提高隐写术的嵌入效率,提出一种融合湿纸编码和STC(syndrome-trellis codes)码的隐写算法。首先使用STC码在载体最低位嵌入第一部分信息;将发生变化的载体元素标记为"dry",未变化的元素标记为"wet";利用湿纸编码保持STC的嵌入结果,保证"wet"元素不作修改,选择"dry"元素的修改方式,并利用修改方式携带第二部分信息。接收方利用STC和湿纸码分别从载体的最低位和次低位提取信息。理论分析和实验结果表明,在相同失真下,该算法的嵌入效率和嵌入率都高于STC算法。算法适用于多种载体,安全性优于单纯使用STC码的隐写算法。     

Data hiding based on overlapped pixels using hamming code

Most data hiding schemes change the least significant bits to conceal messages in the cover images. Matrix encoding scheme is a well known scheme in this field. The matrix encoding proposed by Crandall can be used in steganographic data hiding methods. Hamming codes are kinds of cover codes. “Hamming + 1” proposed by Zhang et al. is an improved version of matrix encoding steganography. The embedding efficiency of “Hamming + 1” is very high for data hiding, but the embedding rate is low. Our proposed “Hamming + 3” scheme has a slightly reduced embedding efficiency, but improve the embedding rate and image quality. “Hamming + 3” is applied to overlapped blocks, which are composed of 2^k+3 pixels, where k=3. We therefore propose verifying the embedding rate during the embedding and extracting phases. Experimental results show that the reconstructed secret messages are the same as the original secret message, and the proposed scheme exhibits a good embedding rate compared to those of previous schemes.     

Reversible steganography based on side match and hit pattern for VQ-compressed images

Data hiding is an important technique in multimedia security. Multimedia data hiding techniques enable message senders to disguise secret data by embedding them into cover media. Thus, delivering secret messages is as easy as sending the cover media. Recently, many researchers have studied reversible data hiding for images. Those methods can reconstruct the original cover image and extract the embedded secret data from a stego-image. This study proposes a novel reversible steganographic method of embedding secret data into a vector quantization (VQ) compressed image by applying the concept of side match. The proposed method uses extra information, namely the hit pattern, to achieve reversibility. Moreover, its small hit pattern enables the embedding of the entire hit pattern along with the secret data in most cases. To optimize visual quality of the output stego-image, the method applies the concept of partitioned codebooks (state codebooks). The partition operation on the codebook uses a look-up table to minimize embedding and extraction time. We also propose the use of diagonal seed blocks to embed the entire hit pattern into the cover image without producing any extra control messages. Compared to the Chang and Lin method, the experimental results show that the proposed method has higher capacity, better visual quality, and shorter execution time.     

Separable reversible data hiding in encrypted images based on scalable blocks

This paper proposes a new separable reversible data hiding method for encrypted images. Proposed scheme employs the pixel redundancy of natural images to construct embedding space. First, cover image is divided into multiple blocks with different scales. According to the pixel average value of each block, the lowest two bits of every pixel are vacated as reserved rooms. Subsequently, the whole image is encrypted by using stream cipher and the secret messages are finally embedded into the reserved rooms by the embedding key. Proposed scheme is separable in the sense that the recipient can achieve different function by the following ways: (a) If the recipient has only decryption key, an approximation plaintext image containing the embedded information can be obtained. (b) If the recipient has only embedded key, secret messages can be extracted correctly. (c) If the recipient has both decryption key and embedded key, he can not only extract the secret messages, but recover the original cover image perfectly. Extensive experiments are performed to show that our proposed schemes outperform existing reversible data hiding schemes in terms of visual quality, embedding capacity and security performance, even if a large-scale image database is used.

     

Data hiding using edge detector for scalable images

In this paper we propose a data hiding method that utilizes image interpolation and an edge detection algorithm. Image interpolation algorithm enlarges a cover image before hiding secret data in order to embed a large amount of secret data. Edge detection algorithm is applied to improve a quality of stego-image. Experimental results show that the proposed method can embed a large amount of secret data while keeping visual quality better than previous works. We demonstrate that the average capacity is 391,115bits, and the PSNR and quality index are 44.71dB, 0.9568 for gray images when threshold value is 4 and the embedding bits are given to 2 respectively.     

A High Capacity 3D Steganography Algorithm

In this paper, we present a very high-capacity and low-distortion 3D steganography scheme. Our steganography approach is based on a novel multi-layered embedding scheme to hide secret messages in the vertices of 3D polygon models. Experimental results show that the cover model distortion is very small as the number of hiding layers ranges from 7 to 13 layers. To the best of our knowledge, this novel approach can provide much higher hiding capacity than other state-of-the-art approaches, while obeying the low distortion and security basic requirements for steganography on 3D models.     

Secure data hiding scheme using shape generation algorithm: a key based approach

Data hiding in images has evolved as one of the trusted methods of secure data communication and numerous approaches have been introduced over the years using gray scale images as the cover media. Most of the methods are based on data hiding in least significant bit planes of cover images. Many such methods purely depend on data substitution algorithms by defining a pattern in which data is embedded. One can gain access to the secret data in a few attempts, if the algorithm is known. Keeping this in view several approaches based on secret keys have also been proposed by researchers. This paper proposes an efficient data embedding scheme using a key and an embedding pattern generated through midpoint circle generation algorithm. The pattern can be applied to a carrier that is mapped onto a grid/image. The cryptosystem uses the concept of steganography and is computationally light and secure. The secret-key is generated in such a way that Avalanche effect is ensured except in very rare cases. The proposed data embedding method is shown to be robust and highly secure while maintaining good hiding capacity and imperceptibility. It is applicable for data hiding in a generic grid that could be of pixels or bits.     

A high-capacity performance-preserving blind technique for reversible information hiding via MIDI files using delta times

A new high-capacity information hiding method for embedding secret messages into MIDI files is proposed. The method can preserve the original musical performance of the cover MIDI file. The property of the variable-length quantity, which expresses the magnitude of the delta time before every event in a MIDI file, is utilized for secret bit embedding. The embedding is accomplished by padding the delta times with different numbers of leading constant bytes of 80₁₆ to represent the secret bits. The method is both reversible and blind because the original cover MIDI file can be restored completely from the stego-MIDI file by extracting the embedded data out from the resulting stego-MIDI file without referencing the original cover MIDI file. A capability of hiding a large amount of secret information is achieved since the delta time is a basic parameter that appears before every event in the MIDI file. Good experimental results yielded by the proposed method as well as a comparison of the method with five existing performance-preserving methods from the viewpoints of stego-file quality, payload capacity, and data security show the superiority and feasibility of the proposed method.

     

基于CL多小波变换和组合位平面理论的秘密信息共享算法

针对信息隐藏算法容量和不可见性与鲁棒性矛盾的特点,提出了一种新的基于Chui-Lian(CL)多小波变换和组合位平面(CBP)理论的数字图像载体预处理算法,并将该算法用于以数字图像为载体的信息隐藏,以实现秘密通信和图像共享。其中,CL多小波变换能够将载体图像划分为4个能量等级不同的最低分辨率子图像,组合位平面理论可将子图像解析为不同的位平面层次,在隐藏秘密信息时,可根据最低分辨率子图和组合位平面的能量等级由高到低分别嵌入鲁棒信息、秘密信息和脆弱信息。实验结果表明,在25%的嵌入率时,与基于离散余弦变换和最低有效位方法的信息隐藏算法（DCT-LSB）、基于离散小波变换和最低有效位方法的信息隐藏算法（DWT-LSB）相比,所提算法针对若干常见攻击的鲁棒性有一定程度提升,峰值信噪比（PSNR）分别提高了37.16%和20.00%。     

文本信息隐藏的统计检测算法

文本信息隐藏(TIH)是把隐秘信息嵌入文本载体中的技术,探讨其逆向攻击手段对于信息安全(IS)领域有着重要的意义.本文提出一种基于词间相关度统计特性的文本信息隐藏检测算法,并利用该算法对文本信息隐藏系统NICETEXT做了检测实验,取得了很好的效果.在对115个正常的文本段和212个由NICETEXT生成的文本段进行检测的实验中,成功地检测出106个正常的文本段和209个由NICETEXT生成的文本段.其中仅有9个正常文本段和3个生成文本段发生了误判,检测正确率高达96.3%.     

Huffman-code strategies to improve MFCVQ-based reversible data hiding for VQ indexes

Data hiding, which embeds secret data into cover media, is one type of technology used to achieve the multimedia security. A reversible data hiding method has the characteristic that the cover media can be completely reconstructed after secret data are extracted. Recently, some reversible data hiding schemes have focused on the vector quantization (VQ)-compressed format. Using the modified fast correlation vector quantization (MFCVQ) concept, Lu et al. proposed a reversible data hiding scheme for VQ-index tables. In this paper, a new MFCVQ-based scheme is proposed. Specifically, our method will enlarge the embedding capacities by embedding multiple bits into a VQ index, thereby reducing the compressed bit rates by applying the Huffman-code concept and the 0-centered classification. Experimental results indicate that this method has greater pure embedding capacities and fewer compressed bit rates than that of previous MFCVQ-based methods.