An Improved Pixel Sieve Method for Visual Cryptography

نویسندگان

  • Vaibhav Choudhary
  • Kishore Kumar
  • Pravin Kumar
چکیده

Visual cryptography encodes a secret image into n shares which are distributed to n participants. Pixel Sieve method was proposed recently to encode an image into shares, but the encryption quality is poor. In this paper an improved version of pixel sieve method is proposed to achieve more security then existing pixel sieve method. Based on cross merge and key shifting schemes, the proposed method generates quite noisy and highly secure encrypted images. The simulation shows that the quality of the encrypted images observably better than existing pixel sieve method. General Terms Security Algorithms, Visual Cryptography.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modified Pixel Sieve Method for Visual Cryptography

Visual cryptography encodes a secret image into n shares which are distributed to n participants. Pixel Sieve method was proposed recently to encode an image into shares, but the encryption quality is poor. In this paper an modified version of pixel sieve method is proposed to achieve more security than existing pixel sieve method. Based on key shifting scheme, the proposed method generates qui...

متن کامل

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

متن کامل

On the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes

In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...

متن کامل

An Extended Visual Cryptography Algorithm for Quality-Improved Gray Scale Image with Sigmoid Function

Conventional visual secret sharing schemes generate noise-like random pixels on shares to hide secret images. It suffers amanagement problem, because of which dealers cannot visually identify each share. This problem is solved by the extended visual cryptography scheme (EVCS), which adds ameaningful cover image in each share. However, the previous approaches involving the EVCS for general acces...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011