UGC APPROVED ISSN 2278-1412

Archive

  Volume 13 | Issue 11

  Volume 13 | Issue 10

  Volume 13 | Issue 9

  Volume 13 | Issue 8

  Volume 13 | Issue 7

  Volume 13 | Issue 6

  Volume 13 | Issue 5

  Volume 13 | Issue 3

  Volume 13 | Issue 1

  Volume 12 | Issue 12

  Volume 12 | Issue 11

  Volume 12 | Issue 10

  Volume 12 | Issue 9

  Volume 12 | Issue 8

  Volume 12 | Issue 7

  Volume 12 | Issue 6

  Volume 12 | Issue 5

  Volume 12 | Issue 4

  Volume 12 | Issue 3

  Volume 12 | Issue 2

  Volume 12 | Issue 1

  Volume 11 | Issue 12

  Volume 11 | Issue 11

  Volume 11 | Issue 10

  Volume 11 | Issue 8

  Volume 11 | Issue 7

  Volume 11 | Issue 6

  Volume 11 | Issue 3

  Volume 11 | Issue 1

  Volume 10 | Issue 12

  Volume 10 | Issue 8

  Volume 10 | Issue 6

  Volume 10 | Issue 3

  Volume 10 | Issue 2

  Volume 10 | Issue 1

  Volume 9 | Issue 10

  Volume 8 | Issue 11

  Volume 8 | Issue 7

  Volume 7 | Issue 8

  Volume 7 | Issue 7

  Volume 7 | Issue 6

  Volume 7 | Issue 5

  Volume 7 | Issue 4

  Volume 7 | Issue 3

  Volume 7 | Issue 2

  Volume 7 | Issue 1

  Volume 6 | Issue 12

  Volume 6 | Issue 10

  Volume 6 | Issue 9

  Volume 6 | Issue 8

  Volume 6 | Issue 7

  Volume 6 | Issue 6

  Volume 6 | Issue 5

  Volume 6 | Issue 4

  Volume 6 | Issue 3

  Volume 6 | Issue 2

  Volume 6 | Issue 1

  Volume 5 | Issue 12

  Volume 5 | Issue 11

  Volume 5 | Issue 10

  Volume 5 | Issue 9

  Volume 5 | Issue 8

  Volume 5 | Issue 7

  Volume 5 | Issue 6

  Volume 5 | Issue 5

  Volume 5 | Issue 4

  Volume 5 | Issue 3

  Volume 5 | Issue 2

  Volume 5 | Issue 1

  Volume 4 | Issue 12

  Volume 4 | Issue 10

  Volume 4 | Issue 8

  Volume 4 | Issue 7

  Volume 4 | Issue 6

  Volume 4 | Issue 5

  Volume 4 | Issue 4

  Volume 4 | Issue 2

  Volume 4 | Issue 1

  Volume 3 | Issue 10

  Volume 3 | Issue 8

  Volume 3 | Issue 6

  Volume 3 | Issue 5

  Volume 3 | Issue 4

  Volume 3 | Issue 3

  Volume 3 | Issue 2

  Volume 3 | Issue 1

  Volume 2 | Issue 12

  Volume 2 | Issue 11

  Volume 2 | Issue 10

  Volume 2 | Issue 9

  Volume 2 | Issue 8

  Volume 2 | Issue 7

  Volume 2 | Issue 2

  Volume 1 | Issue 9

  Volume 1 | Issue 8

  Volume 1 | Issue 7

  Volume 1 | Issue 6

  Volume 1 | Issue 4

  Volume 1 | Issue 3

  Volume 1 | Issue 2

  Volume 1 | Issue 1

Current Volume 13 | Issue 12

A Probabilistic Model of Visual Cryptography


Volume:  1 - Issue: 09 - Date: 01-09-2012
Approved ISSN:  2278-1412
Published Id:  IJAECESTU203 |  Page No.: 167-171
Author: Swati Yadav
Co- Author: Rajesh Kumar rai
Abstract:-The visual cryptography (VC) is a secret sharing scheme where a secret image is encoded into transparencies, and the stacking of any out of transparencies reveals the secret image. The stacking of or fewer transparencies is unable to extract any information about the secret. We discuss the additions and deletions of users in a dynamic user group. To reduce the overhead of generating and distributing transparencies in user changes, this paper proposes a VC scheme with unlimited based on the probabilistic model. The proposed scheme allows to change dynamically in order to include new transparencies without regenerating and redistributing the original transparencies. Specifically, an extended VC scheme based on basis matrices and a probabilistic model is proposed. An equation is derived from the fundamental definitions of the VC scheme, and then the VC scheme achieving maximal contrast can be designed by using the derived equation. 
Key Words:- visual cryptography, Probabilistic scheme
Area:-Engineering
Download Paper: 
Preview This Article

Unable to display PDF file. Download instead.


Download Paper

Downlaod Paper

No. of Download

000120

Impact Factor

7.4


ijaece

Upcoming Events


Special Issue For Paper


Upcoming Conference


Call For Paper