0 оценок0% нашли этот документ полезным (0 голосов)
26 просмотров5 страниц
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Оригинальное название
IEEE 2014 JAVA/.NET NETWORK SECURITY PROJECT On the Relation of Random Grid and Deterministic Visual Cryptography
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Abstract Visual Cryptography Scheme (VCS) is an encryption method used to encode secret written materials. The idea is to convert the written material into a binary image and encode this image in to n shadow image it is also called as shares of images. The decoding only requires selecting some subset of these n shadow images, maing transparencies of them and stacing them on top of each other. !ain advantage of this scheme is mathematical computation comple"ity is reduced to visual cryptographic techniques. #ach participant holds a transparency. !ost of the previous research wor on VC$s focuses on two parameters% large pi"el e"pansion and contrast. &urther, the number of sub pi"els (m) for encoding each secret pi"el, referred to as the pi"el e"pansion, is the smaller the enhanced to reduce the share si'e. The pi"el e"pansion and relative contrast are the most critical measurements to evaluate the effectiveness of a VCS. (n this paper, we studied the in VC in addition to )eterministic Visual Cryptography ()VCS) can achieve the minimum pi"el e"pansion and the ma"imal contrasts. GLOBALSOFT TECHNOLOGIES IEEE PROJECTS & SOFTWARE DEVELOPMENTS IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS CELL: +91 9!9" #9$"% +91 99&&' #"(% +91 9!9" "(9$% +91 9($1! !$!$1 V)*)+: ,,,-.)/012304546738+*-649 M0)1 +6:)333.)/01*3:546738+*;9:0)1-86: GLOBALSOFT TECHNOLOGIES IEEE PROJECTS & SOFTWARE DEVELOPMENTS IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS CELL: +91 9!9" #9$"% +91 99&&' #"(% +91 9!9" "(9$% +91 9($1! !$!$1 V)*)+: ,,,-.)/012304546738+*-649 M0)1 +6:)333.)/01*3:546738+*;9:0)1-86: *e develop a novel and efficient construction for +andom ,rid and )VCS in this paper. The proposed Visual Cryptograms of +andom ,rids model and deterministic model aims at the minimi'ation of the pi"el e"pansion and ma"imal contrasts for individual a VC. The #"perimental results demonstrate the feasibility, applicability, and fle"ibility of our construction. The pi"el e"pansions and contrasts derived from our scheme are also better than the previous results. Existing system: )ata security has been a challenging tas in visual cryptography system and database systems. The e"isting visual cryptography schemes that are used for data hiding have a security hole in the encrypted Share file. #ach participant holds a transparency. !ost of the previous research wor on VC$s focuses on two parameters% large pi"el e"pansion and contrast. The pi"el e"pansion and relative contrast are the most critical measurements to evaluate the effectiveness of a VCS. Disadvantages of Existing System: The e"isting system does not provide a friendly environment to encrypt or decrypt the data (images). The e"isting system supports with only one type of image format only. &or e"ample, if it is .-pg, then it supports only that same ind of image format only. Proposed system: We are able to improve several schemes and to provide many upper bounds for the random grid model and by exploiting some results known for the random grid model we are also able to provide new schemes for the deterministic model! The pi"el e"pansions and contrasts derived from our scheme are also better than the previous results. &irst, an image is split into .n/ encrypted shares using algorithm by the fact that a pi"el can be split into sub pi"els. Second, in order to avoid hacing of shared image, we employ password protection for each share using embedded algorithm and simple 0rithmetic #ncoding compression technique which compresses the pass code. Third, we perform rearranging of pi"els of shared image by overlaying process to obtain the access to the protected data$s. SOFTWARE REQ!RE"E#TS 1latform % 20V0 (2)3 4.5) &ront #nd % 20V0 Swing ()# % 6#T7#06S 8.9 :perating System % !icrosoft *indows ;<<< or =1