基于图像块分类的篡改定位和恢复水印算法

针对现有方法所提取的特征值不能灵活适应图像 的纹理变化导致被篡改图像恢复质量不高的问题, 提出一种根据图像块纹理特征进行块类型划分的篡改定位和恢复水印算法。首先把宿主图像 分3×3大小的 子块,再利用方差和Canny边缘检测算子将图像子块划分为简单块、复杂块和边缘块;然后 根据图像子块 类型,自适应地生成水印信息;最后采用Torus自同构映射方式找到水印嵌入位置,并且对 篡改区域进行恢 复时根据图像子块类型自适应的恢复。当图像遭到篡改时,采用本文算法恢复图像的平均峰 值信噪比(PSNR)较现有方 法提5.60%左右。实验表明,本文算法能够对图像纹理复杂区 域生成更精确的 恢复信息,有效提高了图像篡 改区域的恢复质量,同时降低含水印图像失真。算法适用于医学、军事和卫星等领域。     

一种简单实用的多密钥共享方案

为了解决单密钥共享方案在管理多个密钥时出现的效率和成本等问题,论文提出了一种简单实用的多密钥共享方案。该方案的基本思想是利用拉格朗日插值多项式同时恢复一个多项式的系数来实现多密钥的共享。通过对多密钥共享方案实现原理的分析,论文还推导了计算多个密钥的恢复公式,并通过具体例子验证了多密钥共享方案的正确性和可行性。     

基于DNA编码运算和混沌系统的图像分块加密算法

针对当前基于DNA编码运算的图像加密算法复杂度和安全性较低的问题,提出一种图像分块加密算法.利用Lo-gistic混沌映射产生与明文图像大小相同的随机矩阵,然后对明文图像和随机矩阵进行分块,每个子块的DNA编解码方式以及相互之间的DNA运算均由Chen超混沌系统产生的混沌序列动态决定,同时引入密文反馈机制,使算法得到更好的扩散效果.此外,算法的密钥由明文图像生成,实现了一次一密的加密.仿真实验结果和分析表明加密效果良好,算法利用了DNA可选择编码方式和运算操作丰富的特点,具有较高的复杂度和安全性,密钥空间大,能抵抗多种攻击.     

基于图像分块的Harris-SIFT特征匹配算法

应用Harris角点和SIFT图像局部特征定量化数据描述的互补优势,提出了图像分块Harris-SIFT特征匹配方法。将原图像分割成子图像块,根据子块的可变阈值检测多尺度Harris角点,并对其进行迭代精化,使其收敛到真值,然后生成定量化的特征矢量。匹配应用双向最近邻算法并用RANSAC去除误匹配。通过仿真验证,这种方法增强了角点提取的鲁棒性,提高了匹配速度和精度。     

基于低秩矩阵恢复的SAR图像相干斑抑制方法

针对合成孔径雷达(SAR)图像相干斑噪声的特点,提出了一种基于低秩矩阵恢复的SAR图像相干斑抑制算法。该算法首先对SAR图像进行对数变换,将SAR图像相干斑乘性噪声转化为加性噪声;然后对变换后图像等步长遍历提取图像子参考块,利用局部块匹配技术寻找子参考块的相似块组建相似子集,合并数据集中所有相似子集,构建近似低秩的矩阵;再通过低秩矩阵恢复算法将矩阵分解为低秩矩阵部分和稀疏矩阵部分;最后将低秩矩阵部分逆变换回图像块,基于图像块灰度值对图像的每个像素进行加权重构,生成相干斑抑制后的SAR图像。实验表明,文中所提出的算法能够有效抑制SAR图像中的相干斑噪声,同时很好地保留了边缘细节特征。     

DVB通用加扰算法研究与硬件实现

介绍DVB数字视频广播条件接收系统中的CSA通用加扰算法,分析了CSA算法结构及块加密和流加密的流程,提出了该算法的硬件实现方案,并简化了块加密中的子密钥生成,最后在FPGA上实现该方案,通过仿真和实际码流加扰测试,验证了该硬件实现方案的正确性.     

基于多尺度自相似性和非局部均值的单幅图像超分辨率方法

提出了一种基于多尺度局部自相似性和非局部均值的单幅图像超分辨率算法,该算法不依赖于外界图像,仅仅在原始图像的局部子窗口中搜索目标图像块的相似子块,利用非局部均值算法对相似子块进行加权求和来估计待复原图像,然后在复原图像上叠加最相似子块的高频细节图像,获得高分辨率图像。实验结果表明,本文算法不仅能很好地重构图像的高频细节,还能很好地恢复图像的纹理特征。     

水印容量可变数字图像可恢复水印算法研究

考虑到水印嵌入容量及安全性,探究出水印容量可变的一种数字图像恢复水印算法,利用这种算法对图像特征加以提取,使容量恢复水印得以生成。图像块恢复水印以图像块中随机嵌入密钥低有效位为基础,通过对比恢复水印重构特征与图像块特征,对图像块本身真实性予以判定。变容量恢复水印应该用比特数存储图像块信息,嵌入期间还用于恢复与篡改检测,既有利于减低水印嵌入容量,又有利于算法抵抗恒均值攻击功能的提升,结果表明,数字图像恢复水印算法能够得到质量较高的恢复图像与含水印图像,具有较高拼贴攻击抵抗力。     

面向条带SAR的多孔径图像偏移自聚焦算法

本文提出了一种能够用于机载条带式合成孔径雷达（SAR）运动误差估计的多孔径图像偏移自聚焦算法。首先,将条带SAR数据分割为有重叠的估计子块,各个子块又分为具有重叠场景的多个子孔径,并通过后向投影算法在距离多普勒域构建子孔径图像;然后,对各个子孔径图像进行互相关处理,在分析影响互相关函数的因素的基础上,给出了求解各子图像之间的重叠场景相对偏移的方法;最后,给出了子块内的误差估计方法与子块间的误差拼接方法。对实际数据的处理结果表明,所提算法能够精确且鲁棒地估计机载条带SAR的运动误差。     

基于Logistic混沌映射的DCT域脆弱数字水印算法

本文提出了一种新的混沌脆弱数字水印算法.利用混沌系统对初值的极端敏感性和块不相关水印技术,将图像DCT次高频系数和水印密钥合成为logistic混沌映射初值从而生成水印,再将水印嵌入到图像DCT的高频系数中得到水印图像.利用图像DCT系数之间的关系,实现了水印的盲检测.实验结果表明,该算法可以精确检测到对水印图像的一个像数点的改变,并具有良好的定位篡改能力.     

基于随机网格的视觉多秘密共享方案

为了提高视觉秘密共享(VSS)的恢复效果,该文提出一种基于随机网格的视觉多秘密共享方案.通过使用一种基于圆柱面的随机网格阈值多秘密图像共享方案,使得用户一次可以共享多个秘密图像;部分份额图像受到篡改仍然可以恢复秘密图像,具有较好的鲁棒性;同时份额的数量和最后恢复图像的视觉质量成正相关.仿真结果表明所提出的多秘密视觉共享...     

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.     

A Visual Secret Sharing Scheme for Progressively Restoring Secrets

Visual secret sharing has received more and more attention over the past years due to the fact that neither complex computation nor cryptographic knowledge is required to decrypt the secret image directly according to the characteristics of the human vision system. Considering the issue of sharing the secret image at multiple image resolutions with the meaningful shadows, in this paper, we present a friendly progressive visual secret sharing scheme without expanding the image size in the shadows and the reconstructed secret image based on applying a 22-sized block-wise operation to generate the shadows block by block. The proposed method can achieve these benefits: 1) the generated shadows are meaningful, and their sizes are not expanded, and 2) the secret image can be recovered at different resolutions by stacking different quantities of shadows together. The experimental results also show that the proposed method is superior to other compared schemes.     

一种改进的图像秘密共享方案

秘密共享是一种将秘密信息的片段共享给多个合法参与者的保密技术,可以有效预防对秘密信息的破译、截取、恶意破坏。图像秘密共享是近年来一个具有实用价值研究分支,目前已经衍生出很多种共享算法。L.Bai的投影矩阵方案是一种面向图像秘密共享的方案,可对该方案进行改进,对残差矩阵进行保护,可以避免残差矩阵因通信丢失而导致图像无法重构的问题,提高了该方案的安全性和可用性。     

An image encryption scheme based on irregularly decimated chaotic maps

An image encryption scheme provides means for securely transmitting images over public channels. In this work, we propose a robust shuffling–masking image encryption scheme based on chaotic maps. The shuffling phase permutes square blocks of bytes using a 3-dimensional chaotic cat map coupled with a zigzag scanning procedure. The masking phase then scrambles b-byte blocks of the shuffled image with combined outputs of three 1-dimensional chaotic skew tent maps, in such a way that the masking of every block is influenced by all previously masked blocks. Empirical results show that while the suggested scheme has good running speed, it generates ciphered images that exhibit (i) random-like behavior, (ii) almost flat histograms, (iii) almost no adjacent pixel correlation, (iv) information entropy close to the ideal theoretical value. Furthermore, this scheme has a large key space, strong sensitivity to the secret key, and is robust against differential attacks. On the basis of these results, this scheme can be regarded as secure and reliable scheme for use in secure communication applications.     

一种共享份分块构造的异或区域递增式视觉密码方案

该文依据授权子集的个数将共享份划分若干块,按照共享份分块构造的设计思路,结合(n, n)异或单秘密视觉密码的加密矩阵,构造了异或区域递增式视觉密码的秘密分享与恢复流程。与现有方案相比,该方案可以实现解密区域图像的完全恢复,且明显减小了共享份的大小。     

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.     

基于(t, n)门限和划分树的可再生Hash链构造方案

针对可再生hash链解决了其资源受限的缺点,但现有构造方案在安全性和复杂性等方面存在缺陷这一问题,提出“重复”、“划分”和“划分树”的定义,以及基于(t, n)-Mignotte’s门限的中国剩余定理秘密共享方案,设计了一种新的可再生hash链构造方法。从明文空间、双重认证和可证明安全3方面论证了新构造方案能确保新链中种子值的安全再生并有效抵制中间人攻击。同时仿真实验表明新构造方案在通信、计算和存储开销等方面相比于传统方案具有相同甚至更佳的性能。     

一种基于身份加密的可验证秘密共享方案

 提出了一种使用IBE公钥算法实现的可验证秘密共享方案.该方案中秘密分发者将IBE私钥作为共享秘密在接入结构中分发,任何参与者可以通过公开的验证信息验证影子秘密的正确性.随后在随机预言模型中证明了所提方案的语义安全性.理论分析和仿真实验表明,方案可以有效检测来自内外部攻击者的欺骗攻击,并具有较低的时间复杂度和通信开销.     

User-friendly secret image sharing scheme with verification ability based on block truncation coding and error diffusion

Conventional secret image sharing schemes, which are constructed based on Shamir’s method, often suffer from random-liked shares, lossy reconstruction and high computation complexity. In addition, their generated shares are generally in original image format which may lead to more storage and suspicion from invaders. In this paper, we propose a user-friendly secret image sharing scheme based on block truncation coding (BTC) and error diffusion, where meaningful shares can be directly generated without any extra process. The meaningful shares by the proposed scheme are in BTC-compressed format which can reduce the capacity of transfer and storage. In the reconstructing phase, the secret image can be losslessly reconstructed by performing XOR operations on bit planes of sufficient BTC-compressed shares. Further, the proposed scheme provides extra verification ability to identify cheaters and check false shares. Theoretical analysis and simulation results demonstrate the feasibility of the proposed scheme.