An overview of visual cryptography techniques

Abstract

Visual cryptography is an encryption technique that decomposes secret images into multiple shares. These shares are digitally or physically overlapped to recover the original image, negating the need for complex mathematical operations or additional hardware. There have been many variations of visual cryptography proposed over the years, each addressing different problems or to fulfill different security requirements. Existing review papers on the area only cover certain types of visual cryptography or lack comparisons between the various schemes. To address this gap, this paper provides broad overview of the area to aid new researchers in identifying research problems or to select suitable visual cryptography methods for their desired applications. For more veteran researchers in the area, our paper provides the most up-to-date coverage of the state-of-the-art. We first provide an introduction to the various categories of visual cryptography techniques, including a discussion on recently proposed schemes. These schemes are then compared in terms of their features, performance metrics, advantages and disadvantages. Compared to prior work, we extend the number of comparison metrics to include signal-to-noise ratio and the type of shares. Over 40 visual cryptography schemes that have been proposed in the past two decades were analyzed and compared. Our findings indicate that existing problems such as pixel expansion, poor quality of recovered image quality, computational and memory complexities still exist, and a optimizing the trade-off between these requirements still requires further investigation. We conclude the paper with a discussion of these open problems and future research directions.

An Efficient Multi-Secret Image Sharing System Based on Chinese Remainder Theorem and Its FPGA Realization

“…The system was tested on (2,2), (3,3), and (4,4) thresholds, where the images {b, e}, {a, c, e}, {a, b, c, d} are used for each threshold, respectively. In the case of (4,4)-threshold for 512 × 512 images, the used four secret images are shown in Fig.…”

“…A threshold defines how many shares out of the n shares are needed to recover the secret. (k, n)-SIS requires k or more shares to recover the secret, while (n, n)-SIS requires all the shares to recover the secret [3].…”

Enhanced Visual Cryptography Network (Evcn) for Secured Data Transmission Combining Des and Elliptic Curve Cryptography

“… Visual cryptographic schemes still needs to address the problem of efficiently encrypting multiple secrets and pixel expansion [Ibrahim et al (2021)].  Visual cryptography based schemes needs further improvements in optimization of the designing schemes ,algorithms and further applying them in real-time applications [Goon et al (2022)].…”

Protection and Security Risk Management, a Proposal of Cryptologic Measures and Solutions for Vesimpex Company

“…Simulation models that illustrate the basic principles of OTP algorithms have been realised in CrypTool software [13], with an emphasis on the case of repeated use of a one-time key. We also include an example of processing an electronic financial transaction using OTP, where confidential information is shared using the visual cryptography technique [14] [15].…”