A visual cryptography scheme for a set p ofnparticipants is a method of encoding a secret. Request pdf an extended visual cryptography algorithm for general access structures conventional visual secret sharing schemes generate noiselike. Image secret sharing construction for general access. In this paper, we propose an extended visual cryptography scheme using random grids which can accommodate general access structures. The resulting structure can b e describ ed b yan n m bo olean matrix s s ij where i the j th subpixel in the i. Less formally it is a description of who needs to cooperate with whom in order to access the resource. Deterministic extended visual cryptographic schemes for. Stinson 2, where an access structure is a specification of all qualified and forbidden subsets of n shares. This paper shows that by providing the trustees with several information data concerning the distributed information of the k, n threshold method, any access structure can be realized. An efficient general access structure based multiple secret visual cryptography s.
General access structures efficiently hides the data by defining an access structure of qualified sets. A visual cryptography scheme for a set p ofnparticipants is a method of encoding a secret imagesiintonshadow images called shares, where. Contrastimproved visual cryptography for general access. Greylevel visual cryptography extends this model to include greyscale images. So, visual cryptography for general access structure improves the security of system. To reduce the pixel expansion problem in colorblackandwhite visual cryptography schemes cbwvcss and to provide flexible sharing strategy simultaneously, a random grid based cbwvcs rgcbwvcs for general access structure gas is proposed in this paper. Blind authentication based cheating immune xor step. We prove that our scheme gives a strong access structure. This represents a particular type of access structure. Any k shares from qualified subset of shares can reveal secret. Improved schemes for visual cryptography springerlink. Python implementation of visual secret sharing schemes ruxandra olimid faculty of mathematics and computer science.
Visual cryptography schemes for secret color image sharing. Most visual cryptographic methods utilize the technique of pixel expansion, which causes the size of the shares to be much larger than that of the secret image. Visual cryptography scheme for secret image retrieval. Abstract information, image and media encryption is a method for preventing misuse of. These results use graphbased access structures as an example, however our scheme handles the case of one secret image per edge as. Secret sharing scheme realizing general access structure.
Nevertheless, in fact its encoding efficiency is still low because of that the encoding length is invariable and very small for each run. The different perspectives on visual cryptography, such as access structure, generation of shares and other aspects reported by different authors are. An extended visual cryptography algorithm for general. An extended visual cryptography algorithm for general access structures. In this paper, we give some new insight into linear algebraic technique to construct vcs, where we can take more equations. Any visual secret information pictures, text, etc is considered as image and encryption is performed using simple algorithm to generate n copies of shares depending on type of access structure schemes. A visual cryptography for general access structure by multipixel encoding with variable block size. Thus, there is no need to any complex cryptographic calculation. E cient construction of visual cryptographic scheme for compartmented access structures sabyasachi dutta, tamal bhore and avishek adhikari. Visual cryptography, introduced through naor and shamir.
They have shown that most previous work of visual cryptography scheme for plural image suffered from the leak out of some information in each share about the other secret images of the scheme. General access structure for modulo2 secret sharing. Security is an important issue in information technology. Visual cryptography for general access structures 2. A stego cryptography algorithm for general access structures. Visual cryptography for general access structures citeseerx. Grey level visual cryptography for general access structures. Also, or v is used to denote the boolean operation or of a set of vectors with result v. In the vc scheme, a secret image is encoded into transparencies, and the content of each transparency is noiselike so that the secret information cannot be retrieved from any one transparency via human visual observation or signal analysis techniques. Multipixel encoding is an emerging method in visual cryptography for that it can encode more than one pixel for each run. General access st ructures are used in visual cryptography schemes so a s to in crease the efficienc y that a vcs can achieve in securely hiding the d ata. Visual cryptography for general access structures core. So this project provides the user more security to do online transaction securely. Most visual cryptographic methods utilize the technique of pixel expansion, which causes the size of the shares to.
We propose two different techniques to construct visual cryptography schemes for any access structure. Only qualified subsets of participants can recover the. In this paper, we propose a general approach to solve the management and pixel expansion. The hamming weight wv is the number of ones in the boolean vector v. Multi secret image color visual cryptography schemes for. Pdf a visual cryptographic technicque for chromatic images. An efficient general access structure based multiple. Pang 10 proposed an efficint sharing scheme with general access structure.
Visual cryptography study and implementation divij wadhawan, hemank lamba, rajat vikram singh introduction nowadays, in the internet, besides text, multimedia information is also quite prevalent. In the proposed visual cryptography schemes for general access structures, the single secret image blackandwhite visual cryptography schemes with meaningful shares have been constructed, in which the shares are innocent looking images. Create a scheme such that qualified combinations of participants can reconstruct secret unqualified combinations of participants gain no information about the secret for a 2,n scheme access structure can be represented as graph. Pdf a visual cryptographic technicque for chromatic. An implementation of algorithms in visual cryptography in images. Stinson extended k, n visual cryptography model to general access structure 4. A visual cryptography scheme vcs for general access structures is a method to encode a secret image into n shares for n participants.
How to keep the secret information, so that it does not depend on one authority only is a. Visual cryptography for general access structures ateniese et al 96 goal. Aug 22, 2016 the most essential advantage of applying linear algebra to construct visual cryptography scheme vcs lies in that it only requires solving linear equations in the construction of initial basis matrices, which are the basis matrices before removing the common columns. The simplest access structure is the 2 out of 2 scheme. Visual cryptography is a secret sharing method that uses human eyes to decrypt the secret. Besides, our method can be easily extended to general access structure. Visual cryptography vc is a branch of secret sharing. If no restrictions are required, then the access structure is called general access structure. In its original use in cryptography, the resource was a secret shared among the participants. General access structures gas, pixel expansion, random gridsrg and visual cryptography vc. We analyze the structure of visual cryptography schemes and we prove bounds on the size of the shares distributed to the. Like ateniese, 2 who actually made visual cryptography for general access structure which works on qualified and forbidden share concept has the problem of pixel expansion and low contrast.
What are visual secret sharing schemesgeneral concept. Image security using visual cryptography a thesis submitted in partial ful llment of the requirements for the degree of bachelor of technology in computer science and engineering submitted by sangeeta bhuyan 111cs0444 under the guidance of prof. This cryptographic paradigm has been introduced by naor and shamir 7. A comprehensive study of visual cryptography springerlink. Citeseerx document details isaac councill, lee giles, pradeep teregowda. Visual cryptography for general access structure using pixelblock. Visual cryptography for general access structures sciencedirect. In this paper, we are developing visual cryptography scheme in which we are generating shares for general access structure.
We analyze the structure of visual cryptography schemes and we prove bounds on the size of the shares distributed. Pdf visual cryptography for general access structures semantic. Extended visual cryptography for general access structures. This article describes how the k, n threshold image secret sharing technology can recover the secret image even n. Section ii summarizes the following research works in visual cryptography and its extensions.
International journal of advanced research in computer and. Dept of ece, arunachala college of engineering for women. In other methods that construct a visual secret sharing scheme with a general access structure for plural secret images have been proposed. Therefore the security of these secret and confidential images is a valid concern. There are circumstances where an action is required to be executed by a. In this paper we propose two techniques for constructing visual cryptography schemes for general access structures. An extended visual cryptography algorithm for general access.
In step construction traditional xor b ased 2, 2 visual cryptographic scheme is recursively applied for generating shares. The encryption procedure encrypts a image into the socalled shares which are noiselike. Ecs, dept of ece, arunachala college of engineering for women. Aug 31, 2012 an extended visual cryptography algorithm for general access structures. Adhikari a 20 linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images.
Random grids helps us get rid of pixel expansion and extensive. Visual cryptography for general access structure using. In turn, the set of all such qualified sets is called the access structure of the system. Multiple information hiding in general access structure. The paper considers 3 types of blackandwhite secret image vss. Saizhi 11 proposed a novel general access structure for multiple secret sharing, which is based on shamirs secret sharing scheme and the discrete logarithm problem. Securing online transaction using visual cryptography. In general access structure scheme, given set of n shares is divided into two subsets namely qualified and forbidden subset of shares as per the importance of shares. Considerable less effort is devoted to idbased grouporiented decryption scheme with general access structure 68. Visual cryptography vc is a powerful technique that combines the. Index termsvisual secret sharing vss, general access structure, multipixel. However, in fact its encoding efficiency is still low. In this paper we introduce a new construction of a black and white visual cryptographic scheme for general access structure. In k, n visual secret sharing scheme, a secret of b bits is distributed among n shares of size at least b bits each.
Secret sharing, visual cryptography, general access structure, information security. Pdf extended visual cryptography for general access. An implementation of algorithms in visual cryptography in. In addition, the requirement for inputs of the binary or dithered nature only limits the applicability of visual cryptography. The most essential advantage of applying linear algebra to construct visual cryptography scheme vcs lies in that it only requires solving linear equations in the construction of initial basis matrices, which are the basis matrices before removing the common columns. Although visual cryptography has been introduced only recently, is. Secret sharing access structure secret image secret sharing scheme black. Stinson, visual cryptography for general access structure, icalp96, italy, 1996 5. Certificatebased encryption scheme with general access. We analyze the structure of visual cryptography schemes and we prove bounds on the size of the shares distributed to the participants in the scheme.
This is due to the greater popularity of threshold secret sharing methods and their simplicity in the case of a large number of subgroups belonging to the access structure. Furthermore, this scheme can work well for both threshold access structure and general access structure and well for both. Baskari abstract usually image processing system includes visual cryptography is a popular solution for image encryption. A new scheme for user authentication is proposed using visual cryptography. A common general access structure construction approach in secret image sharing. The proposed scheme has advantage in encoding efficiency over singlepixel encoding and other known multipixel encoding methods. R visual cryptography for general access structures. Abstractmultipixel encoding is an emerging method in visual cryptography for that it can encode more than one pixel for each encoding run. Image secret sharing construction for general access structure with meaningful share. A new black and white visual cryptographic scheme for. Visual cryptography, an example of a secret sharing scheme encrypts the secret digital information into a number of shares wherein the decryption is performed by overlaying the shares generated and by utilizing the hvs human visual system. The encryption procedure encrypts a image into the socalled shares which are. Pdf extended visual cryptography for general access structures. K mohapatra department of computer science and engineering national institute of technology rourkela.
An efficient general access structure based multiple secret. Share generation technique gives more security to the otp then gets converted into image captcha and this will provide more security. General access structure for modulo2 secret sharing scheme. Linear algebraic techniques to construct monochrome visual. E cient construction of visual cryptographic scheme for. Visual cryptographic technique for enhancing the security of. Pdf multiple information hiding in general access structure. Random grid based color visual cryptography scheme for black. In this paper we put forward a method of construction of a strong monochrome visual cryptographic scheme vcs for general access structure using linear algebra. Citeseerx visual cryptography for general access structures. Extended visual cryptography for general access structures using random grids.
Up to the best of our knowledge, the scheme is the rst proposed scheme for compartmented access structure in the literature of visual. We find out the conditions for which our scheme gives less pixel expansion compared to the schemes given in. They have shown that most previous work of visual cryptography scheme for plural image suffered from the leak out of. Jun 12, 20 though the monochrome black and white visual cryptography has a very rich literature, a very few papers have been published for the construction of general access structure. We provide a novel technique to realize k out of n thre. Finding the closed form of relative contrast of a scheme is, in general, a combinatorially. We analyze the structure of visual cryptography schemes and we prove bounds on. The original problem of visual cryptograph y is the sp ecial case of a out of visual secret sharing problem it can b. The advantages of xor based step construction are, less pixel expansion compared to all other deterministic visual. They permit the sharing of a secret image between multiple participants so that only. Visual cryptography scheme, general structure algorithm, stamping algorithm, shares, transparencies. In this thesis we survey known results of greylevel visual cryptography and visual cryptography for general access. A common general access structure construction approach in. Visual cryptography for general access structures information and.
854 164 1109 1093 688 350 1225 499 463 329 255 1026 1401 1002 1573 1493 599 287 167 1145 883 326 2 675 1181 1455 584 823 667 1262 1139 347 1359 390 1121 1166 1326 910