원문정보
초록
영어
In the existing random grids based (n, n) visual secret sharing (VSS) schemes, decryption is done with the help of human visual system by stacking the cipher grids. The stacking operation is computationally modeled as Boolean OR operation, which suffers from two drawbacks. Firstly, the contrast of the reconstructed image decreases exponentially by increasing n (≥2) and secondly, it requires perfect alignment of stacking the cipher grids. In this paper, we propose Boolean XOR operation as decryption operation for the existing random grids based (n, n) VSS schemes. The proposed operation removes both the drawbacks and does lossless secret reconstruction. We have demonstrated the improvement in the contrast of the reconstructed image by formal proofs and experimental results.
목차
1. Introduction
2. Kafri and Keren’s VSS Scheme under the Proposed Decryption Operation XOR
3. Chen and Tsao’s (n, n) VSS Scheme Under the Proposed Decryption Operation XOR
4. Shyu’s (n, n) VSS Scheme under the Proposed Decryption Operation XOR
5. Experimental Results and Discussions
5.1. Experiment 1: Kafri and Keren’s (2, 2) VSS Scheme
5.2. Experiment 2: Chen and Tsao’s (n, n) VSS Scheme
5.3. Experiment 3: Shyu’s (n, n) VSS Scheme
5.4. Computational Efficiency
6. Conclusion
References