A new (t, n) threshold image hiding scheme for sharing a secret color image

被引：0
作者：
Chang, CC [1 ]
Lin, IC [1 ]
机构：
[1] Natl Chung Cheng Univ, Dept Comp Sci & Informat Engn, Chiayi 62107, Taiwan
来源：
2003 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOL 1 AND 2, PROCEEDINGS | 2003年
关键词：
image hiding; secret sharing; steganography; (t; n); threshold;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The objective of this research is to develop a method to hide a secret color image inside a set of meaningful color images. It allows a group of n members to share the secret image such that any t or more members can cooperatively construct the secret color image, but (t - 1) or less members cannot. In addition, this technique has some outstanding properties. The embedded image can be 512 colors, and the size can be as big as that of the cover images. On the other hand, prior schemes have a secret weakness that some members may cheat other members to obtain their shares. Our new scheme can withstand the cheating attack. Therefore, the new technique is superior to previous works. Finally, our experimental results will also reveal that the distortion between our stego-image and cover image is inconspicuous.
引用
收藏
页码：196 / 202
页数：7
相关论文
共 25 条
[11]  
DROSTLE S, 1996, EUROCRYPT 96, P401
[12]  
FRANZ E, 1996, LECT NOTES COMPUTER, V1174, P7
[13]   Hiding a picture in two pictures [J].
Hwang, RJ ;
Chang, CC .
OPTICAL ENGINEERING, 2001, 40 (03) :342-351
[14]  
KATZENBEISSER S, 2000, INFORMATION HIDDING
[15]  
Kuo C. J., 1993, Journal of Electronic Imaging, V2, P345, DOI 10.1117/12.148572
[16]   ON SHARING SECRETS AND REED-SOLOMON CODES [J].
MCELIECE, RJ ;
SARWATE, DV .
COMMUNICATIONS OF THE ACM, 1981, 24 (09) :583-584
[17]  
NAOR N, 1994, EUROCRYPT 94, P1
[18]  
Pitas I, 1996, INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, PROCEEDINGS - VOL III, P215, DOI 10.1109/ICIP.1996.560422
[19]   HOW TO SHARE A SECRET [J].
SHAMIR, A .
COMMUNICATIONS OF THE ACM, 1979, 22 (11) :612-613
[20]  
SIMMONS GJ, 1983, CRYPTO, P51
123