Visual Secret Sharing Scheme Research Articles

Dual-band complex-amplitude metasurface empowered high security cryptography with ultra-massive encodable patterns

Abstract The significance of a cryptograph method lies in its ability to provide high fidelity, high security, and large capacity. The emergence of metasurface-empowered cryptography offers a promising alternative due to its unparalleled wavefront modulation capabilities and easy integration with traditional schemes. However, the majority of reported strategies suffer from limited capacity as a result of restricted independent information channels. In this study, we present a novel method of cryptography that utilizes a dual-band complex-amplitude meta-hologram. The method allows for the encoding of 225 different patterns by combining a modified visual secret-sharing scheme (VSS) and a one-time-pad private key. The use of complex-amplitude modulation and the modified VSS enhances the quality and fidelity of the decrypted results. Moreover, the transmission of the private key through a separate mechanism can greatly heighten the security, and different patterns can be generated simply by altering the private key. To demonstrate the feasibility of our approach, we design, fabricate, and characterize a meta-hologram prototype. The measured results are in good agreement with the numerical ones and the design objectives. Our proposed strategy offers high security, ultra-capacity, and high fidelity, making it highly promising for applications in information encryption and anti-counterfeiting.

Accelerating randomized image secret sharing with GPU: contrast enhancement and secure reconstruction using progressive and convolutional approaches

AbstractImage Secret Sharing (ISS) is a cryptographic technique used to distribute secret images among multiple users. However, current Visual Secret Sharing (VSS) schemes produce a halftone image with only 50% contrast when reconstructing the original image. To overcome this limitation, the Randomized Image Secret Sharing (RISS) scheme was introduced. RISS achieves a higher contrast of 70% when extracting the secret image but comes with a high computational cost. This research paper presents a novel approach called Graphics Processing Unit (GPU)-based Randomized Image Secret Sharing (GRISS), which utilizes data parallelism within the RISS pipeline. The proposed technique also incorporates an Autoencoder-based Single Image Super-Resolution (ASISR) to enhance the contrast of the recovered image. The performance of GRISS is evaluated against RISS, and the contrast of the ASISR images is compared to current benchmark models. The results demonstrate that GRISS outperforms state-of-the-art models in both efficiency and effectiveness.

Semantic pixel encoding visual secret sharing technique for balancing quality and security in color images

<p>Color images are widely utilized across various domains, encompassing digital media and extending to critical applications in satellite and military arenas. As the significance of these images has grown, the need to protect their content from unauthorized access and potential threats has been underscored. Visual Secret Sharing (VSS) schemes have been proposed as effective mechanisms, with images being encrypted into multiple shares that, individually, offer no discernible information about the original content. Nevertheless, issues such as pixel expansion have been noted in traditional VSS methods, which result in increased complexity and a potential compromise in image quality. Maintaining impeccable image quality is emphasized, mainly since critical application decisions are often based on the clarity and accuracy of image details. The Semantic Pixel Encoding Visual Secret Sharing (SPEVSS) technique is proposed to address these identified challenges. A robust mechanism has been formulated through the integration of semantic pixel encoding with VSS, effectively countering pixel expansion while preserving the fidelity of the original image. As a result of this research, computational complexity has been significantly reduced, decryption methodologies have been made more efficient, and a more robust security framework for colour images has been established. The performance of the proposed SPEVSS shows the reconstructed images show the PSNR of 42 dB has been recorded in images processed, underscoring the method’s capability to balance security and optimal image quality.</p>

Sharing Visual Secrets Among Multiple Groups With Enhanced Performance

An almost unexplored research topic in visual secret sharing (VSS), i.e., sharing different visual secrets among various groups, is investigated in this article. Generally, multiple groups are cooperated together to encrypt multiple visual secrets, where every group is correlated with a VSS scheme to share one secret and each participant receives only one shadow. Such a cooperative system is referred to as cooperative VSS (CVSS). In this paper, we develop a general construction for CVSS with improved computational overhead. The basis matrices for generating the shadows are easily obtained. To improve the recovered image quality, an efficient XOR-based CVSS (XCVSS) is given. Furthermore, to fulfill the requirement of implementing complex sharing policy, the XCVSS is extended to collaborate general access structure (GAS) VSS schemes together. Theoretical and experimental results and comparisons are illustrated to demonstrate the advantages of the proposed techniques.

Color Image Visual Secret Sharing with Expressive Shares using Color to Gray & Back and Cosine Transform

Color Visual Secret Sharing (VSS) is an essential form of VSS. It is so because nowadays, most people like to share visual data as a color image. There are color VSS schemes capable of dealing with halftone color images or color images with selected colors, and some dealing with natural color images, which generate low quality of recovered secret. The proposed scheme deals with a color image in the RGB domain and generates gray shares for color images using color to gray and back through compression. These shares are encrypted into an innocent-looking gray cover image using a Discrete Cosine Transform (DCT) to make meaningful shares. Reconstruct a high-quality color image through the gray shares extracted from an innocent-looking gray cover image. Thus, using lower bandwidth for transmission and less storage.

Visual Cryptography Secret Share Creation Techniques with Multiple Image Encryption and Decryption Using Elliptic Curve Cryptography

In Cryptography the covert image share creation method and multiple image encryption and decryption are used with different algorithms. In this work, Visual Cryptography (VC) is used for the outline of shares that have been generated from the novel image. Red, Green, and Blue pixel shares are one by one formed by the Visual Secret Sharing (VSS) Scheme. It proposed the ECC method for image encryption and decryption using Rubik’s cube image encryption algorithm. The encryption method is by a public key cryptography generator and the decryption method is done by the secret key arbitrarily generators of the ECC method. For humanizing, the performance analysis of Elliptic Curve Cryptography methods, such as the optimization techniques, was used for PSNR, MSE, and the Number of Pixel Changing Rate (NPCR) and (UACI). The outcome explains that the planned algorithm is improved over various other methods compared to the presented methods. The future technique is implemented with Matlab coding.

Data Concealment Using Steganography Technique

Abstract: Visual secret sharing (VSS) systems hide hidden images in shares that are also published on clarity or decrypted and saved in digital form. The shares can seem as noise-like pixels or as meaningful images, but this will raise suspicion and increase the risk of interception during transmission. As a result, VSS schemes face a transmission danger problem for both the secret and the individuals involved in the VSS system. To solve this issue, we presented a new palette-grounded steganography technique that uses a texture with LSB, as well as a natural-image-grounded VSS scheme (NVSS scheme) that shares secret images via colored carrier media to hide the secret and the actors during the transmission phase. To conceal secret messages, we convert the texture conflation process into steganography. Rather than using a being cover image to conceal dispatches, our algorithm conceals the source texture image and embeds hidden dispatches during the printing process. Prints or hand-painted filmland in digital or published form can be used for the natural shares. We also propose possible methods for concealing the secret in order to reduce the transmission threat problem for the share. The experimental results show that the proposed approach is an excellent solution to the transmission threat problem for VSS schemes. Keywords: visual secret sharing (VSS), steganography, natural-image-based VSS scheme (NVSS scheme), OR Code, Palette Based Steganography

Adversarial Embedding Using Steganography Technique

Abstract: Conventional visual secret sharing (VSS) schemes hide secret images in shares that are moreover published on clarity or are decoded and stored in a digital form. The shares can appear as noise-suchlike pixels or as meaningful images, but it'll arouse dubitation and increase interception threat during transmission of the shares. Hence, VSS schemes suffer from a transmission threat problem for the secret itself and for the actors who are involved in the VSS scheme. To address this problem, we proposed a new fashion for the palette-grounded steganography using a texture with LSB and also a natural-image-grounded VSS scheme (NVSS scheme) that shares secret images via colorful carrier media to cover the secret and the actors during the transmission phase. We contrive the texture conflation process into steganography to hide secret dispatches. In comparison to using a being cover image to hide dispatches, our algorithm hides the source texture image and embeds secret dispatches through the process of print. The natural shares can be prints or hand-painted filmland in digital form or published form. We also propose possible ways to hide the secret to reduce the transmission threat problem for the share. Experimental results indicate that the proposed approach is an excellent result for working the transmission threat problem for the VSS schemes. Keywords: visual secret sharing (VSS), steganography, natural-image-based VSS scheme (NVSS scheme), OR Code, Palette Based Steganography.

Novel Visual Secret Sharing Scheme for the QR Code with Meaningful Shares

Visual secret sharing (VSS) scheme can share the secret image with several shares. Shares are performed by the decoding operation to restore the secret image. VSS scheme is mainly used for the secure transmission of images. Quick response (QR) code is often used by people on the Internet. It can be encrypted by the VSS scheme to enhance the security of its transmission. The share is meaningless that will arouse the suspicion of the attacker. The security of the VSS scheme is decreased. This paper proposes a novel VSS scheme for the QR code with meaningful images to solve this problem. Two continue tone images are converted to halftone images. The halftone image is modified to generate the share. Every share is meaningful, not meaningless. Two shares are performed the decoding operation to restore the secret QR code. The restored QR code can be correctly decoded by the general decoder. Experimental results prove that the proposed scheme is feasible.

Self-authentication Model to Prevent Cheating Issues in Grayscale Visual Secret Sharing Schemes

Self-authentication Model to Prevent Cheating Issues in Grayscale Visual Secret Sharing Schemes

Visual secret sharing scheme with (n,n) threshold based on WeChat Mini Program codes

With the widespread use of WeChat Mini Programs, their security has attracted more and more attention. The WeChat Mini Program can be accessed by scanning a WeChat Mini Program code. We should protect the code thus to protect the Mini Program. In this paper, based on studying the function in each pattern of WeChat Mini Program codes, a visual secret sharing (VSS) scheme for WeChat Mini Program codes (MPCVSS) with (n,n)(n≥4) threshold is proposed to control and identify the users of Mini Program. MPCVSS combines the error-correcting characteristic of WeChat Mini Program codes with the theory of VSS. A secret WeChat Mini Program code is shared into n shared codes slightly modified from n cover codes. Each shared code is a valid code that can be scanned and decoded correctly. The secret code can be recovered by XORing n shares. The recovered code can be decoded as the same secret Mini Program. Theoretical analysis and experiments show that the proposed VSS scheme is practical and feasible.

A Tabu Search Algorithm for General Threshold Visual Cryptography Schemes

In Visual Cryptography Schemes (VCSs), for message n transparencies are generated, such that the original message is visible if any k of them are stacked. VCS especially for large values of k and n, the pixel expansion’s reduction and enhancement of the recovered images’ display quality continue to be critical issues. In addition to this, it is challenging to develop a practical and systematic approach to threshold VCSs. An optimization-based pixel-expansion-free threshold VCSs approach has been proposed for binary secret images’ encryption. Along with contrast, blackness is also treated as a performance metric for assessing the recovered images’ display quality. An ideally secure technique for a secret image’s protection through its partition into shadow images (known as shadows) is the Visual Secret Sharing (VSS) scheme. Acquirement of a smaller shadow size or a higher contrast is the VSS schemes’ latest focus. The white pixels’ frequency has been utilized to demonstrate the recovered image’s contrast in this work. While the Probabilistic VSS (ProbVSS) scheme is non-expansible, it can also be readily deployed depending upon the traditional VSS scheme. Initially, this work has defined the problem as a mathematical optimization model such that, while contingent on blackness and density-balance constraints, there is the maximization of the recovered images’ contrast. Afterward, an algorithm dependent on the Tabu Search (TS) is devised in this work for this problem’s resolution. Multiple complicated combinatorial problems have been successfully resolved with the powerful TS algorithm. Moreover, this work has attempted to bolster the contrast through the density-balance constraint’s slight relaxation. Compared to the older techniques, the proposed optimization-based approach is superior regarding the recovered images’ display quality and the pixel expansion factor from the experimental outcomes.

Visual Secret Sharing Scheme for Digital Image Watermarking

Traditional visual secret sharing (VSS) strategies hide secret images in shares that are either imprinted on transparencies or are encoded and put away in a digital form. The shares can appear as noise-like pixels or as significant pictures; but it will arouse suspicion and increase interception risk during transmission of the shares. Subsequently, VSS schema experience from a transmission risk problem for the secret itself and for the members who are associated with the VSS conspire. To address this issue, proposed a advanced technique for advanced digital watermarking using a texture and also a natural-image-based VSS scheme (VSS scheme) that shares secret images via various carrier media to protect the secret and the participants during the transmission phase. Devise the texture synthesis process into digital image to hide secret messages. In comparison to using an existing cover image to hide messages, our algorithm hides the source texture image and embeds secret messages through the process of watermarking. The regular offers can be photographs or hand-painted pictures in computerized structure or in printed structure. We likewise propose potential approaches to conceal the key to diminish the transmission chance issue for the offer. Test results demonstrate that the proposed approach is an amazing answer for taking care of the transmission chance issue for the VSS technique.

Weighted visual secret sharing for general access structures based on random grids

The traditional visual secret sharing (VSS) schemes share a secret image into multiple shares, and all the shares have the same importance. However, it is occasionally necessary to differentiate participants based on their different levels of importance in certain applications. In previous works, some weighted VSS schemes were implemented only for the (k,n) threshold access structure and were not applicable to other access structures. In this paper, a weighted VSS scheme is proposed for general access structures (GAS) based on random grids (RG). For the different qualified sets of shares, the amount of information we get about the secret image is different because the total weight of the shares participating in the recovery process is different. Moreover, both OR and XOR operations can be applied to recover the secret image, which can extend the applications of our scheme. For the same minimal qualified set, we can obtain better visual quality by stacking (XOR-ing) more shares. In addition, we can obtain the lossless secret image by performing the XOR operation on all shares. More importantly, our scheme is suitable for GAS; however, it has certain limitations in the weight assignment of participants for the non-threshold access structures. Finally, experiments and comparisons demonstrate the effectiveness of our scheme.

A Secure Visual Secret Sharing Scheme with Authentication Based on QR Code

With the rise of the Internet of Things (IoT), various devices in life and industry are closely linked. Because of its high payload, stable error correction capability, and convenience in reading and writing, Quick Response (QR) code has been widely researched in IoT. However, the security of privacy data in IoT is also a very important issue. At the same time, because IoT is developing towards low-power devices in order to be applied to more fields, the technology protecting the security of private needs to have the characteristics of low computational complexity. Visual Secret Sharing (VSS), with its features of safety and low computational cost, can fully meet the requirements of communication security in IoT. Therefore, a VSS scheme with QR code (VSS-QR) was proposed and has been applied to some extent. In VSS-QR, the secret is shared into a series of shares. These shares are usually common QR codes, which cannot cause the attention of the attacker. However, if there is dishonesty among participants, the secret cannot be recovered, which will lead to VSS-QR cannot be widely used due to its inadequate security. In this paper, we propose a visual secret sharing scheme with authentication based on QR code (VSSA-QR). Both the reconstructed secret QR code and shares can be verified whether they are forged by attackers. The abovementioned operations conveniently are performed on low-power QR scanning devices. Not only does the proposed scheme prevent some dishonest participants or attackers from cheating, but also prevent all participants from conspiring. In addition, the payload is the QR code itself, which is higher than other schemes. Theoretical analysis and experiments prove that the proposed scheme is effective.

A Novel ( t , s , k , n )-Threshold Visual Secret Sharing Scheme Based on Access Structure Partition

Visual secret sharing (VSS) is a new technique for sharing a binary image into multiple shadows. For VSS, the original image can be reconstructed from the shadows in any qualified set, but cannot be reconstructed from those in any forbidden set. In most traditional VSS schemes, the shadows held by participants have the same importance. However, in practice, a certain number of shadows are given a higher importance due to the privileges of their owners. In this article, a novel ( t , s , k , n )-threshold VSS scheme is proposed based on access structure partition. First, we construct the basis matrix of the proposed ( t , s , k , n )-threshold VSS scheme by utilizing a new access structure partition method and sub-access structure merging method. Then, the secret image is shared by the basis matrix as n shadows, which are divided into s essential shadows and n - s non-essential shadows. To reconstruct the secret image, k or more shadows should be collected, which include at least t essential shadows; otherwise, no information about the secret image can be obtained. Compared with related schemes, our scheme achieves a smaller shadow size and a higher visual quality of the reconstructed image. Theoretical analysis and experiments indicate the effectiveness of the proposed scheme.

GPGPU-based randomized visual secret sharing (GRVSS) for grayscale and colour images

Visual Secret Sharing (VSS) is a technique used for sharing secret images between users. The existing VSS schemes reconstruct the original secret image as a halftone image with only a 50% contrast. The Randomized Visual Secret Sharing (RVSS) scheme overcomes the disadvantages of existing VSS schemes. Although RVSS extracts the secret image with better contrast, it is computationally expensive. This paper proposes a General Purpose Graphics Processing Unit (GPGPU)-based Randomized Visual Secret Sharing (GRVSS) technique that leverages data parallelism in the RVSS pipeline. The performance of the GRVSS is compared with the RVSS in a generic and PARAM Shavak supercomputer architecture. The GRVSS outperforms the RVSS in both architectures.

A secure visual secret sharing (VSS) scheme with CNN-based image enhancement for underwater images

Nowadays, underwater images are being used to identify various important resources like objects, minerals, and valuable metals. Due to the wide availability of the Internet, we can transmit underwater images over a network. As underwater images contain important information, there is a need to transmit them securely over a network. Visual secret sharing (VSS) scheme is a cryptographic technique, which is used to transmit visual information over insecure networks. Recently proposed randomized VSS (RVSS) scheme recovers secret image (SI) with a self-similarity index (SSIM) of 60–80%. But, RVSS is suitable for general images, whereas underwater images are more complex than general images. In this paper, we propose a VSS scheme using super-resolution for sharing underwater images. Additionally, we have removed blocking artifacts from the reconstructed SI using convolution neural network (CNN)-based architecture. The proposed CNN-based architecture uses a residue image as a cue to improve the visual quality of the SI. The experimental results show that the proposed VSS scheme can reconstruct SI with almost 86–99% SSIM.

Penrose tiling for visual secret sharing

Visual secret sharing (VSS) has the advantage that the decryption is based on our human visual system without participation of any computational devices. However, traditional VSS schemes are only for sharing raster images with regard to pixels, which lead to that the secret image will be aliased when enlarged and its pixels are shared in rectangular way only. In this paper, we will introduce a VSS scheme for vectorized images based on Penrose tiling. Penrose tiling is with the merits of vectorization and nonperiodicity. These properties are applied to the proposed scheme so as to share those vectorized images; the basic unit of secret sharing could be any graphical shapes instead of pixels or rectangular regions only in the traditional methods. Our experiments show the effectiveness of the proposed scheme.

Quality improved (k, n) priority based progressive visual secret sharing

Progressive Visual Secret Sharing (PVSS) is a Visual Secret Sharing scheme which shares a secret image among multiple users and during the decryption this secret image can be reconstructed in a progressive manner. Recently, PVSS has been extended for priority users by giving different importance to different shares. Thus, the higher priority user holding higher importance shares obtains better visual quality compared to the lower priority users. However, existing priority based visual secret sharing suffers from the problem of inconsistent contrast and degraded visual quality. Hence, this paper uses two different approaches namely Codebook approach and Random grid approach to construct (k, n) Priority based Progressive Visual Secret Sharing (PPVSS) without pixel expansion to provide consistent contrast and better visual quality of reconstructed image. Experimental results show the effectiveness of proposed scheme compared to the existing scheme.