视图的秘密分享及其代数编码方法

摘要

视图的秘密分享是图像信息安全领域独具吸引力的研究问题.寻求秘密视图完全的( Perfect)和理想的( Ideal)门限秘密分享方案(也称图像门限分享的完备方案),则是其中富有挑战性的未决课题.文中引入灰度值域GF(2m)上像素矩阵秘密分享的新观点和相应的代数几何编码方法,实现了数字图像(t,n)门限秘密分享的一种完备方案.该方案能够将一幅或多幅秘密图像编码为n幅各具随机视觉内容,同时又共具(t,n)门限结构的影子图像(或称份额图像).证明了这种秘密分享方案的(t,n)门限结构不仅是完全的而且也是理想的,并给出了提高像素灰度值域GF(2m)上图像秘密分享算法效率的“m位像素值的分拆与并行”方法.分析表明,该图像秘密分享方法可以应用于高安全等级的秘密图像的网络多路径传输、保密图像信息的分散式存储控制、高维图形码(Bar-code in k dimension)和弹出码(Popcode)等新一代信息载体技术的识读控制等各方面.%Image sharing is an attractive research subject in computer image information security field. Seeking for Perfect and Ideal image threshold secret sharing scheme (I.e. The complete image sharing scheme) is one of the unresolved challenging problems. By introducing into the methods of pixel matrix secret sharing over pixel value field GF(2m) and algebraic-geometry coding, a complete scheme of image sharing with a (I, n) threshold structure was achieved in this paper. The scheme could encode secret images into n shadow images in such a way that all the shadow images were in a Perfect and Ideal (t, re) threshold structure, while each shadow image had its own visual content assigned at random. This approach to image sharing was able to be applied to the new information carrier technology, e. G. Network multipathed transmission of secret image in high security level, distributed storage control of secret image, bar-code in k dimension and Popcode. This paper also presented a method to cut down a great deal of computational time for image sharing based on a pixel field GF(2m), called "partition and paralleling of m-bit pixel".