0% found this document useful (0 votes)
42 views15 pages

Cheating Prevention in Visual Cryptography: Walchand College of Engg. Sangli

This document summarizes a presentation on preventing cheating in visual cryptography schemes. It begins with an introduction to visual cryptography and its basic 2 out of 2 scheme. It then discusses parameters for modeling visual cryptography schemes and potential extensions. The presentation focuses on implementing a randomized visual cryptography algorithm and studying methods for cheating prevention in visual cryptography. It proposes applying visual cryptography for applications like remote voting authentication and banking customer identification. The future work is to further study cheating prevention and implement an algorithm to prevent cheating in visual cryptography.

Uploaded by

12APEKSHA12
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
42 views15 pages

Cheating Prevention in Visual Cryptography: Walchand College of Engg. Sangli

This document summarizes a presentation on preventing cheating in visual cryptography schemes. It begins with an introduction to visual cryptography and its basic 2 out of 2 scheme. It then discusses parameters for modeling visual cryptography schemes and potential extensions. The presentation focuses on implementing a randomized visual cryptography algorithm and studying methods for cheating prevention in visual cryptography. It proposes applying visual cryptography for applications like remote voting authentication and banking customer identification. The future work is to further study cheating prevention and implement an algorithm to prevent cheating in visual cryptography.

Uploaded by

12APEKSHA12
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

Walchand College of Engg.

Sangli

Project Seminar

Cheating Prevention in Visual Cryptography


Overview
•Introduction
•Basic2 out of 2 scheme
•Modeling visual cryptography schemes
•Parameters of visual cryptography

schemes
•Extensions

 
Introduction
Naor and Shamir - Visual Cryptography
 Image split into 2 shares
 Decoding = stacking transparencies
 Perfectly secure, 1 share contains no

information about image


Extended to k out of n sharing problem
 Image split into n shares
 Any k stacked together reveal image
 Perfectly secure, any k-1 shares contain no

information
Basic Scheme: 2 out of 2
Black and white image: each pixel divided in 2 sub-pixels
Basic Scheme

Each pixel divided in 4 sub-pixels :


 White pixel: two identical sub-pixel
 Black pixel: two complementary sub-pixel

Perfect security:
 Layout was randomly chosen
 Each pixel has 2 black and 2 white sub-pixels
Shares Schema
Visual Cryptography Schemes: Model

Each pixel (black or white):


 appears in n shares

 divided into m sub-pixels

 pixel represented by n*m Boolean matrix


s= [si j]

 Sij = 1 iff jth sub-pixel in the ith


transparency is black
Example: 2 out of 2 scheme with 2
sub-pixels

Visual Sharing Scheme: Model


Visual Sharing Scheme: Parameters
Number of pixels m in share:
 Loss in resolution
 m as small as possible

Relative difference a:
 Loss in contrast
 a as large as possible

Size r of collections C0 and C1:


 log r is number of random bits needed to

generate share
 Does not affect quality of the picture
Extensions of VCS

 Different schemes for colour images

 Schemes for visual authentication and


identification

 Concealment of existence of secret message:

 Each share contains innocent looking image

 Stacking shares reveals secret image


Currently….

 Implementing randomized
visual cryptography algorithm

 Study of cheating methods in


VC
Algorithm
 Pixel Sij (original pixel)
 Si j´ = 255 - Si j (pixel reversal)
 reduce Si j´(Random number generator)
 Si j’- Si j
 reduce reversed value of Si j´
 Si j´´ = 255 - Si j´
 Store in matrix as image (share 1)
 Take the difference of two random number generators

with original pixel Si j


 Si j´´´ = 255 - Si j´
 Store Si j´´´ in matrix as image (share 2)
 Repeat for each pixel
APPLICATION OF VISUAL
CRYPTOGRAPHY

 AUTHENTICATION FOR REMOTE VOTING

 BANKING CUSTOMER IDENTIFICATION


Future Work….
 Study of cheating prevention
in VC

 Implementation of cheating
prevention algorithm in VC
Thank you !

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy