If an image can be converted into a point in plane or space, lots of image problems can be considered based on geometric and vector theory. In this paper, the “image to point” conversion via complex number basis is proposed. Combined with the existing threshold access structures scheme, it leads to proposal of using number based secret sharing schemes in color images sharing.

In the visual secret sharing scheme proposed by Naor and Shamir [3], a secret image is encoded into shares, of which size is larger than that of the secret image and the shares are decoded by stacking them without performing any cryptographic computation. In this paper we propose a (k, n) visual secret sharing scheme to encode a black-and-white image into the same size shares as the secret imag...

In this paper, a new (k, n) threshold Secret Image Sharing Scheme (SISS) is proposed. In the proposed scheme the secret image is first partitioned into several non-overlapping blocks of k pixels. Every k pixel is assumed as the vertices of a complete graph G. Each spanning tree of G is represented by k pixels along with Prüfer sequence and used to form k pixels of a share image. The original se...

The concept of social secret sharing was introduced in 2010 by Nojoumian et al. In Nojoumian et al.’s scheme (called SSS), the number of shares allocated to each party depends on the player’s reputation and the way he interacts with other parties. In other words, weights of the players are periodically adjusted such that cooperative participants receive more shares compared to non-cooperative p...

The main concept of the original visual secret sharing (VSS) scheme is to encrypt a secret image into n meaningless share images. It cannot leak any information of the shared secret by any combination of the n share images except for all of images. The shared secret image can be revealed by printing the share images on transparencies and stacking the transparencies directly, so that the human v...

Secret Sharing from the perspective of threshold schemes has been wellstudied over the past decade. Threshold schemes, however, can only handle a small fraction of the secret sharing functions which we may wish to form. For example, if it is desirable to divide a secret among four participants A , B: C, and D in such a way that either A together with B can reconstruct the secret or C together w...

In this paper, we consider a special type of secret sharing scheme known as Visual Cryptographic Scheme (VCS) in which the secret reconstruction is done visually without any mathematical computation unlike other secret sharing schemes. We put forward an efficient direct construction of a visual cryptographic scheme for compartmented access structure which generalizes the access structure for th...