基于马赛克技术的秘密图像共享

在传统的秘密图像共享算法中,通常产生类似噪声的影子图像,极易引起攻击者的注意。针对这一问题,文中根据马赛克技术提出了一种产生有意义的影子图像算法。通过图像相似度的比较,可将秘密图像共享到载体图像中,得到含有秘密图像信息的马赛克图像。然后采用可逆信息隐藏的技术将图像块的位置序列隐藏到马赛克图像中,得到完整的影子图像。通过文中所提算法产生的影子图像,既可避免攻击者的注意又能恢复出无损的秘密图像。     

基于多项式秘密共享的图像密文域可逆信息隐藏

针对密文域可逆信息隐藏在多用户场景下算法嵌入率低、载体图像容灾性能较弱等问题，该文提出一种基于多项式秘密共享的图像密文域可逆信息隐藏方案。通过将图像分割成多幅影子图像并存储在不同的用户端，可以增强图像的容灾性，为了实现额外信息在图像重构前后提取的可分离性，该方案包括两种嵌入算法:算法1在图像分割的过程中，将额外信息嵌入多项式的冗余系数中得到含有额外信息的影子图像，该算法支持在图像重构之后提取额外信息；算法2针对图像分割后的任一影子图像，利用秘密共享的加法同态特性实施嵌入，该算法支持直接从影子图像中提取额外信息。实验在不同门限方案和影子图像压缩率的条件下进行测试，当压缩率为50%时，(3, 4)门限方案的嵌入率达4.18 bpp(bit per pixel)，(3, 5)门限方案的嵌入率达3.78 bpp。结果表明，两种嵌入算法分别支持从影子图像与重构图像中提取额外信息，实现了方案的可分离性；与现有方案相比，所提算法嵌入率较高、计算复杂度较低，具有较强的实用性。     

多重门限的图像秘密共享方案

 针对传统的基于视觉密码的图像秘密共享方案存在像素扩张导致其只能共享小尺寸的秘密图像、信息隐藏效率较低的问题,提出一种能够提高信息隐藏容量的(t,k,n)多重门限图像秘密共享方案.该方案利用秘密图像信息控制视觉密码方案中共享矩阵的选取,从而实现秘密图像在视觉密码方案中的隐藏.在秘密图像恢复的第一阶段,任意t个参与者直接叠加其影子图像后可以视觉解密出低质量的秘密图像信息;在第二阶段,任意k个参与者可以从影子图像中提取出隐藏的信息,并通过计算恢复出精确的灰度秘密图像.相对于传统的视觉密码方案,本文方案在不影响视觉密码恢复图像的视觉质量前提下,可以隐藏更多的秘密图像信息,而像素扩张尺寸较小.     

Efficient multi-secret image sharing based on Boolean operations

(n,n) visual secret sharing (VSS), first proposed by Naor and Shamir (1995) [4], is used to encode (encrypt) a secret image into n meaningless share images to be superimposed later to decode (decrypt) the original secret by human visual system after collecting all n secret images. In recent years, VSS-based image sharing (encryption) and image hiding schemes, two of a variety of applications based on VSS, have drawn much attention. In this paper, an efficient (n+1,n+1) multi-secret image sharing scheme based on Boolean-based VSS is proposed to not only keep the secret images confidential but also increase the capacity of sharing multiple secrets. The Boolean-based VSS technology, used to encode the secret images, generates n random matrices; then the n secret images are subsequently encoded into the n+1 meaningless share images. It is worthwhile to note that n secret images can be hidden by means of sharing only n+1 share images in the proposed scheme instead of 2n share images. Thus, the present scheme thus benefits from (1) reducing the demand of image transmission bandwidth, (2) easing the management overhead of meaningless share images, and (3) involving neither significant extra computational cost nor distortion for reconstructed secret images. The experimental results show the performance in terms of feasibility and image sharing capacity. Applied into image hiding schemes, the proposed scheme can enhance the hiding capacity.     

Quadri-directional searching algorithm for secret image sharing using meaningful shadows

Contrary to conventional protecting data such as cryptographic techniques which encrypt the data with a secret key, secret sharing takes an approach to ensure well protection of transmitted information by allowing a secret message M to be divided into n pieces. Secret message M can be held by n participants to avoid the secret from incidentally or intentionally being lost. In a secret sharing scheme, secret information leaks from shadows, attack on shadow image, and large shadow image issues which has arisen when developing an algorithm. Although existing algorithms provide remedies for such problems, the computational complexity of existing algorithms is still questionable. Therefore, we propose a low computational complexity Quadri-Directional Searching Algorithm (QDSA) for secret image sharing. Experiment results show that the proposed algorithm ensures that generated shares are of high quality and no secret information is leaked from these shares, thus it guarantees high security of our scheme.     

Essential secret image sharing scheme with different importance of shadows

In (k, n) secret image sharing (SIS), a scheme encrypts a secret image into n shadow images. Any k or more shadow images can be collaborated together to reveal the secret image. Most of the previous SIS schemes don’t distinguish the importance of shadows. However, in some application environments, some participants are accorded special privileges due to their status or importance. Thus, some shadows may be more important than others. In this paper, we consider the (t, s, k, n) essential SIS (ESIS) scheme. All n shadows are classified into s essential shadows and (n–s) non-essential shadows. When reconstructing the secret image, the (t, s, k, n)-ESIS scheme needs k shadows, which should include at least t essential shadows.     

Scalable user-friendly image sharing

Image sharing addresses a fault-tolerant protection mechanism for important images. In a typical image sharing scheme, the generated shadow images usually have a noise-like appearance that conceals the secret image completely, but this makes them difficult to identify and manage. This paper proposes a scalable user-friendly image sharing scheme in which each generated shadow image looks like a shrunken replica of the original image. The scheme provides an easy-to-identify interface for managing the shadow images. Compared with previous user-friendly image sharing schemes, the proposed method can reconstruct the original image without any loss and still has the small-size shadow images. A notable feature is that the qualities of generated shadow images are scalable in the proposed scheme, which allows the quality of the shadow images to be adjusted according to the requirements of diverse applications.     

A Novel （n, n） Secret Image Sharing Scheme Based on Sudoku

Recently, Chang et al. proposed a Sudoku-based secret image sharing scheme. They utilized the Sudoku grid to generate meaningful shadow images, and their scheme satisfied all essential requirements. Based on Chang et al.'s scheme, we propose a novel (n, n) secret image sharing scheme based on Sudoku. In the proposed scheme, a secret image can be shared among n different cover images by generating n shadow images, and the secret image can be reconstructed without distortion using only these n shadow images. Also, the proposed scheme can solve the overflow and underflow problems. The experimental results show that the visual quality of the shadow images is satisfactory. Furthermore, the proposed scheme allows for a large embedding capacity.     

Scalable secret image sharing

In this paper, we propose an innovative scheme, namely the scalable secret image sharing scheme, for sharing an image O among n participants such that the clarity of the reconstructed image (i.e., the amount of information therein) scales with proportion with the number of the participants. The proposed scheme encodes O into n shadow images that exhibit the following features: (a) each shadow image reveals no information about O, (b) each shadow image is only half the size of O, (c) any k (2⩽k⩽n) shadow images can be used to reconstruct O in a scalable manner such that the amount of information about O is proportional to k, and (d) O can be reconstructed perfectly when all of the n shadow images are available. The clarity of O can be measured in terms of several metrics. We define three modes, namely the multisecret, priority, and progressive modes, for sharing O in our scheme. The scalability and flexibility of the proposed schemes indicate the wide range of potential applications for secret image sharing.     

多版本备份和限制性双重认证主密钥(t,s,k,n)图像分存

传统影子图像连接的（t,s,k,n）分存易导致分发影子图像大小不等,基于伯克霍夫插值的（t,s,k,n）分存不能高效恢复;而双认证自修复图像分存对密图和备份图恢复能力十分有限.针对以上问题,采用随机参与值通过（k,s）和（k-t,n-s）分存来构造主密钥（t,s,k,n）分存并通过第3方公信方存储的MD5值以防止作弊.所提策略由主密钥对密图LL子带置乱来形成对显著比特多备份、对非显著比特少备份和经主密钥不同程度置乱的多版本备份图;引入限制性双重认证在保持认证精度的同时,将尽可能多的备份比特通过GF（2^8）域（k,n）分存嵌入来形成嵌密掩体.理论和实验表明,主密钥（t,s,k,n）分存可高效求解;随机参与值可避免参与者编号泄露,分发信息的篡改和认证比特的揣测;多版本备份可对备份图高置信度地恢复;而限制性双重认证在认证能力上不低于双认证自修复图像分存.     

基于随机变换的大容量隐藏算法

主要研究利用图像低位平面数据位的运算来减小对载密图像修改的信息隐藏算法.在嵌入信息时对秘密信息进行连续多次随机变换的同时与载体信息进行位运算,以此求出对载体图像修改量最小的嵌入方式.从而实现在相同嵌入量的条件下尽量减少对载体图像的修改,提高了载密图像的质量.实验结果表明,该算法能有效地减少载体图像的失真,在嵌入大量信息...     

Sharing more information in gray visual cryptography scheme

Visual cryptography scheme (VCS) shares a binary secret image into several binary shadows, and the secret image can be visually revealed by stacking qualified shadows without computation. From the point of view of sharing secret information, VCS is not efficiency because of the large size expansion and low visual quality. In this paper, we introduce a general gray visual cryptography scheme, which can share more information, called Sharing More Information Gray Visual Cryptography Scheme (SMIGVCS). All the shadow pixels of VCS embed additional information to generate gray shadows of SMIGVCS, and the embedded information comes from the shadows of a polynomial-based secret sharing scheme (PSSS). In the revealing process, a vague secret image is visually decoded by stacking qualified shadows, and more information is revealed by computation. Compared with the two-in-one image secret sharing scheme (TiOISSS), our SMIGVCS can achieve smaller shadow size with acceptable visual quality.     

多级秘密信息隐藏方法

针对普通的一级秘密信息隐藏的方法具有安全性低,视觉效果差的问题,本文提出了一种多级别信息隐藏的方法.该方法使一级秘密信息在一级密钥作用下成为宿主图像,提高了信息隐藏的安全性,再将宿主图像分成3×3的图像块,在二级密钥的控制下成功将二级秘密信息嵌入.采用图像置乱和LSB算法的结合方法,并在两级秘密信息的作用下,使得载密图...     

A Steganography-Based Optical Image Encryption System Using RGB Channel Integration

An optical image encryption system with adaptive steganography using red, green, and blue (RGB) channel integration is proposed. The optical image encryption system employs a double random phase encoding algorithm to encrypt and decrypt color images. The RGB channel in a color image is first integrated into a large grayscale image. Then the integrated image is encrypted by two random phase masks. The secret data is then embedded into the encrypted image with a specific hiding sequence generated by the zero-LSB (least significant bits) sorting technique which is a content-dependent and low distortion data embedding method. Experimental results show that the proposed method has a good performance in both hiding capacity and decrypted image quality.     

A secure high capacity full-gray-scale-level multi-image information hiding and secret image authentication scheme via Tchebichef moments

The growth of image processing tools and applications has made it easy for multi-media content such as music, audio, and video to be manipulated or forged during transmission over the Internet. Efforts, such as information hiding in steganography, have been unable to secure data transmission and prevent its manipulation. Usage of coding theory, including cryptography, is not full proof in the sense that an unauthorized intruder may inject (tampering) and incorporate unintended data to the messages, which can tamper the transmitted data. There is a need for more transparent message information hiding schemes along with information content verification and authentication, as well as accurate tampering detection. In particular, as it is well known, in many current steganography methods, widely used for image information hiding, there are various technical challenges associated with hiding large amounts of image information in images. Some of these challenges relate to which locations, in a given carrier image, information has to be hidden in order to guarantee transparency of the resulting watermarked images, to the ability to extract hidden information accurately, to the performance of hidden secret information authentication and verification at the receiving end, to the dependency of the hidden information on a given carrier image, to the robustness of information hiding schemes to affine transformations such as rotation, and to the amount of data and number of full-scale images one can embed in a given single image carrier. Additionally, as it is well known, many of the existing stenography methods are based on the Discrete Fourier Transform (DFT), the Discrete Cosine Directors (DCT), or the Discrete Wavelength Transform (DWT) methods, which result in high Bit Error Rate (BER) of the extracted data. In this paper we present a secure high capacity image information hiding scheme where two full separate arbitrary full-scale gray level images (versus binary), one hidden information image and one authentication watermark image are hidden/embedded in the Tchebichef moments of a carrier image with very high imperceptibility. Here the second watermark image is used for identification and content integrity verification and authentication of the hidden secret image. Both the hidden secret hidden image and the authentication watermark image are of the same size as that of a given arbitrary carrier image. In particular, with the cost of computer memory getting lower and the bandwidth of transmission channels getting larger, we show how three different watermarked images, but the same to a naked eye, are produced and transmitted to achieve the desired advantages of high accuracy, security, authentication and verification of the recovered information. To the best of our knowledge, this two-full-scale gray images data hiding and hidden secret image information verification and authentication method is the first attempt of its sort. We show here the robustness of the proposed scheme to affine transformations such as rotation, scaling, and translation, the proposed scheme's high image malicious tampering detection and tampering localization and its high quality extracted recovered and authenticated hidden secret images. Additionally, in order to as much as possible keep the integrity of the received information, when watermarked images are rotated during transmission, a new image rotation estimation and recovery algorithm is presented as part of the proposed information hiding scheme. We show the effect of intended tampering attacks namely, cropping, noise, low-pass and high-pass filtering on the presented scheme. We also show how the extracted information accuracy is generally independent of the carrier image, and we present a mathematical analysis for characterizing the conditions under which transparency of the hidden embedded information is generally achieved for any given arbitrary carrier image. The case of how to extract the hidden information when one or two of the watermarked images is (are) lost is also tackled. Finally, experimental results on real images are presented to illustrate the efficiency and capabilities of the proposed method.     

A Subband Adaptive Filtering Algorithm Employing Dynamic Selection of Subband Filters

In 2007, Wang and Shyu proposed a scalable secret image sharing scheme in which three sharing styles, namely the multisecret, priority, and progressive modes, are designed to encode an image with diverse revealing effects. Their scheme is a (2, n ) sharing method where each generated shadow image is half size of the original image. This letter proposes a general (t,n), 2 ? t ? n, scalable secret image sharing scheme with the same revealing effects. Notably, the size of each generated shadow image is only (2n-t)/n ² times of the original image. The smaller size of the generated shadow images makes their transmission and storage more efficient.     

Enhanced hybrid image security algorithms for high definition images in multiple applications

Protection of multimedia information from different types of attackers has become important for people and governments. A high definition image has a large amount of data, and thus, keeping it secret is difficult. Another challenge that security algorithms must face with respect to high definition images in medical and remote sensing applications is pattern appearances, which results from existing regions with high density in the same color, such as background regions. An encryption and hiding based new hybrid image security systems are proposed in this paper for the purpose of keeping high definition images secret. First, one hiding method and two encryption methods are used in two hybrid algorithms. The new hiding algorithm proposed here starts by applying reordering and scrambling operations to the six Most Significant Bit planes of the secret image, and then, it hides them in an unknown scene cover image using adding or subtracting operations. Second, two different ciphering algorithms are used to encrypt the stego-image to obtain two different hybrid image security systems. The first encryption algorithm is based on binary code decomposition, while the second algorithm is a modification of an advanced encryption standard. After evaluating each hybrid algorithm alone, a comparison between the two hybrid systems is introduced to determine the best system. Several parameters were used for the performance, including the visual scene, histogram analysis, entropy, security analysis, and execution time.

     

基于二级定位的编码信道信息隐藏算法

分析了以编码信道为载体的信息隐藏算法及容量,指出现有算法存在的问题,提出了一种结合容量上限判断的基于二级定位的信息隐藏算法。所提算法在秘密信息嵌入前首先计算系统隐藏容量上限,并判断是否超出;接着在嵌入位置选择过程中引入二级定位以及循环移位机制。仿真结果表明,相比已有算法,所提算法能较好地避免因隐藏容量过大而导致秘密通道暴露的风险;同时通过二级定位及循环移位机制提高嵌入位置的随机性,避免秘密信息相互覆盖,提升信息隐藏性能。     

Reversible data hiding based on prediction-error histogram shifting and EMD mechanism

This paper proposes a reversible data hiding scheme for gray-level images. The scheme exploits the similarity among adjacent pixels and uses the side-match predictors to obtain prediction-error histogram. Then secret bits are embedded by using histogram shifting method. To achieve high capacity, nonary Exploiting Modification Direction (EMD) algorithm and multi-layer embedding mechanism are used when embedding the secret bits. Additionally, we improve the method of preventing overflow and underflow problems which enhances the compression ability of location map. In the extraction process, we use the same predictors to generate the error histogram, then we can extract the secret bits and recover the original cover image. Experimental results show that our algorithm can achieve better performance compared with the previous related algorithms.     

基于两通道深度卷积神经网络的图像隐藏方法

现有的基于深度卷积神经网络(DCNN)实现的图像信息隐藏方法存在图像视觉质量差和隐藏容量低的问题。针对此类问题,该文提出一种基于两通道深度卷积神经网络的图像隐藏方法。首先,与以往的隐藏框架不同,该文提出的隐藏方法中包含1个隐藏网络和2个结构相同的提取网络,实现了在1幅载体图像上同时对2幅全尺寸秘密图像进行有效的隐藏和提取;其次,为了提高图像的视觉质量,在隐藏网络和提取网络中加入了改进的金字塔池化模块和预处理模块。在多个数据集上的测试结果表明,所提方法较现有的图像信息隐藏方法在视觉质量上有显著提升,载体图像PSNR和SSIM分别提高了3.75 dB和3.61%,实现的相对容量为2,同时具有良好的泛化能力。