Abstract
AbstractVisual cryptography (VC) is a powerful technique with high security and requires no PC or device to reconstruct the secret information. Progressive visual cryptography (PVC) is a variation of the VC scheme in which the quality of the reconstructed image is improved by increasing the number of shared images. The previous study focused directly on maximizing the value of the quality in the completely reconstructed image; thus, there is a difference in the quality of the shared images. In this paper, we focus on the aforementioned issue and propose a new approach based on inductive reasoning. Our basic idea is to maximize the quality of the reconstructed images each time the number of shared images increases. We call this method the bottom-up approach. Moreover, hitherto, PVC has been evaluated based on the value of relative difference or by sight. Such evaluation methods are only subjective or difficult to execute without the knowledge of basis matrices. In addition, PVC users cannot easily confirm the effectiveness of their shared images. In this paper, we propose a new information-theoretic evaluation method for PVC, which only uses shared images, to solve the aforementioned problems. Our proposed method can objectively and quantitatively evaluate PVC based on the numerical value, and PVC users can easily confirm the effectiveness of their shared images.
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Signal Processing
Reference18 articles.
1. A. Shamir, How to share a secret. Commun ACM 22(11), 612–613 (1979)
2. M. Naor, A. Shamir, in: Santis AD (ed) Advances in Cryptology - EUROCRYPT ’94, Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy, May 9-12, 1994, Proceedings, Lecture Notes in Computer Science. Visual cryptography, vol 950 (Springer, Berlin, Heidelberg, 1994), pp. 1–12
3. C. Blundo, P. D’Arco, A.D. Santis, D.R. Stinson, Contrast optimal threshold visual cryptography schemes. SIAM J. Discret. Math. 16(2), 224–261 (2003)
4. T. Hofmeister, M. Krause, H.U. Simon, Contrast-optimal k out of n secret sharing schemes in visual cryptography. Theor. Comput. Sci. 240(2), 471–485 (2000)
5. M. Iwamoto, A weak security notion for visual secret sharing schemes. IEEE Trans. Inf. Forensics Secur. 7(2), 372–382 (2012)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. SafePass : Reinventing Digital Access with Visual Cryptography, Steganography, and Multi-Factor Authentication;International Journal of Scientific Research in Computer Science, Engineering and Information Technology;2024-03-14