cloud computing for agent based urban transportation system vinayss
DESCRIPTION
TRANSCRIPT
City Engineering CollegeDoddakallasandra, Kanakapura Road,
Bangalore-560061
Embedded Extended Visual Cryptography Scheme
Under the guidance Under the guidance of of Mr.GIREESH BABU C. N ,
Lecturer Dept. of CSE
VINAY .S.S[1CE08CS109] RAKSHITH.G [1CE08CS069]SHEIK SUHEB[1CE08CS080] RAMESH .M.V[1CE09CS403]
Project ByProject By::
OUTLINE
• Introduction
• Literature Survey
• Problem Definition
• Hardware and Software Requirements
• Methodology
• Software Testing
• Implementation
• Conclusion and future scope2
Visual cryptography (vc) was introduced by Moni Naor and Adi
Shamir at eurocrypt 1994.
It is used to encrypt written material (printed text, handwritten
notes, pictures , audio, video etc.) in a perfectly secure way.
The decoding is done by the human visual system directly, without
any computation cost.
INTRODUCTION
Example :
3
LITERATURE SURVEY
Visual Cryptography Scheme (VCS)
Extended Visual Cryptography Scheme (EVCS)
Embedded Extended Visual Cryptography Scheme (EEVCS)
4
PROBLEM DEFINITION
• Information send through any network have a chance to attack by Intruders.
• Encryption provides an obvious approach for information security, and
encryption programs are readily available.
• The encryption provides an desirable form to send information without
anyone even noticing that information has been sent secret information.
5
EXISTING SYSTEM
• Existing Visual Cryptographic scheme provides us to have low profile data to get embed into high profile data.
• Further Visual Cryptographic scheme supports with only one type of image format.
• All of the traditional steganography techniques have limited information-hiding capacity.
• Scalability is limited, thus existing system does not provide a friendly environment
6
PROPOSED SYSTEM
• The data are encrypted and later it is embedded into vessel..
• Data and vessel or container can have A varies possible forms, such as digital images, sound clips.
Text
audio
images
video
Text
audio
video
images
7
• Then data is divided into two or more halves and sent through multiple network channels
• Once the data reaches the exact destination all the bits of the actual file which was divided get overlapped on overlap command.
• When the decode command is used, the original data gets retrieved.
• Provides a high-level security.
PROPOSED SYSTEM (CONT.)
8
REQUIREMENT ANALYSISFUNCTIONAL REQUIREMENTS:
•Functional requirements specify which output file should be produced from the given File • for each functional requirement a detailed description of all data inputs and their source and the range of valid inputs must be specified.
NON FUNCTIONAL REQUIREMENTS:
•Describe user-visible aspects of the system that are not directly related with the functional behavior of the system. •Non-Functional requirements include quantitative constraints, such as response time (i.e. how fast the system reacts to user commands.) or accuracy (i.e. how precise are the systems numerical answers.)
PSEUDO REQUIREMENTS:•The client imposes these requirements.•Typical pseudo requirements are the implementation language and the platform on which the system is to be implemented.
9
Monitor : 14” color
Processor : Pentium Celeron
Processor Speed : 850 MHz
Memory Size : 128MB
Hard Disk Drive : 40GB
LAN : Connected with two Systems
Operating System : ubuntu
Front End : JAVA
Tools : Eclipse10
COVER IMAGE 1
SHARE 1 SHARE 2
VISUAL CRYPTOGRAPHY
OF COVER IMAGE 1
COVER IMAGE 2
SHARE 3 SHARE 4
VISUAL CRYPTOGRAPHY
OF COVER IMAGE 2
SHARE 5 SHARE 6
SECRET IMAGE
ARCHITECTURAL DIAGRAM STAGE 1METHODOLOGY
ARCHITECTURAL DIAGRAM-STAGE 2
12
VISUAL CRYPTOGRAPHY
OF COVER IMAGE 1
SHARE 5
EMBEDDED VISUAL CRYPTOGRAPHY OF
SECRET IMAGESHARE 1
VISUAL CRYPTOGRAPHY
OF COVER IMAGE 2
SHARE 6
EMBEDDED VISUAL CRYPTOGRAPHY OF
SECRET IMAGESHARE 2
SENDER RECEIVER
USE CASE DIAGRAM
EEVCS System
Receiving PART ISend PART I of
Receiving PART II
SEQUENCE DIAGRAM
SENDER SHARE I SHARE
IIRECEIVE
R
output file
Send PART II of
output file
SOFTWARE TESTING Testing is the process of trying to discover every conceivable
fault or weakness in a work product.
It provides a way to check the functionality of components,
sub assemblies, assemblies and/or a finished product.
Types of TestingUnit Testing
It is the testing of individual software units of the application .
It is done after the completion of an individual unit before
integration.
SOFTWARE TESTING(CONT..)
Integration Testing
Integration tests are designed to test integrated software
components to determine if they actually run as one program.
Integration testing is specifically aimed at exposing the problems
that arise from the combination of components.
System Testing
System testing ensures that the entire integrated software system
meets requirements.
It tests a configuration to ensure known and predictable results.
TESTCASE ID TESTCASE EXPECTED RESULT ACTUAL RESULT
1
Enter the valid data in the User Id and User Password and click on login button on login page.
Login page should be display.
Login page opened.
2
Enter the invalid data in the User Id and User Password and click on login button on login page.
Error message should be display.
Error message is display.
3To link to Click on Add button on the home page.
Should be able to link to add page.
link to add page
4 To link to home page click on L icon.
Should be able to link to home page.
Link to home page.
TEST CASES
TESTCASE ID TESTCASE EXPECTED RESULT
ACTUAL RESULT
5 To link to Click on Add button on the home page.
Should be able to link to add page.
link to add page
6 Click on delete button on the home page.
Should be able to message for deleting the data.
“Deleted successfully “Message is display.
7To link to change password page click on Change pwd button.
Should be able to link to Change the password page.
Link to Change the password page.
8To link to home page click on L icon.
Should be able to link to home page.
Link to home page.
IMPLEMENTATION
Modules
1. ADMIN SESSION
1. USER SESSION
3. TESTING AND INTEGRATION
ADMIN SESSION
LOGIN MODULEIn this module, we design user interface design using applet frame work. The user interface should be very easy and understandable to every user.
USER CREATIONThis module is meant for creation of the user. The admin has super privilege to add ass many users to the system and at
the same time to delete the existing user in the system. USER DELETION
The admin has the authority to delete the user from the system, the admin ask the user type before deleting the particular user from the system, the admin can delete another admin or an user from the system.
CHANGE PASSWORDIn this module the password associated with that particular user can be
changed.
DIAGRAM OF ADMIN SESSION
Administrator
Login
Createuser
Deleteuser
Changepassword
USER SESSION IMAGE INPUT
2 Covering image + 1 Secret image. VISUAL CRYPTOGRAPHY IMPLEMENTATION
This is the core for our project, where we implement the Visual Cryptography.
Converting the color images to binary.Halftoned algorithm is used and it is used for the gray scale image.
EMBEDDING SECRET IMAGE SHARE INTO CREATED VC COVER IMAGE
In this module the previously created visual cryptographic cover images shares is embedded i.e. merged with the secret image to get the VC shares of the secret image.
EMAILING THE EMBEDDED SHARES TO OTHER USER USING JMS
Finally the embedded share is emailed to the recipients so that they merge the two shares to get the secret image.
CONVERTING COLOR IMAGE TO BINARY j
no
start
Input image
W=width(img)H=height(img)
for I=1 to W
for J=1 o H
Value=Get Brightness(P(I,J))
If value>
122
Img(I,J)=255
Img(I,J)=0
Next J
Next I
Output img
Stop
yes
NO
ALGORITHM2: HALFTONIG PROCESS
Input : The c x d dithering matrix D and a pixel with gray-level g in input image I. Output: The halftoned pattern at the position of the pixel
For i=0 to c-1 do For j=0 to d-1 to do If g<=Dij then
print a black pixel at position (i,j); Else
print a white pixel at position (i,j);
SHARE CREATION USING HALFTONE ALGORITHM
Start
Let Img=input image
W=width(Img)H=height(Img)
Create temp(width,height)
for I=0 to H-1
For J=0 to W-1
Output Img
IfImg(I,J)<
d(i,j)
temp(JX2,IX2)=blacktemp(JX2,IX2H)=whitetemp(JX299,IX2)=white
temp(JX299,IX2H)=black
temp(JX2,IX2)=whitetemp(JX2,IX2H)=blacktemp(JX299,IX2)=black
temp(JX299,IX2H)=white
Stop
Next J
Next I
ALGORITHM 3: EMBEDDING PROCESSInput : The covering shares constructed in Section IV, the corresponding VCS with pixel expansion and the secret image .Output: The embedded shares .Step 1: Dividing the covering shares into blocks that contain sub pixels each.Step 2: Choose embedding positions in each block in the covering shares.Step 3: For each black (respectively, white) pixel in,randomly choose a share matrix (respectively).Step 4: Embed the sub pixels of each row of the share matrix into the embedding positions chosen in
Step 2.
EMBEDDING PROCESS
No
yes
Start
Input Img1,Img2
W1=width(Img1) width(Img2)H1=height(Img1)height(Img2)
If w1=w2 and
H1=H2
Output process
fails
Stop
for I=1to w-1
W=W1=W2H=H1=H2
for J=1 to H-1
Out(I,J)=Img1(I,J) or Img2(I,J)
Next J
Next I
Stop
LOGIN HOME PAGE
SNAPSHOTS
ADMIN HOME PAGE
NEW USER CREATION
EMBEDDING IMAGES
SENDING MAIL
CONCLUSION AND FUTURE SCOPE
•In this project, we proposed a construction of EVCS which was realized by embedding the random shares into the meaningful covering shares
•We show two methods to generate the covering shares, and proved the optimality on the black ratio of the threshold covering subsets.
• We also proposed a method to improve the visual quality of the share images.
•According to comparisons with many of the well-known EVCS in the literature the proposed embedded EVCS has many specific advantages against different well-known schemes, such as the fact that it can deal with gray-scale input images, has smaller pixel expansion etc.
REFERENCES[1] A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11,pp. 612–613,
[2] M. Naor and A. Shamir, “Visual cryptography,” in Proc. EUROCRYPT’94, Berlin,
Germany, 1995, vol. 950, pp. 1–12,Springer-Verlag, LNCS
[3] C. Blundo, A. De Bonis, and A. De Santis, “Improved schemes for visual
cryptography,” Designs, Codes and Cryptography, vol. 24, pp.255–278, 2001.
[4] Z.M.Wang, G. R. Arce, and G. Di Crescenzo, “Halftone visual cryptography via
error diffusion,” IEEE Trans. Inf. Forensics Security, vol.4, no. 3, pp. 383–396, Sep.
2009.