0% found this document useful (0 votes)
32 views3 pages

1.efficient Construction For Region Incrementing

The document discusses a proposed system for improving region incrementing visual cryptography schemes. It aims to enhance data security for databases by developing a novel construction for RIVCS using linear programming to minimize pixel expansion. The proposed system adds password protection and rearranging of pixels to shared images to prevent unauthorized access to protected databases.

Uploaded by

John Berkmans
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
32 views3 pages

1.efficient Construction For Region Incrementing

The document discusses a proposed system for improving region incrementing visual cryptography schemes. It aims to enhance data security for databases by developing a novel construction for RIVCS using linear programming to minimize pixel expansion. The proposed system adds password protection and rearranging of pixels to shared images to prevent unauthorized access to protected databases.

Uploaded by

John Berkmans
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Efficient Construction for Region Incrementing

Visual Cryptography


Abstract:

Region Incrementing Visual Cryptography Scheme (RIVCS) is a
method of encrypting a secret image into shares such that stacking a
sufficient number of shares reveals the secret image. Shares are usually
presented in transparencies. Each participant holds a transparency. Most of
the previous research work on EVCs focuses on improving two parameters:
pixel expansion and contrast. In this paper, we studied the cheating problem
in VC and Region Incrementing Visual Cryptography Scheme (RIVCS). We
considered the attacks of malicious adversaries who may deviate from the
scheme in any way. We presented three cheating methods and applied them
on attacking existent VC or Region Incrementing Visual Cryptography Scheme
(RIVCS) schemes. We improved one cheat-preventing scheme. This is a
visual cryptographic system which is implemented for database security.
This consists of two phases that explains how the data in database servers
are protected from tampering by illegal users, using the concept of visual
cryptography.
We develop a novel and efficient construction for RIVCS using
linear programming in this paper. The proposed integer linear program aims
at the minimization of the pixel expansion under the constraints for being a
RIVCS. Experimental results demonstrate the feasibility, applicability, and
flexibility of our construction. The pixel expansions and contrasts derived
from our scheme are also better than the previous results.



Existing system:

Data security has been a challenging task in visual cryptography system and
database systems.
The existing visual cryptography schemes that are used for data hiding have
a security hole in the encrypted Share file.
If the share images are hacked, the hacker can tamper the data that is hidden
and hence can disturb the entire technique.
In the existing, there is no optimized secured way to access the secret hidden
data and the data that are stored in databases.

Proposed system:

We develop a novel and efficient construction for RIVCS using linear
programming in this paper. The proposed integer linear program aims at the
minimization of the pixel expansion under the constraints for being a
RIVCS.
Experimental results demonstrate the feasibility, applicability, and
flexibility of our construction. The pixel expansions and contrasts derived
from our scheme are also better than the previous results.
In proposed system, to prevent the accessing of data in database, the
security is enhanced in three phases using visual cryptography.
First, an image is split into n encrypted shares using algorithm by the fact
that a pixel can be split into sub pixels.
Second, in order to avoid hacking of shared image, we employ password
protection for each share using Extended Embedded algorithm and simple
Arithmetic Encoding compression technique which compresses the pass
code.
Third, we perform rearranging of pixels of shared image by overlaying
process to obtain the access to the protected database.


Software Requirements
Platform : JDK 1.5 or 1.6
Program Language : JAVA, JavaSwing
Tool : NETBEANS 5.5
Operating System : Microsoft Windows NT 4.0 or
Windows 2000 or XP

Hardware Requirements

Processor : Pentium IV Processor
RAM : 512 MB
Hard Drive : 10GB
Disk Space : 1 GB

You might also like