Conventional visual secret sharing schemes are designed for a single secret image so it is
inefficient to generate numerous share images for multiple secret images simultaneously …

The aim of this paper is to maximize the range of the access control of visual secret sharing
(VSS) schemes encrypting multiple images. First, the formulation of access structures for a …

In this paper, we consider a new visual cryptography scheme that allows for sharing of
multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node …

In this paper, we consider a new visual cryptography scheme that allows for sharing of
multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node …

Random grids (RGs)‐based visual secret sharing (VSS) has gained much attention in
academia than before to avoid the potential drawbacks in visual cryptography‐based VSS …

Secret sharing is a method of generating multiple shares from secret information so that only
a qualified set of shares can be employed to recover this secret information. Visual secret …

For visual secret sharing (VSS), general access structure (GAS), which can freely define the
qualified set and the forbidden set, provides dealers the ability to share secret information …

This paper describes a visual cryptography method for the elimination of pixel expansion
and the improvement of contrast. The proposed method uses the probability concept to …

In this paper, a method is proposed to construct a visual secret sharing (VSS) scheme for
multiple secret images in which each share can be rotated with 180 degrees in decryption …

A new construction of visual cryptography scheme (VCS) with dihedral group access
structure for two shares and many secret images is proposed. Let D 2 n be a dihedral group …