Perfect Recovery (2,n) Color Visual Cryptography Scheme

Authors

Xianhuan Zhang, 1. Information Engineering University, Zhengzhou 450000, China;;
Zhengxin Fu, 1. Information Engineering University, Zhengzhou 450000, China;;
Ouyang Dan, 2. Institute of Electronic Technology, Beijing 100089, China;
Bin Yu, 1. Information Engineering University, Zhengzhou 450000, China;;

Abstract

Abstract: Based on XOR operation and combining the characteristic of computer display technology, a perfect recovery (2,n) color visual cryptography scheme was proposed. Sharing algorithm of color secret image was designed on the basis of constructing row vectors${{V}_{1}},{{V}_{2}},\cdots ,{{V}_{n}}$. Through computing shares by XOR operation and dealing with recovery image, the secret image was recovered. The experimental results show that the scheme on the basis of keeping the simplicity in the reconstruction phase of visual cryptography can realize the secret image perfect recovery with low pixel expansion for price. Each participant only needs to carry a share which reduces the difficulty of share management.

Recommended Citation

Zhang, Xianhuan; Fu, Zhengxin; Dan, Ouyang; and Yu, Bin (2020) "Perfect Recovery (2,n) Color Visual Cryptography Scheme," Journal of System Simulation: Vol. 28: Iss. 6, Article 27.
Available at: https://dc-china-simulation.researchcommons.org/journal/vol28/iss6/27

First Page

1439

Revised Date

2015-07-28

DOI Link

https://doi.org/

Last Page

1444

CLC

TP309.7

Recommended Citation

Zhang Xianhuan, Fu Zhengxin, Ouyang Dan, Yu Bin. Perfect Recovery (2,n) Color Visual Cryptography Scheme[J]. Journal of System Simulation, 2016, 28(6): 1439-1444.