Cloud computing for agent based urban transportation system vinayss
City Engineering College Doddakallasandra, Kanakapura Road, Bangalore-560061Embedded Extended Visual Cryptography Scheme Project By:VINAY .S.S[1CE08CS109] RAKSHITH.G [1CE08CS069]SHEIK SUHEB[1CE08CS080] RAMESH .M.V[1CE09CS403] Under the guidance of Mr.GIREESH BABU C. N , Lecturer Dept. of CSE
OUTLINE• Introduction• Literature Survey• Problem Definition• Hardware and Software Requirements• Methodology• Software Testing• Implementation• Conclusion and future scope 2
INTRODUCTION 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. Example : 3
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• Data and vessel or container can have A varies possible forms, such as digital images, sound clips. Text Text audio audio images images video video• The data are encrypted and later it is embedded into vessel. 7
PROPOSED SYSTEM (CONT.)• 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. 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 andthe range of valid inputs must be specified.NON FUNCTIONAL REQUIREMENTS:•Describe user-visible aspects of the system that are not directly related with the functionalbehavior 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 systemsnumerical answers.)PSEUDO REQUIREMENTS:•The client imposes these requirements.•Typical pseudo requirements are the implementation language and the platform on which thesystem is to be implemented. 9
Monitor : 14” colorProcessor : Pentium CeleronProcessor Speed : 850 MHzMemory Size : 128MBHard Disk Drive : 40GBLAN : Connected with two SystemsOperating System : ubuntuFront End : JAVATools : Eclipse 10
SEQUENCE DIAGRAMSENDER SHARE I SHARE II RECEIVER Send PART I of Receiving PART I output file Send PART II of Receiving PART II 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 Testing Unit 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.
TEST CASESTESTCASE ID TESTCASE EXPECTED RESULT ACTUAL RESULT Enter the valid data in the User Id and User 1 Password and click on Login page should be Login page opened. login button on login display. page. Enter the invalid data in the User Id and 2 User Password and Error message should Error message is click on login button be display. display. on login page. To link to Click on 3 Add button on the Should be able to link link to add page home page. to add page. 4 To link to home page Should be able to link Link to home page. click on L icon. to home page.
TESTCASE ID TESTCASE EXPECTED ACTUAL RESULT RESULT 5 To link to Click on Should be able to link link to add page Add button on the to add page. home page. 6 Click on delete button Should be able to “Deleted successfully on the home page. message for deleting “Message is display. the data. To link to change Should be able to link Link to Change the 7 password page click to Change the password page. on Change pwd password page. button. To link to home page Should be able to link Link to home page. 8 click on L icon. to home page.
IMPLEMENTATIONModules1. ADMIN SESSION1. USER SESSION3. TESTING AND INTEGRATION
ADMIN SESSION LOGIN MODULE In this module, we design user interface design using applet frame work. The user interface should be very easy and understandable to every user. USER CREATION This 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 PASSWORD In this module the password associated with that particular user can be changed.
DIAGRAM OF ADMIN SESSION Administrator Login Create user Change password Delete user
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 start j If NO value> 122 no Input image yes Img(I,J)=0 W=width(img) Img(I,J)=255 H=height(img) Next J for I=1 to W Next I for J=1 o H Output img Value=Get Brightness(P(I,J)) Stop
ALGORITHM2: HALFTONIG PROCESSInput : 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 If Start Img(I,J)< d(i,j) Let Img=input image temp(JX2,IX2)=black temp(JX2,IX2)=white W=width(Img) temp(JX2,IX2H)=white temp(JX2,IX2H)=black H=height(Img) temp(JX299,IX2)=white temp(JX299,IX2)=black temp(JX299,IX2H)=black temp(JX299,IX2H)=white Create temp(width,height) Next J Output for I=0 to H-1 Img Next I For J=0 to W-1 Stop
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 Start for I=1to w-1 Input Img1,Img2 for J=1 to H-1W1=width(Img1) width(Img2) Out(I,J)=Img1(I,J) orH1=height(Img1)height(Img2) Img2(I,J) If w1=w2 Output Next J and No process H1=H2 fails Next I yes Stop W=W1=W2 H=H1=H2 Stop
CONCLUSION AND FUTURE SCOPE•In this project, we proposed a construction of EVCS which wasrealized by embedding the random shares into the meaningfulcovering shares•We show two methods to generate the covering shares, and provedthe optimality on the black ratio of the threshold covering subsets.• We also proposed a method to improve the visual quality of theshare images.•According to comparisons with many of the well-known EVCS inthe literature the proposed embedded EVCS has many specificadvantages against different well-known schemes, such as the factthat it can deal with gray-scale input images, has smaller pixelexpansion etc.
REFERENCES A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11,pp. 612–613, M. Naor and A. Shamir, “Visual cryptography,” in Proc. EUROCRYPT’94, Berlin,Germany, 1995, vol. 950, pp. 1–12,Springer-Verlag, LNCS C. Blundo, A. De Bonis, and A. De Santis, “Improved schemes for visualcryptography,” Designs, Codes and Cryptography, vol. 24, pp.255–278, 2001. Z.M.Wang, G. R. Arce, and G. Di Crescenzo, “Halftone visual cryptography viaerror diffusion,” IEEE Trans. Inf. Forensics Security, vol.4, no. 3, pp. 383–396, Sep.2009.