In order to optimize the recovery quality of Region Incrementing Visual Cryptography Scheme (RIVCS), by adding identities for shares and combing the random numbers, an XOR-based single-secret sharing Visual Cryptography Scheme (XVCS) with individual participant holding multi-share is designed. On basis of this, the secret sharing and recovering algorithms for XOR-based RIVCS (XRIVCS) are designed. For the decrypt regions, XVCS is used to share, and for the not decrypt regions, the random numbers are filled to keep the secret. The experimental results show that, the proposed scheme can realize the perfect recovery of decrypt regions, and decrease the storage and transmission cost effectively.
FU Zhengxin, SHEN Gang, YU Bin, et al. Threshold multi- secret visual cryptography scheme with perfect recovery[J]. Journal of Software, 2015, 26(7): 1757-1771. doi: 10.13328/ j.cnki.jos.004611.
[3]
BIN Y and GANG S. Multi-secret visual cryptography with deterministic contrast[J]. Multimedia Tools and Applications, 2014, 72(2): 1867-1886. doi: 10.1007/s11042-013-1479-8.
[4]
SHYU S J and JIANG H W. General constructions for threshold multiple-secret visual cryptography schemes[J]. IEEE Transactions on Information Forensics and Security, 2013, 8(5): 733-743. doi: 10.1109/TIFS.2013.2250432.
[5]
WANG R Z. Region incrementing visual cryptography[J]. IEEE Signal Processing Letters, 2009, 16(8): 659-662. doi: 10.1109/LSP.2009.2021334.
[6]
SHYU S J and JIANG H W. Efficient construction for region incrementing visual cryptography[J]. IEEE Transactions on Circuits and Systems for Video Technology, 2012, 22(5): 769-777. doi: 10.1109/TCSVT.2011.2180769.
[7]
YANG C N, SHIH H W, CHU Y Y, et al. New region incrementing visual cryptography scheme[C]. Proceedings of the International Conference on Image Processing, Computer Vision, and Pattern Recognition in Conjunction with WORLDCOMP, Las Vegas, USA, 2011: 323-329.
[8]
YANG C N, SHIH H W, WU C C, et al. k out of n region incrementing scheme in visual cryptography[J]. IEEE Transactions on Circuits and Systems for Video Technology, 2012, 22(5): 799-810. doi: 10.1109/TCSVT.2011.2180952.
[9]
YANG C N, LIN Y C, and WU C C. Region-in-region incrementing visual cryptography scheme[C]. Proceedings of 12th International Workshop on Digital-Forensics and Watermarking, Auckland, New Zealand, 2013: 449-463. doi: 10.1007/978-3-642-40099-5_37.
LI Jiliang, LI Shundong, and Wang Daoshun. Construction of region incrementing visual cryptography[OL]. http:// wenku.it168.com/huiyi/2349, 2014.
[11]
NAOR M and SHAMIR A. Visual cryptography[C]. Proceedings of the Advances in Cryptology-Eurocrypt’94, Berlin, 1995: 1-12. doi: 10.1007/BFb0053419.
[12]
SHYU S. Image encryption by multiple random grids[J]. Pattern Recognition, 2009, 42(7): 1582-1596. doi:10.1016/j. patcog.2008.08.023.
[13]
WANG R Z, LAN Y C, LEE Y K, et al. Incrementing visual cryptography using random grids[J]. Optics Communications, 2010, 283(21): 4242-4249. doi: 10.1016/j.optcom.2010.06.042.
[14]
ZHONG G S and WANG J J. Region incrementing visual secret sharing scheme based on random grids [C]. Proceedings of IEEE International Symposium on Circuits and Systems, Los Alamitos, 2013: 2351-2354. doi: 10.1109/ISCAS.2013. 6572350.
[15]
TUYLS P, HOLLMANN H D L, LINT J H V, et al. XOR- based visual cryptography schemes[J]. Designs, Codes and Cryptography, 2005, 37(1): 169-186. doi: 10.1007/s10623-004- 3816-4.
[16]
OU D, SUN W, and WU X T. Non-expansible XOR-based visual cryptography scheme with meaningful shares[J]. Signal Processing, 2015, 108: 604-621. doi: 10.1016/j.sigpro.2014.10. 011.
[17]
HAO H, GANG S, FU Z X, et al. General construction for XOR-based visual cryptography and its extended capability [J]. Multimedia Tools and Applications, 2016, 1-29. doi: 10.1007/s11042-016-3250-4.
[18]
YANG C N and WANG D S. Property analysis of XOR based visual cryptography[J]. IEEE Transactions on Circuits and Systems for Video Technology, 2014, 24(2): 189-197. doi: 10.1109/TCSVT.2013.2276708.
[19]
ATENIESE G, BLUNDO C, SANTIS A D, et al. Visual cryptography for general access structures[J]. Information and Computation, 1996, 129(2): 86-106. doi: 10.1006/inco. 1996.0076.