Improved schemes for visual secret sharing based on random grids

被引:0
作者
Hao Hu
Gang Shen
Yuling Liu
Zhengxin Fu
Bin Yu
机构
[1] Zhengzhou Information Science and Technology Institute,Trusted Computing and Information Assurance Laboratory, Institute of Software
[2] Chinese Academy of Sciences,undefined
来源
Multimedia Tools and Applications | 2019年 / 78卷
关键词
Secret image sharing; Visual secret sharing; Visual cryptography; Random grid; General access structure; Meaningful share;
D O I
暂无
中图分类号
学科分类号
摘要
Random grid (RG) is an alternative approach to realize a visual secret sharing (VSS) scheme. RG-based VSS has merits such as no pixel expansion and no tailor-made matrix requirement. Recently, many investigations on RG-based VSS are made. However, they need further improvements. In this paper, we obtain some improvements on RG-based VSS. Actually, two improved schemes are proposed, namely RG-based VSS for general access structure (GAS) with improved contrast and extended RG-based VSS with improved access structure. The first scheme can achieve better contrast than previous schemes. The second scheme reduces the chance of suspicion on secret image encryption by generating meaningful shares instead of noise-like shares in the first scheme, and improves the access structure from (k, k) to GAS while maintaining the property that the contrast of the recovered image is traded with that of share images by setting a certain parameter from small to large. Finally, theoretical analyses and experimental results are provided to demonstrate the effectiveness and advantages of the proposed schemes.
引用
收藏
页码:12055 / 12082
页数:27
相关论文
共 72 条
  • [1] Ateniese G(1996)Visual cryptography for general access structures Inf Comput 129 86-106
  • [2] Blundo C(1999)On the contrast in visual cryptography J Cryptol 12 261-289
  • [3] De Santis A(2017)Random-grid based progressive visual secret sharing scheme with adaptive priority Digit Sign Process 68 69-80
  • [4] Stinson D(2017)Fully incrementing visual cryptography from a succinct non-monotonic structure IEEE Trans Inform Foren Sec 12 1082-1091
  • [5] Blundo C(2009)Visual secret sharing by random grids revisited Pattern Recogn 42 2203-2217
  • [6] De Santis A(2011)Threshold visual secret sharing by random grids J Syst Softw 84 1197-1208
  • [7] Stinson D(2011)User-friendly random-grid-based visual secret sharing IEEE Trans Circ Syst Video Technol 21 1693-1703
  • [8] Chao H(2005)Probabilistic Visual Cryptography Schemes The Computer Journal 49 97-107
  • [9] Fan T(2014)On the relation of random grid and deterministic visual cryptography IEEE Trans Inform Foren Sec 9 653-665
  • [10] Chen Y(2014)Optimal pixel expansion of deterministic visual cryptography scheme Multimed Tools Appl 73 1177-1193