Adaptive Particle Swarm Optimization Data Hiding for High Security Secret Image Sharing

The main aim of this work is to improve the security of data hiding for secret image sharing. The privacy and security of digital information have become a primary concern nowadays due to the enormous usage of digital technology. The security and the privacy of users’ images are ensured through reversible data hiding techniques. The efficiency of the existing data hiding techniques did not provide optimum performance with multiple end nodes. These issues are solved by using Separable Data Hiding and Adaptive Particle Swarm Optimization (SDHAPSO) algorithm to attain optimal performance. Image encryption, data embedding, data extraction/image recovery are the main phases of the proposed approach. DFT is generally used to extract the transform coefficient matrix from the original image. DFT coefficients are in float format, which assists in transforming the image to integral format using the round function. After obtaining the encrypted image by data-hider, additional data embedding is formulated into high-frequency coefficients. The proposed SDHAPSO is mainly utilized for performance improvement through optimal pixel location selection within the image for secret bits concealment. In addition, the secret data embedding capacity enhancement is focused on image visual quality maintenance. Hence, it is observed from the simulation results that the proposed SDHAPSO technique offers high-level security outcomes with respect to higher PSNR, security level, lesser MSE and higher correlation than existing techniques. Hence, enhanced sensitive information protection is attained, which improves the overall system performance.     

On Security of Compressed Gray Scale Image Using Joint Encryption and Data Hiding

ABSTRACT

This paper proposes a novel scheme that integrates quality access control and tracking of illicit distribution of digital image(s) in a single platform. The goal is achieved by (1) modulating some of the valuable Discrete Cosine Transform (DCT) coefficients of the compressed data followed by (2) embedding a binary watermark (fingerprint) as tracking information using Quantization Index Modulation (QIM). The data modulation process serves the purpose of access control so that an unauthorized user is unable to enjoy proper visual quality. On the other hand, embedded watermark tracks illicit distribution. The coefficients to be modulated are selected pseudo randomly using a secret key (K). Before embedding, the watermark is encoded by applying convolution coding that reliably identifies colluder(s) involved in time varying (intelligent) collusion operation. Simulation results have shown the validity of the above claims without affecting compatibility with standard JPEG coding scheme.     

Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding

It has recently been discovered that using pseudorandom sequences as carriers in spread-spectrum techniques for data-hiding is not at all a sufficient condition for ensuring data-hiding security. Using proper and realistic apriori hypothesis on the messages distribution, it is possible to accurately estimate the secret carriers by casting this estimation problem into a blind source separation problem. After reviewing relevant works on spread-spectrum security for watermarking, we further develop this topic to introduce the concept of security classes which broaden previous notions in watermarking security and fill the gap with steganography security as defined by Cachin. We define four security classes, namely, by order of creasing security: insecurity, key security, subspace security, and stegosecurity. To illustrate these views, we present two new modulations for truly secure watermarking in the watermark-only-attack (WOA) framework. The first one is called natural watermarking and can be made either stegosecure or subspace secure. The second is called circular watermarking and is key secure. We show that circular watermarking has robustness comparable to that of the insecure classical spread spectrum. We shall also propose information leakage measures to highlight the security level of our new spread-spectrum modulations.     

彩色图像的无损数据隐藏

提出一种在彩色图像中新的无损数据隐藏算法。首先对RGB图像直方图调整分别压缩灰度动态范围。然后进行整数YUV变换和Y分量整数小波变换。最后通过算术编码和哈希变换,将待隐藏信息连同压缩灰度动态范围剩余数据,嵌入小波高分辨率子带的中间位平面内,达到小波反变换时防止溢出的目的,实现无损数据隐藏。文中用6个通用的图像隐藏数据为例,嵌入数据容量达到19～73kbits。将该方法用于电子政务中,取得了良好的效果。     

基于隐藏的信息安全技术

从Piftie—Hellman交换、散列算法和Shamir协议出发，提出了一种网络信息安全传输的解决方案，它在某种程度上解决了秘密消息的安全传输问题，取得了较好的仿真效果，具有较实际的应用前景.     

基于预测误差扩展的高动态范围图像可逆数据隐藏

针对高动态范围(HDR)图像组成通道复杂、数据隐藏较为困难的问题,提出一种基于预测误差扩展的HDR图像可逆数据隐藏算法.首先采用光辉格式编码HDR图像;然后利用HDR图像组成通道间的冗余性,把像素分为平滑和边缘像素2类;再对这2类像素分别采取不同的嵌入方式,并根据排序策略依次对像素点嵌入数据;最后在提取端提取信息之后,载体图像可以完整恢复.实验结果表明,相对于传统数据隐藏算法,该算法更好地利用了HDR图像通道间的相互关系,在图像失真较少的情况下可以隐藏更多的数据.     

一种基于像素预测的图像可逆信息隐藏策略

基于像素点预测的可逆信息隐藏(Reversible Data Hiding,RDH)是当今一种低失真、高容量的信息隐藏策略,特别是对于差值扩展和直方图平移算法而言,准确预测可以同时提高数据容量和减小图像失真。文中提出了一种基于像素预测差的直方图平移方案。首先,采用Warped Distance算法来对像素值进行预测,并在此基础上利用图像的局部梯度来实现对像素值的更精确预测。综合上述两种策略,改进了现有的直方图平移算法,同时也给出了防止像素值在平移后溢出的建议。实验结果表明,相对于近年来的其他方案,该方案能够在保证图像质量的情况下有效提升数据嵌入量,并且通过调整数据嵌入层级,可以在具体使用该算法时针对图像质量和数据嵌入量进行权衡。这也进一步说明了利用图像的局部特性,特别是梯度与图像局部几何相似性,可以有效提升像素预测的精度,从而改善可逆信息隐藏的容量-失真性能。     

Pattern-Based Data Hiding for Binary Image Authentication by Connectivity-Preserving

In this paper, a novel blind data hiding method for binary images authentication aims at preserving the connectivity of pixels in a local neighborhood is proposed. The "flippability" of a pixel is determined by imposing three transition criteria in a 3 times 3 moving window centered at the pixel. The "embeddability" of a block is invariant in the watermark embedding process, hence the watermark can be extracted without referring to the original image. The "uneven embeddability" of the host image is handled by embedding the watermark only in those "embeddable" blocks. The locations are chosen in such a way that the visual quality of the watermarked image is guaranteed. Different types of blocks are studied and their abilities to increase the capacity are compared. The problem of how to locate the "embeddable" pixels in a block for different block schemes is addressed which facilitates the incorporation of the cryptographic signature as the hard authenticator watermark to ensure integrity and authenticity of the image. Discussions on the security considerations, visual quality against capacity, counter measures against steganalysis and analysis of the computational load are provided. Comparisons with prior methods show superiority of the proposed scheme     

基于预测熵的JPEG图像无损数据隐藏

针对数据隐藏中的子块选择问题,提出一种基于预测熵的JPEG图像无损数据隐藏方法。利用直方图对法预测JPEG图像DCT系数块的熵,选择熵小的子块,并在中低频系数中嵌入数据。该方法可实现嵌入数据的盲提取和图像数据的无损恢复,且无需记录嵌入数据的子块位置。实验结果表明,与其他方法相比,该方法获得图像的峰值信噪比较高,数据隐藏性能较好。     

基于USM的改进Retinex算法安检图像增强

为了提高安检图像质量,提出用Retinex算法对其进行增强处理,并对Retinex算法做了改进.改进算法首先结合反锐化掩模(Unsharp Masking,USM)算法中提高高频成分的思想,增强了安检图像的轮廓部分;然后用限制对比度自适应直方图均衡化(Contrast Limited Adaptive Histogram Equalization,CLAHE)算法增强图像对比度.实验结果和数据表明,相比传统Retinex算法增强后的安检图像,论文算法能在有效增强安检图像的同时保留图像局部信息.     

基于直方图对的JPEG图像无损数据隐藏

提出一种基于直方图对的JPEG图像无损数据隐藏方法。该方法通过调整直方图,在JPEG图像的量化后DCT中频系数中嵌入隐藏数据。同时,能够在不需要原始图像的情况下对隐藏数据进行盲提取并无损恢复图像数据。通过设置2个阈值来选择调整的直方图对和进行调整的DCT系数块,该方法能够在嵌入大数据量的同时依然保持较好的视觉效果。     

数据隐藏中图像去噪攻击及其对策

数字水印是数字版权保护中的关键技术,本文从水印攻击角度分析了去噪攻击的原理,并且提出了相应的解决办法,通过实验证明了理论分析的正确性,这对水印算法研究和设计有一定的参考价值。     

基于加密和信息隐藏技术的数据安全传输

简单介绍了密码学中对称密码,非对称密码体制和数字签名技术,介绍了信息隐藏技术并分析比较了密码学和信息隐藏的区别.给出了基于数字加密与信息德藏相结合的数据传输的思路及实现方案.     

Security of Lattice-Based Data Hiding Against the Watermarked-Only Attack

This paper presents a security analysis for data-hiding methods based on nested lattice codes, extending the analysis provided by previous works to a more general scenario. The security is quantified as the difficulty of estimating the secret key used in the embedding process, assuming that the attacker has several signals watermarked available with the same secret key. The theoretical analysis accomplished in the first part of this paper quantifies security in an information-theoretic sense by means of the mutual information between the watermarked signals and the secret key, addressing important issues, such as the possibility of achieving perfect secrecy and the impact of the embedding rate in the security level. In the second part, a practical algorithm for estimating the secret key is proposed, and the information extracted is used for implementing a reversibility attack on real images.      

数据隐藏技术在物联网安全中的应用探索

由于物联网感知前端射频识别系统的工作环境是完全开放的,因此应答器和读写器之间的通信是在完全没有保护的情况下进行的。这就使得物联网用户的信息安全和个人隐私面对着各种各样的威胁。使用高级加密算法的应答器和读写器双向认证协议由于硬件实现成本高而限制了它在物联网中的应用范围。该文通过在应答器和读写器的双向认证过程中引入数据隐藏算法来确保信息传输过程中的安全性,并对其应用的可行性进行分析。     

一种基于游程长度的高安全性图像信息隐藏算法

针对目前多数信息隐藏算法的安全性不高使其无法应用于隐蔽通信等领域的问题,提出了一种基于游程长度的隐藏算法,算法的基本思想是将图像分解成多个二值图像,通过对分解后的二值图像游程长度的奇偶性来隐藏信息,最多改变二值图像黑白交界处的一个像素值便可隐藏1bit的信息,隐藏信息可实现盲提取。算法未造成图像低位平面的0和1分布特性的明显改变,也未造成长游程的减少,因此可抵御许多针对LSB及其改进方法的隐写分析技术的检测。仿真试验结果显示,算法的安全性高,不可感知性好,并且嵌入容量大,可应用于隐藏通信等对隐藏容量和安全性有较高要求的场合。     

面向网络数据安全的高效图像隐写研究

针对传统图像隐写算法计算消耗时间较长的问题,提出了立方体迷你数独矩阵(CMSM)和两层数据隐写方案.将矩阵及其相应的数据嵌入和提取算法推广到N维迷你数独矩阵(NMSM),并阐述了提高时间效率的机制.通过定义了距离定位函数,可以显著提高多维参考矩阵的嵌入效率.该数据隐写方案具有复杂度高,能有效地提高数据隐写的安全性.实验结果表明,该数据隐写方案不仅能获得更好的图像质量,而且比其他相关方案具有更高的嵌入容量.     

基于异或-置乱框架的图像可逆数据隐藏仿真

针对因图像加密、解密过程中图像还原度较差,数据嵌入率较低,导致图像传输过程中图像质量差,安全性低的问题,提出一种基于异或-置乱框架的图像可逆数据隐藏方法。分析相邻像素间位异或-置乱法,使用位异或和像素位置置乱方式对初始图像做加密处理,得到初始加密图像,根据隐藏密钥特征选取一部分像素,利用替换方法把选取像素嵌入隐藏数据中,使用加密密钥将隐藏数据提取出来,最后通过邻域预测方式对加密图像做解密处理,并根据像素波动性算出各邻域模块最高位是否发生改变,还原初始图像。仿真结果表明,采用所提方法得到的图像还原性较好,数据嵌入率较高,可以有效保护图像传输中的安全,并保证图像质量,具有一定的实践价值。     

Security of Lattice-Based Data Hiding Against the Known Message Attack

Security of quantization index modulation (QIM) watermarking methods is usually sought through a pseudorandom dither signal which randomizes the codebook. This dither plays the role of the secret key (i.e., a parameter only shared by the watermarking embedder and decoder), which prevents unauthorized embedding and/or decoding. However, if the same dither signal is reused, the observation of several watermarked signals can provide sufficient information for an attacker to estimate the dither signal. This paper focuses on the cases when the embedded messages are either known or constant. In the first part of this paper, a theoretical security analysis of QIM data hiding measures the information leakage about the secret dither as the mutual information between the dither and the watermarked signals. In the second part, we show how set-membership estimation techniques successfully provide accurate estimates of the dither from observed watermarked signals. The conclusion of this twofold study is that current QIM watermarking schemes have a relative low security level against this scenario because a small number of observed watermarked signals yields a sufficiently accurate estimate of the secret dither. The analysis presented in this paper also serves as the basis for more involved scenarios     

图像为载体的信息隐藏数据量研究

信息隐藏量、透明性及鲁棒性是信息隐藏最重要的特性．文中以256级灰度图像为载体,在第k(k=0,1,2,…,7)个位面和第0～k多个位面,用LSB方法分别隐藏二值图像和汉字文本．给出了256级灰度图像在单个位面和多个位面隐藏汉字文本及其他数字信息的算法,并给出在256级灰度图像的单个位面隐藏二值图像和多个位面隐藏汉字文本的实验结果,对隐藏图像的情形做了攻击性实验,定量给出了各种隐藏方案中信息隐藏量、透明性及鲁棒性之间的量值关系．