基于视觉密码的DWT-SVD水印技术

本文提出基于视觉密码的数字水印技术,利用像素不扩展的(2,2)视觉密码方案,将秘密图像拆分成两个与秘密图像等大小的分享份图像,把两个分享份图像利用DWT-SVD水印算法嵌入到载体图像中,最后利用数字水印的提取算法,将两个分享份图像提取出来,进行叠加恢复秘密图像.基于视觉密码提取出来的分享份不会泄露秘密信息的任何内容,从而保证了秘密信息的安全性.实验结果表明,此方案可以抵抗常见的攻击行为.     

小波域分存和软判决恢复的隐藏技术

研究了一种把小波变换和可视密码技术相结合的信息隐藏方案,实现对灰度图像的信息隐藏。该方案把经过Arnold变换处理后的秘密信息,按照k阶线性方程求解理论产生n幅分享图片,再把n幅分享图片应用离散小波变换信息隐藏理论,分存到n幅公开图片中。提取秘密图片时,必须要大于k幅公开图片才能获得秘密图片。实验结果表明,该方案具有很强的鲁棒性,而且秘密信息不容易丢失。     

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

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

（k，n）异或视觉密码的一般性研究

通过研究(k, n)异或视觉密码像素扩展度最优的必要条件,该文提出一种由基矩阵生成(k, n)异或视觉密码的方法,并从理论上证明了该方法适合2相似文献   

基于压缩算法的存取式多秘密视觉密码

依据多幅秘密图像的像素组合与基矩阵之间的映射关系,该文分析了目前存取式多秘密视觉密码存在的冗余基矩阵问题,提出了一种减小基矩阵规模的压缩算法.该算法以一列像素为处理单元,且满足秘密图像的整体对比性.在此基础上,设计了新的存取式多秘密视觉密码的秘密分享与恢复流程.与现有的方案相比,该方案能够有效减小共享份的尺寸,且对于简单图像的压缩效果更加明显.     

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

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

每次处理2个像素像素扩展度为1的(2,2)视觉密码方案

为了解决传统视觉密码像素扩展度高的问题及分存图像占用存储空间过大问题,提出每次处理2个像素像素扩展度为1的(2,2)视觉密码方案.方案中,秘密图像为黑白二值图像,每次处理2个像素,得到的2个分享份额图像为黑白噪声图像,叠加分享份额恢复秘密图像.该方案解密过程简单,恢复秘密图像无变形,像素扩展度为1.     

视觉密码方案概述

视觉密码(VC)是一种用于分享秘密图像的加密方案,与传统的密码技术相比具有简单性、安全性、隐蔽性等优点.其加密是将图像编码为分享,将分享打印在透明胶片上或以数字形式存储;其解密过程是对分享进行叠加,然后通过人类的视觉能力来实现.本文介绍了视觉密码的基本概念和各种不同的视觉密码方案,以及每种方案中使用的技术.此外,对视觉...     

解密区域完美恢复的区域递增式视觉密码方案构造

为了优化区域递增式视觉密码的恢复效果,该文通过为共享份添加身份标识,并结合随机数,构造了单个参与者持有多个共享份的异或单秘密视觉密码方案,在此基础上,设计了异或区域递增式视觉密码的秘密分享与恢复算法。对于解密区域利用异或单秘密方案进行分享,对于未解密区域,通过填充随机数实现秘密遮盖。实验结果表明,该方案可以实现解密区域图像的完美恢复,且有效减小了共享份的存储与传输开销。     

无损分享视觉密码研究

根据秘密图像分享过程中的信息损失,给出了无损分享视觉密码的概念,从而将视觉密码2个参数的优化问题简化为一个,并提出了矩阵转化算法和整数规划模型,实现了一种像素扩展度的优化算法。实验结果表明,该算法能够实现无损分享下的像素扩展度最优化,且适用于通用存取结构。     

Halftone visual cryptography.

Visual cryptography encodes a secret binary image (SI) into n shares of random binary patterns. If the shares are xeroxed onto transparencies, the secret image can be visually decoded by superimposing a qualified subset of transparencies, but no secret information can be obtained from the superposition of a forbidden subset. The binary patterns of the n shares, however, have no visual meaning and hinder the objectives of visual cryptography. Extended visual cryptography [1] was proposed recently to construct meaningful binary images as shares using hypergraph colourings, but the visual quality is poor. In this paper, a novel technique named halftone visual cryptography is proposed to achieve visual cryptography via halftoning. Based on the blue-noise dithering principles, the proposed method utilizes the void and cluster algorithm [2] to encode a secret binary image into n halftone shares (images) carrying significant visual information. The simulation shows that the visual quality of the obtained halftone shares are observably better than that attained by any available visual cryptography method known to date.     

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.     

一种新的多秘密分享视觉密码

 本文给出了一种新的多秘密分享视觉密码的定义,能够支持多授权子集和共享份操作.基于区域标记和单秘密视觉密码的基础矩阵,设计了多秘密分享与恢复的流程,给出一种实现方案.最后对方案的有效性进行了理论证明和实验验证.     

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

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

A blind watermarking algorithm based on fractional Fourier transform and visual cryptography

This paper presents a robust copyright protection scheme based on fractional Fourier transform (FrFT) and visual cryptography (VC). Unlike the traditional schemes, in our scheme, the original image is not modified by embedding the watermark into the original image. We use the visual secret sharing scheme to construct two shares, namely, master share and ownership share. Features of the original image are extracted using SVD, and are used to generate the master share. Ownership share is generated with the help of secret image (watermark) and the master share, using VC technique. The two shares separately give no information about the secret image, but for ownership identification, the secret image can be revealed by stacking the master share and the ownership share. In order to achieve the robustness and security, the properties of VC, FrFT and SVD are used in our scheme. The experimental results show that the proposed scheme is strong enough to resist various signal processing operations.     

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.     

基于环形共享份的多秘密视觉密码

通过对秘密图像和环形共享份进行纵向区域分割,该文提出了相关矩阵组,并在此基础上设计了一种新的多秘密视觉密码方案。与现有的多秘密方案相比,该方案不仅实现了加密任意数量的秘密图像,而且在像素扩展度和相对差等方面有明显改善。