| 高效免置乱的图像秘密共享方案 |
| |
| 引用本文： | 周清雷,郭锐.高效免置乱的图像秘密共享方案[J].计算机工程,2010,36(9):126-128. |
| |
| 作者姓名： | 周清雷 郭锐 |
| |
| 作者单位： | 郑州大学信息工程学院,郑州,450001 |
| |
| 摘 要： | 针对图像秘密共享前需要像素置乱的问题，基于(t, n)门限多重秘密共享思想，提出一种免置乱的图像秘密共享方案，以第n+1人的秘密份额作为因子参与秘密分割与重构，加大相邻像素之间的差距。该方案无需进行额外的密钥传输，运算简单高效、易于扩展，生成的影子图像也仅为原图像的1/t，有效压缩了尺寸。实验结果证明了该方案的可行性。
|
| 关 键 词： | 秘密共享 免置乱 影子图像 |
| 修稿时间： | |
High-efficiency and Non-permutated Image Secret Sharing Scheme |
| |
| ZHOU Qing-lei,GUO Rui.High-efficiency and Non-permutated Image Secret Sharing Scheme[J].Computer Engineering,2010,36(9):126-128. |
| |
| Authors: | ZHOU Qing-lei GUO Rui |
| |
| Affiliation: | (Information Engineering School, Zhenzhou University, Zhenzhou 450001) |
| |
| Abstract: | Aiming at the problem that the image should be permutated before it is shared,based on（t,n） threshold multi-secret sharing theory,a non-permutated image secret sharing scheme is proposed.It makes use of the n＋1 participator’s secret shadow as a gene to participate in sharing and recovering.The gap between the adjacent pixels is increased effectively.This scheme doesn’t need added secret key transmission.It is easy to be extended and the size of each shadow image is reduced to 1/t of the secret image.Experimental result proves this scheme is feasible. |
| |
| Keywords: | secret sharing non-permutated shadow image |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
|
