Bit Slicng based Visual Cryptography On Gray Scale ImageÂ

Data transmission through online is become mandatory in recent ages. No one can avoid data transmission over internet. But sensitivity of the data to be considered while transmits over internet. Internet is public medium where everyone has equal right to do their activities. Like in general public, internet also having malicious users and their main activity is deployment of attack. These attacks are of many types such as hacking, tampering and eavesdropping etc. Efficient data hiding techniques are required to with stand these attacks or to escape from these attacks. Visual Cryptography is one of such techniques to hide multimedia data in other multimedia data such as images, audio files or video files. In the proposed system secret image is partitioned or divided into shares based on the bits. These shares are then covered with given cover images then these covered shares are distributed to ‘n’ participants. To recover the secret all those participants are required. The proposed approach followed a novel method of bit slicing on gray scale images. So at the time of recover secret image cant’ be visible with same intensity or resolution as that of original image. For this purpose four secret keys are used. Simulation results shows that when compared to existing schemes , proposed approach can hide the image under cover images in efficient way as well as recovering of secret also lightweight and resilience to attacks

A Novel Quantum Visual Secret Sharing Scheme

Inspired by Naor et al.'s visual secret sharing (VSS) scheme, a novel n out of n quantum visual secret sharing (QVSS) scheme is proposed, which consists of two phases: sharing process and recovering process. In the first process, the color information of each pixel from the original secret image is encoded into an n-qubit superposition state by using the strategy of quantum expansion instead of classical pixel expansion, and then these n qubits are distributed as shares to n participants, respectively. During the recovering process, all participants cooperate to collect these n shares of each pixel together, then perform the corresponding measurement on them, and execute the n-qubit XOR operation to recover each pixel of the secret image. The proposed scheme has the advantage of single-pixel parallel processing that is not available in the existing analogous quantum schemes and perfectly solves the problem that in the classic VSS schemes the recovered image has the loss in resolution. Moreover, its experiment implementation with the IBM Q is conducted to demonstrate the practical feasibility.Comment: 19 pages, 13 figure

A Modified Multi-secret Visual Cryptography with Ring Shares

Abstract. A visual cryptography scheme encoding multiple secret images into two ring shares is proposed in this paper. In the secret sharing process, two shares are produced by the marked areas and the basis matrices of (2, 2)-VCS. Using ring shift right function, the secret images are recovered by stacking two shares. The security and contrast properties of the scheme have been proved. Compared with the previous ones, the scheme makes the number of secret images unlimited. Furthermore, the pixel expansion and the relative difference are improved greatly

An Optimization Model for Visual Cryptography Schemes with Unexpanded Shares

[[abstract]]Visual cryptography schemes encrypt a secret image into n shares so that any qualified set of shares enables one to visually decrypt the hidden secret; whereas any forbidden set of shares cannot leak out any secret information. In the study of visual cryptography, pixel expansion and contrast are two important issues. Since pixel-expansion based methods encode a pixel to many pixels on each share, the size of the share is larger than that of the secret image. Therefore, they result in distortion of shares and consume more storage space. In this paper, we propose a method to reach better contrast without pixel expansion. The concept of probability is used to construct an optimization model for general access structures, and the solution space is searched by genetic algorithms. Experimental result shows that the proposed method can reach better contrast and blackness of black pixels in comparison with Ateniese et al.’s.[[journaltype]]國際[[incitationindex]]SCI[[incitationindex]]EI[[booktype]]紙本[[countrycodes]]DE

An Optimization Model for Visual Cryptography Schemes with Unexpanded Shares

[[conferencetype]]國際[[conferencedate]]20060927~2006092

Advances in knowledge discovery and data mining Part II

19th Pacific-Asia Conference, PAKDD 2015, Ho Chi Minh City, Vietnam, May 19-22, 2015, Proceedings, Part II</p