A Recursive Threshold Visual Cryptography Scheme

This paper presents a recursive hiding scheme for 2 out of 3 secret sharing. In recursive hiding of secrets, the user encodes additional information about smaller secrets in the shares of a larger secret without an expansion in the size of the latter, thereby increasing the efficiency of secret sharing. We present applications of our proposed protocol to images as well as text.Comment: 8 page

Recursive Visual Secret Sharing Scheme using Fingerprint Authentication

Recursive Visual Secret Sharing scheme takes the idea from the basic scheme of Visual cryptography to stack two transparent shares to obtain the original image. The paper proposes a scheme of recursive creation of shares using the basic scheme and embedding secrets into the shares. This results levels of share creation i.e. n- secrets equals n/2 levels. The Recursive visual cryptography produces shares from level n-1 when encrypted. For the purpose of user identification Biometric fingerprint authentication using minutiae extraction is provided with pixel pattern match and RGBA intensity match.  Thus the proposed scheme would make efficient utilization of data. Keywords: Recursive Visual Cryptography, Embedding secrets, secret sharing, Minutiae pattern match, authentication, levels of shares

Biometric Data Security using Recursive Visual Cryptography

Recursive Visual cryptography takes the idea from the basic scheme of Visual cryptography to hide multiple secrets recursively in the single image. This paper proposes a scheme of recursive creation of shares using the basic scheme and embedding secrets into the shares. This results levels of share creation i.e. n- secrets equals n/2 levels. This paper also provides  secured authentication for the user, using the Biometric authentication Thus the proposed paper is implemented in any of the real time applications. Keywords:Recursive Visual Cryptography, Embedding secrets, Biometric authentication, Levels of share

Enhancing Data Security by Making Data Disappear in a P2P Systems

This paper describes the problem of securing data by making it disappear after some time limit, making it impossible for it to be recovered by an unauthorized party. This method is in response to the need to keep the data secured and to protect the privacy of archived data on the servers, Cloud and Peer-to-Peer architectures. Due to the distributed nature of these architectures, it is impossible to destroy the data completely. So, we store the data by applying encryption and then manage the key, which is easier to do as the key is small and it can be hidden in the DHT (Distributed hash table). Even if the keys in the DHT and the encrypted data were compromised, the data would still be secure. This paper describes existing solutions, points to their limitations and suggests improvements with a new secure architecture. We evaluated and executed this architecture on the Java platform and proved that it is more secure than other architectures.Comment: 18 page

Visual cryptography scheme with digital watermarking in sharing secret information from car number plate digital images

In this paper a visual cryptography scheme with a binary additive stream cipher is used to form the meaningless shares (share images or multiple layers) of original digital image, hiding some secret information. Each share image holds some information, but at the receiver side only when all of them are superimposed, the secret information is revealed by human vision without any complex computation. Proposed algorithm for generating shares is applied in MATLAB programming environment, using MATLAB built-in functions to create sequences of pseudorandom numbers or streams, which are used to make share images of original digital image. The input image is first converted into a binary image, shares are generated using pixel expansion scheme, and after that are sent to the receiver. At the received side, the shares could be printed in separate transparent sheets and overlapped in order to reveal the secret image, with some loss in contrast when compared to the original image. An algorithm is applied to car number plate digital images with watermark. Digital image watermarking method is used to embed some data in a car number plate digital image in order to verify the credibility of the content or the identity of the owner

Secret Sharing in Visual Cryptography

This thesis examines techniques for recursive hiding scheme for 3 out of 5 secret sharing and a probabilistic 2 out of 3 secret sharing scheme for gray scale images. In recursive hiding of secrets several messages can be hidden in one of the shares of the original secret image. The images that are to be hidden are taken according to their sizes from smaller to the largest. The first small secret image is divided into five different shares using visual cryptography. These shares are placed in the next level to create the shares of larger secret information. The shares at each consecutive level are distributed so that no one has access to all the shares of the smaller images, unless at least three participants come together to reveal the secret information, resulting in 3 out of 5 scheme. In the proposed protocol for gray scale images, the quality of the image is perfect when it is reconstructed for the construction of the final image based on the binary OR operation.Computer Science Departmen