Viscrypt
2021年10月24日Download here: http://gg.gg/wb2kb
In our implementation, we have taken (2,2) viscrypt scheme i.e., there will be two share-holders and both two of them will participate in stacking, as u know. To do automated verification, we have defined the options called flag1 and flag2 will be enabled after verification only. 11 Aug 2009: 1.1.0.0: The first two columns of the share were always ’0’ in the previous release. The file ’VisCrypt.m’ has been updated to fix this issue.
*
Password protect, lock and hide folders or directories and their subdirectories and files on your PC. Encrypt files with BLOWFISH, CryptAPI. Hide messages in photograph. Stealth email. Encryptpassword files and bank. File splitijng.
*File Name:PalmTree.zip
*Author:SecureKit, Inc.
*License:Shareware ($30.00)
*File Size:1.66 Mb
*Runs on:9x, NT, 2000, ME, XP
*
The Smart ZIP ActiveX 1.0.1 is an activex component for software developers that can compress and extract files and folders into and from zip files. You can compress the files and the folders to a zip file with encryptpassword, get the process and. ..
*File Name:smart-zip-activex.exe
*Author:smart-activex.com
*License:Shareware ($89.00)
*File Size:236 Kb
*Runs on:Win95, Win98, WinME, WinNT 3.x, WinNT 4.x, Windows2000, WinXP, Windows2003, WinME, W
*
This app helps you to encrypt/ password protect your files using AES Algo.
The encrypted file is stored as output.txt
The key should be of exactly 16 characters.
*File Name:SecureFileAES
*Author:Kush Jain
*License:Freeware (Free)
*File Size:
*Runs on:Windows
*
Encrypt my FolderTM is a new Folder Password protected software which can help you lock your files, folders with your personal password. Prevent people from viewing, editing, altering your folders as easy as 1-2-3. Locking files, folders, and drives is the best way to guarantee that nobody accidentally or intentionally gets access to your private and confidential information.
*File Name:encryptmyfolder.exe
*Author:QKsoft Inc.
*License:Shareware ($)
*File Size:1.49 Mb
*Runs on:WinXP, Win2003, Win2000
*
Odin Password Secure Manager is a passwordstorage program that will relieve you of the password management chore while offering you complete security and peace of mind. Your precious information is stored as encrypted data that only you can access.
*File Name:OdinPasswordSecureManager.exe
*Author:Odin Share Company
*License:Shareware ($28.88)
*File Size:1.55 Mb
*Runs on:WinXP, WinVista, Win7 x32, Windows2003, Win98, WinME
*
KeePass is a free open source password manager, which helps you to manage your passwords in a secure way. You can put all your passwords in one database, which is locked with one master key or a key file. So you only have to remember one single. ..
*File Name:KeePass-2.17.zip
*Author:Dominik Reichl
*License:Freeware (Free)
*File Size:1.98 Mb
*Runs on:Win95, Win98, WinME, Windows2000, Windows2003, WinNT 4.0, WinXP, Windows Vista, Windows 7, Windows 7 x64
*
When a PC/laptop needs to be repaired or given to a stranger,Cryptic Disk is a secure and easy tool to encrypt and password protect a disk/partition where confidential and private files will be stored.They can’t be accessed without a valid password. ..
*File Name:crdisksetup.zip
*Author:EXLADE, Inc.
*License:Shareware ($49.95)
*File Size:2.55 Mb
*Runs on:WinXP, Windows2000, Windows2003, Windows Vista
*
The popular award-winning choice for password-protecting files, folders and drives on Windows!It’s really easy to hide, encrypt and password protect data with CryptArchiver.All you do is drag-and-drop your important files and folders into an. ..
*File Name:calite.exe
*Author:WinEncrypt EncryptionSoftware and SecuritySolutions
*License:Shareware ($25.00)
*File Size:1.5 Mb
*Runs on:Windows All
*
CryptoExpert creates new virtual hard drives that appears to applications like any other physical hard drive. Any data that the user attempts to write to this drive is intercepted and encrypted by CryptoExpert. Drive is invisible without password.
*File Name:cryptoexpert2010pro.msi
*Author:InterCrypto Ltd
*License:Shareware ($59.95)
*File Size:7.2 Mb
*Runs on:WinXP, Win7 x32, Win7 x64, Windows2000, Windows2003, Windows Vista
*
Gili CD DVD Encryption can enhance the safety performance of regular burning software. With it’s help, your burning software can burn password-protected encrypted discs. It supports almost all of the burning software, if you have a recorder and a. ..
*File Name:cd-dvd-encryption30.exe
*Author:GiliSoft Inc
*License:Shareware ($39.95)
*File Size:
*Runs on:Windows2000, Windows2003, WinXP, Windows Vista, Windows 7, Windows 7 x64
*
visCrypt is a program for your Pocket PC to encrypt and decrypt any files and documents. You can secure any documents in the internal memory and on memory cards comfortably with visCrypt.
*File Name:visCryptSetupEnglish.exe
*Author:SFR GmbH
*License:Commercial ($9.95)
*File Size:
*Runs on:Windows Mobile 2003, Windows Mobile 2005
*
Protectorion Universal Encryption Suite is a handy and reliable tool designed to encrypt data and passwords on your PCs as well as on cloud, network and flash drives. For single users and secure collaboration within teams and companies (multi-user).
*File Name:ProtectorionES_Setup_EN.msi
*Author:Protectorion UniversalEncryption Suite
*License:Shareware ($34.90)
*File Size:3.94 Mb
*Runs on:WinXP, WinVista, WinVista x64, Win7 x32, Win7 x64
*Linear Feedback Shift Register(LFSR). These operations are. 1. The content of stage 1 is output and forms part of the output sequence, represented as O(LFSR).
*This is ’9 pin Viscrypt’ by Derek Frech on Vimeo, the home for high quality videos and the people who love them.
Related:Encrypt Password - Password Encrypt - Encrypt Password Exe - Encrypt Folders Password - Android Password Encrypt
Pages : 1 | 2 | 3>
International Journal of Scientific & Engineering Research Volume 4, Issue3, March-2013 1
ISSN 2229-5518
1R.Yadagiri Rao
Assoc. Professor, Dept of CSE,
1RVR Institute of Engineering & Technology, Ibrahimpatnam. R.R.District, AP.
2R Swetha and 3Paritala Ramanjaneyulu
Students of M.Tech (Computer Science)
2RVR Institute of Engineering & Technology, Ibrahimpatnam R.R.District, AP.
Abstract: - An effective and secure protection of sensitive information is the primary concerned in Communication systems or network storage systems. Never the less, it is also important for any information process to ensure data is not being tampered with. Encryption methods are one of the popular approaches to ensure the integrity and confidentiality of the protected information. However one of the critical vulnerabilities of encryption techniques is protecting the information from being exposed. To address these reliability problems, especially for large information content items such as secret images (satellite photos or medical images), an image secret sharing schemes (SSS) is a good alternative to remedy these types of vulnerabilities. With the rapid advancement of network technology, multimedia information is transmitted over the Internet conveniently. While using secret images, security issues should be taken into consideration because hackers may utilize weak link over communication network to steal information that they want. To deal with the security problems of secret images, various image secret sharing schemes have been developed.
Because of the popular usage of images in network application in recent years, the way of sharing secret image has attracted wide attention. Naor and Shamir proposed first the idea of visual cryptography in 1994. The scheme provides an easy and fast decryption process that consists of Xeroxing the shares onto transparencies and then stacking them to reveal the shared image for visual inspection. The scheme which differs from traditional secret sharing does not need complicated cryptographic mechanisms and computations. Instead it can be done directly by the human visual system, without the aid of computers. However the generated noisy share may be suspicious to invaders and their scheme had 2n pixel expansion at best case. Visual cryptography scheme eliminates complex computation problem in decryption process, and the secret images can be restored by stacking operation. This property makes visual cryptography especially useful for the low computation load requirement.
Iwamoto and Yamamoto in 2002, worked on an n-out-of-n visual secret sharing scheme for gray-scale images. They developed a secret sharing scheme that encodes gray-scale images with a limited number of gray levels. The loss in the contrast is so large such that the recovered image is distorted. In other methods that construct a visual secret sharing scheme with a general access structure for plural secret images have been proposed .They have shown that most previous work of visual cryptography scheme for plural image suffered from the leak out of some information in each share about the other secret images of the scheme. The systems suffered from the deterioration of the image quality in addition to the weakness in the security
IJSER © 2013 http://www.ijser.org
International Journal of Scientific & Engineering Research Volume 4, Issue3, March-2013 2Viscript
ISSN 2229-5518
and there are pixels expansion step in all of method so needed some computation must be applied to reproduce the secret image.
Taking limited bandwidth and storage into consideration two criteria pixel expansion and number of shares encoded is of significance. Smaller pixel expansion results in smaller size of the share. Encoding multiple secret images into the same share images requires less overhead while sharing multiple secrets. Meaningful shares avoid attention of hacker considering the security issues over the communication channels. To meet the demand of today’s multimedia information gray and color image format should be encoded by the schemes.Key Words: - Security, Secret sharing and Visual Cryptography.1. Existing System
In the existing system the dealer or sender takes a secret image and encodes into shares. After encoding this shares are sent to participants. The receiver collects the shares and stack to get decoded secret image. Here no verification is done so easy cheating is done.
Fig. 1. Alignment by Using Visual Cryptography
2. Proposed System
In the proposed system the dealer or sender takes one secret image and verification image. These two images are encoded into shares, after encoding sends one secret share and one verification share to the participants. Each participant verifies the share and other participant secret share reveals the secret image. In this way cheating is avoided.
IJSER © 2013 http://www.ijser.orgVi Scripting
International Journal of Scientific & Engineering Research Volume 4, Issue3, March-2013 3
ISSN 2229-5518Fig. 2. Alignment by Secure Visual Cryptography3. Basic idea of proposed SystemHistory:
Wu and Chen were first researchers to present the visual cryptography schemes to share two secret images in two shares. They hidden two secret binary images into two random shares, namely A and B, such that the first secret can be seen by stacking the two shares, denoted by
A⊗ B, and the second secret can be obtained by first rotating A Ө anti-clockwise. They
designed the rotation angle Ө to be 90◦. However, it is easy to obtain that Ө can be 180◦ or 270◦.
To overcome the angle restriction of Wu and Chen’s scheme, Hsu et al. proposed a scheme to
hide two secret images in two rectangular share images with arbitrary rotating angles. Wu and Chang also refined the idea of Wu and Chen by encoding shares to be circles so that the restrictions to the rotating angles (Ө = 90◦, 180◦ or 270◦) can be removed.
In 1994 the basic problem of visual cryptography was introduced by Naor and Shamir. In visual cryptography we are dealing with the problem of encrypting pictures in a secure way such that the decryption can be done by the human visual system. The encryption of a secret image is achieved by encoding the information into several shadow images, called shares. The decoding is done by printing the shares on transparencies and stacking them. The system can be used by everyone without any knowledge of cryptography and without performing cryptographic computations. This is the major difference to usual cryptography schemes. This is the major difference to usual cryptography schemes where the secret information, represented as numbers, is encrypted by using one-way functions. The decryption can only be done if one knows the appropriate secret key. Naor and Shamir have described a k out of n (with k<=n) system where the secret is encoded in n shares and the decoding can be done by stacking k or more transparencies. Using less than k transparencies won’t reveal the secret not even to an infinitely powerful cryptanalyst.
In general it is possible that k and n are reasonably big numbers. In order to reveal the secret information it is necessary to have at least k people stack their shares together. Since k can
IJSER © 2013 http://www.ijser.org
International Journal of Scientific & Engineering Research Volume 4, Issue3, March-2013 4
ISSN 2229-5518
be reasonably big, it might be very unlikely to find a coalition of at least k traitors who will be willing to misuse their shares, in general one share-holder might not even know k-1 other share- holders. Obviously, it is much easier to find 0<t<k traitors who are looking for a way to sabotage the system. We assume that t<k share-holders stack their shares together and publish the information so that other small groups of less than k people can stack their shares on top of the published information and will therefore be able to reveal the actual secret. (It is possible to iterate the scenario in such a way that at first the information of t then t+t’ shares etc. gets published.) Since there is no way in keeping t people from publishing the accumulated information we are looking for a possibility to trace the traitors.
S J Shyu et al were first researchers to advise the multiple secrets sharing in visual cryptography. This scheme encodes a set of n ≥ 2 secrets into two circle shares. The n secrets can be obtained one by one by stacking the first share and the rotated second shares with n different rotation angles. To encode unlimited shapes of image and to remove the limitation of transparencies to be circular, Fang offered reversible visual cryptography scheme. In this scheme two secret images which are encoded into two shares; one secret image appears with just stacking two shares and the other secret image appears with stack two shares after reversing one of them. Jen-Bang Feng et al developed a visual secret sharing scheme for hiding multiple secret images into two shares. The proposed scheme analyzes the secret pixels and the corresponding share blocks to construct a stacking relationship graph, in which the vertices denote the share blocks and the edges denote two blocks stacked together at the desired decryption angle. According to this graph and the pre-defined visual pattern set, two shares are generated.
To provide more randomness for generating the shares Mustafa Ulutas et al advised secret sharing scheme based on the rotation of shares. In this scheme shares are rectangular in shape and are created in a fully random manner. Stacking the two shares reconstructs the first secret. Rotating the first share by 90° counterclockwise and stacking it with the second share reconstructs the second secret.
Tzung-Her Chen et al offered the multiple image encryption schemes by rotating random grids, without any pixel expansion and codebook redesign. A non-expansion reversible visual secret sharing method that does not need to define the lookup table offered by Fang. To encode four secrets into two shares and recovering the reconstructed images without distortions Zhengxin Fu et al intended a rotation visual cryptography scheme. Rotation visual cryptography scheme construction was based on correlative matrices set and random permutation, which can be used to encode four secret images into two shares. Jonathan Weir et al suggested sharing multiple secrets using visual cryptography. A master key is generated for all the secrets; correspondingly, secrets are shared using the master key and multiple shares are obtained.4. Black and White Images:
Visual cryptographic solutions operate on binary or binarized inputs. Therefore, natural (continuous-tone) images must be first converted into halftone images by using the density of the net dots to simulate the original gray or color levels in the target binary representation. Then, the halftone version of the input image is used instead of the original secret image to produce the shares. The decrypted image is obtained by stacking the shares together. Because binary data can
IJSER © 2013 http://www.ijser.org
International Journal of Scientific & Engineering Research Volume 4, Issue3, March-2013 5
ISSN 2229-5518
be displayed either as frosted or transparent when printed on transparencies or viewed on the screen, overlapping shares that contain seemingly random information can reveal the secret image without additional computations or any knowledge of cryptographic keys.
However, due to the nature of the algorithm, the decrypted image is darker, contains a number of visual impairments, and most of visual cryptography solutions increase the spatial resolution of the secret image. In addition, the requirement for inputs of the binary or dithered nature only limits the applicability of visual cryptography.
Most of the existing secret sharing schemes are generalized within the so-called {k,n}- threshold framework that confidentially divides the content of a secret message into n shares in the way that requires the presence of at least k, for k≤n, shares for the secret message reconstruction, Thus, the framework can use any of n!/(k!(n−k)!) possible combinations of k shares to recover the secret message, whereas the use of k−1 or less shares should not reveal the secret message.
Use of digital media has exploded in the past few years, primarily due to several distinct
advantages that digital media can offer over analog media. These advantages include higher quality, easier editing, perfect copying and easier and more efficient transmission over information network. The wide dissemination of digital media also creates some potential problems. Due to the popularity of Internet commerce and digital library applications, the intellectual property right (IPR) protection is becoming increasingly important. Content providers will be reluctant to provide their valuable contents if they are not assured that their contents are securely protected. Some good examples are the deployments of the digital versatile disk (DVD) market and the online music market.
Fig. 3. VCS and the structures of sub-pixels
IJSER © 2013 http://www.ijser.org
Inte
https://diarynote.indered.space
In our implementation, we have taken (2,2) viscrypt scheme i.e., there will be two share-holders and both two of them will participate in stacking, as u know. To do automated verification, we have defined the options called flag1 and flag2 will be enabled after verification only. 11 Aug 2009: 1.1.0.0: The first two columns of the share were always ’0’ in the previous release. The file ’VisCrypt.m’ has been updated to fix this issue.
*
Password protect, lock and hide folders or directories and their subdirectories and files on your PC. Encrypt files with BLOWFISH, CryptAPI. Hide messages in photograph. Stealth email. Encryptpassword files and bank. File splitijng.
*File Name:PalmTree.zip
*Author:SecureKit, Inc.
*License:Shareware ($30.00)
*File Size:1.66 Mb
*Runs on:9x, NT, 2000, ME, XP
*
The Smart ZIP ActiveX 1.0.1 is an activex component for software developers that can compress and extract files and folders into and from zip files. You can compress the files and the folders to a zip file with encryptpassword, get the process and. ..
*File Name:smart-zip-activex.exe
*Author:smart-activex.com
*License:Shareware ($89.00)
*File Size:236 Kb
*Runs on:Win95, Win98, WinME, WinNT 3.x, WinNT 4.x, Windows2000, WinXP, Windows2003, WinME, W
*
This app helps you to encrypt/ password protect your files using AES Algo.
The encrypted file is stored as output.txt
The key should be of exactly 16 characters.
*File Name:SecureFileAES
*Author:Kush Jain
*License:Freeware (Free)
*File Size:
*Runs on:Windows
*
Encrypt my FolderTM is a new Folder Password protected software which can help you lock your files, folders with your personal password. Prevent people from viewing, editing, altering your folders as easy as 1-2-3. Locking files, folders, and drives is the best way to guarantee that nobody accidentally or intentionally gets access to your private and confidential information.
*File Name:encryptmyfolder.exe
*Author:QKsoft Inc.
*License:Shareware ($)
*File Size:1.49 Mb
*Runs on:WinXP, Win2003, Win2000
*
Odin Password Secure Manager is a passwordstorage program that will relieve you of the password management chore while offering you complete security and peace of mind. Your precious information is stored as encrypted data that only you can access.
*File Name:OdinPasswordSecureManager.exe
*Author:Odin Share Company
*License:Shareware ($28.88)
*File Size:1.55 Mb
*Runs on:WinXP, WinVista, Win7 x32, Windows2003, Win98, WinME
*
KeePass is a free open source password manager, which helps you to manage your passwords in a secure way. You can put all your passwords in one database, which is locked with one master key or a key file. So you only have to remember one single. ..
*File Name:KeePass-2.17.zip
*Author:Dominik Reichl
*License:Freeware (Free)
*File Size:1.98 Mb
*Runs on:Win95, Win98, WinME, Windows2000, Windows2003, WinNT 4.0, WinXP, Windows Vista, Windows 7, Windows 7 x64
*
When a PC/laptop needs to be repaired or given to a stranger,Cryptic Disk is a secure and easy tool to encrypt and password protect a disk/partition where confidential and private files will be stored.They can’t be accessed without a valid password. ..
*File Name:crdisksetup.zip
*Author:EXLADE, Inc.
*License:Shareware ($49.95)
*File Size:2.55 Mb
*Runs on:WinXP, Windows2000, Windows2003, Windows Vista
*
The popular award-winning choice for password-protecting files, folders and drives on Windows!It’s really easy to hide, encrypt and password protect data with CryptArchiver.All you do is drag-and-drop your important files and folders into an. ..
*File Name:calite.exe
*Author:WinEncrypt EncryptionSoftware and SecuritySolutions
*License:Shareware ($25.00)
*File Size:1.5 Mb
*Runs on:Windows All
*
CryptoExpert creates new virtual hard drives that appears to applications like any other physical hard drive. Any data that the user attempts to write to this drive is intercepted and encrypted by CryptoExpert. Drive is invisible without password.
*File Name:cryptoexpert2010pro.msi
*Author:InterCrypto Ltd
*License:Shareware ($59.95)
*File Size:7.2 Mb
*Runs on:WinXP, Win7 x32, Win7 x64, Windows2000, Windows2003, Windows Vista
*
Gili CD DVD Encryption can enhance the safety performance of regular burning software. With it’s help, your burning software can burn password-protected encrypted discs. It supports almost all of the burning software, if you have a recorder and a. ..
*File Name:cd-dvd-encryption30.exe
*Author:GiliSoft Inc
*License:Shareware ($39.95)
*File Size:
*Runs on:Windows2000, Windows2003, WinXP, Windows Vista, Windows 7, Windows 7 x64
*
visCrypt is a program for your Pocket PC to encrypt and decrypt any files and documents. You can secure any documents in the internal memory and on memory cards comfortably with visCrypt.
*File Name:visCryptSetupEnglish.exe
*Author:SFR GmbH
*License:Commercial ($9.95)
*File Size:
*Runs on:Windows Mobile 2003, Windows Mobile 2005
*
Protectorion Universal Encryption Suite is a handy and reliable tool designed to encrypt data and passwords on your PCs as well as on cloud, network and flash drives. For single users and secure collaboration within teams and companies (multi-user).
*File Name:ProtectorionES_Setup_EN.msi
*Author:Protectorion UniversalEncryption Suite
*License:Shareware ($34.90)
*File Size:3.94 Mb
*Runs on:WinXP, WinVista, WinVista x64, Win7 x32, Win7 x64
*Linear Feedback Shift Register(LFSR). These operations are. 1. The content of stage 1 is output and forms part of the output sequence, represented as O(LFSR).
*This is ’9 pin Viscrypt’ by Derek Frech on Vimeo, the home for high quality videos and the people who love them.
Related:Encrypt Password - Password Encrypt - Encrypt Password Exe - Encrypt Folders Password - Android Password Encrypt
Pages : 1 | 2 | 3>
International Journal of Scientific & Engineering Research Volume 4, Issue3, March-2013 1
ISSN 2229-5518
1R.Yadagiri Rao
Assoc. Professor, Dept of CSE,
1RVR Institute of Engineering & Technology, Ibrahimpatnam. R.R.District, AP.
2R Swetha and 3Paritala Ramanjaneyulu
Students of M.Tech (Computer Science)
2RVR Institute of Engineering & Technology, Ibrahimpatnam R.R.District, AP.
Abstract: - An effective and secure protection of sensitive information is the primary concerned in Communication systems or network storage systems. Never the less, it is also important for any information process to ensure data is not being tampered with. Encryption methods are one of the popular approaches to ensure the integrity and confidentiality of the protected information. However one of the critical vulnerabilities of encryption techniques is protecting the information from being exposed. To address these reliability problems, especially for large information content items such as secret images (satellite photos or medical images), an image secret sharing schemes (SSS) is a good alternative to remedy these types of vulnerabilities. With the rapid advancement of network technology, multimedia information is transmitted over the Internet conveniently. While using secret images, security issues should be taken into consideration because hackers may utilize weak link over communication network to steal information that they want. To deal with the security problems of secret images, various image secret sharing schemes have been developed.
Because of the popular usage of images in network application in recent years, the way of sharing secret image has attracted wide attention. Naor and Shamir proposed first the idea of visual cryptography in 1994. The scheme provides an easy and fast decryption process that consists of Xeroxing the shares onto transparencies and then stacking them to reveal the shared image for visual inspection. The scheme which differs from traditional secret sharing does not need complicated cryptographic mechanisms and computations. Instead it can be done directly by the human visual system, without the aid of computers. However the generated noisy share may be suspicious to invaders and their scheme had 2n pixel expansion at best case. Visual cryptography scheme eliminates complex computation problem in decryption process, and the secret images can be restored by stacking operation. This property makes visual cryptography especially useful for the low computation load requirement.
Iwamoto and Yamamoto in 2002, worked on an n-out-of-n visual secret sharing scheme for gray-scale images. They developed a secret sharing scheme that encodes gray-scale images with a limited number of gray levels. The loss in the contrast is so large such that the recovered image is distorted. In other methods that construct a visual secret sharing scheme with a general access structure for plural secret images have been proposed .They have shown that most previous work of visual cryptography scheme for plural image suffered from the leak out of some information in each share about the other secret images of the scheme. The systems suffered from the deterioration of the image quality in addition to the weakness in the security
IJSER © 2013 http://www.ijser.org
International Journal of Scientific & Engineering Research Volume 4, Issue3, March-2013 2Viscript
ISSN 2229-5518
and there are pixels expansion step in all of method so needed some computation must be applied to reproduce the secret image.
Taking limited bandwidth and storage into consideration two criteria pixel expansion and number of shares encoded is of significance. Smaller pixel expansion results in smaller size of the share. Encoding multiple secret images into the same share images requires less overhead while sharing multiple secrets. Meaningful shares avoid attention of hacker considering the security issues over the communication channels. To meet the demand of today’s multimedia information gray and color image format should be encoded by the schemes.Key Words: - Security, Secret sharing and Visual Cryptography.1. Existing System
In the existing system the dealer or sender takes a secret image and encodes into shares. After encoding this shares are sent to participants. The receiver collects the shares and stack to get decoded secret image. Here no verification is done so easy cheating is done.
Fig. 1. Alignment by Using Visual Cryptography
2. Proposed System
In the proposed system the dealer or sender takes one secret image and verification image. These two images are encoded into shares, after encoding sends one secret share and one verification share to the participants. Each participant verifies the share and other participant secret share reveals the secret image. In this way cheating is avoided.
IJSER © 2013 http://www.ijser.orgVi Scripting
International Journal of Scientific & Engineering Research Volume 4, Issue3, March-2013 3
ISSN 2229-5518Fig. 2. Alignment by Secure Visual Cryptography3. Basic idea of proposed SystemHistory:
Wu and Chen were first researchers to present the visual cryptography schemes to share two secret images in two shares. They hidden two secret binary images into two random shares, namely A and B, such that the first secret can be seen by stacking the two shares, denoted by
A⊗ B, and the second secret can be obtained by first rotating A Ө anti-clockwise. They
designed the rotation angle Ө to be 90◦. However, it is easy to obtain that Ө can be 180◦ or 270◦.
To overcome the angle restriction of Wu and Chen’s scheme, Hsu et al. proposed a scheme to
hide two secret images in two rectangular share images with arbitrary rotating angles. Wu and Chang also refined the idea of Wu and Chen by encoding shares to be circles so that the restrictions to the rotating angles (Ө = 90◦, 180◦ or 270◦) can be removed.
In 1994 the basic problem of visual cryptography was introduced by Naor and Shamir. In visual cryptography we are dealing with the problem of encrypting pictures in a secure way such that the decryption can be done by the human visual system. The encryption of a secret image is achieved by encoding the information into several shadow images, called shares. The decoding is done by printing the shares on transparencies and stacking them. The system can be used by everyone without any knowledge of cryptography and without performing cryptographic computations. This is the major difference to usual cryptography schemes. This is the major difference to usual cryptography schemes where the secret information, represented as numbers, is encrypted by using one-way functions. The decryption can only be done if one knows the appropriate secret key. Naor and Shamir have described a k out of n (with k<=n) system where the secret is encoded in n shares and the decoding can be done by stacking k or more transparencies. Using less than k transparencies won’t reveal the secret not even to an infinitely powerful cryptanalyst.
In general it is possible that k and n are reasonably big numbers. In order to reveal the secret information it is necessary to have at least k people stack their shares together. Since k can
IJSER © 2013 http://www.ijser.org
International Journal of Scientific & Engineering Research Volume 4, Issue3, March-2013 4
ISSN 2229-5518
be reasonably big, it might be very unlikely to find a coalition of at least k traitors who will be willing to misuse their shares, in general one share-holder might not even know k-1 other share- holders. Obviously, it is much easier to find 0<t<k traitors who are looking for a way to sabotage the system. We assume that t<k share-holders stack their shares together and publish the information so that other small groups of less than k people can stack their shares on top of the published information and will therefore be able to reveal the actual secret. (It is possible to iterate the scenario in such a way that at first the information of t then t+t’ shares etc. gets published.) Since there is no way in keeping t people from publishing the accumulated information we are looking for a possibility to trace the traitors.
S J Shyu et al were first researchers to advise the multiple secrets sharing in visual cryptography. This scheme encodes a set of n ≥ 2 secrets into two circle shares. The n secrets can be obtained one by one by stacking the first share and the rotated second shares with n different rotation angles. To encode unlimited shapes of image and to remove the limitation of transparencies to be circular, Fang offered reversible visual cryptography scheme. In this scheme two secret images which are encoded into two shares; one secret image appears with just stacking two shares and the other secret image appears with stack two shares after reversing one of them. Jen-Bang Feng et al developed a visual secret sharing scheme for hiding multiple secret images into two shares. The proposed scheme analyzes the secret pixels and the corresponding share blocks to construct a stacking relationship graph, in which the vertices denote the share blocks and the edges denote two blocks stacked together at the desired decryption angle. According to this graph and the pre-defined visual pattern set, two shares are generated.
To provide more randomness for generating the shares Mustafa Ulutas et al advised secret sharing scheme based on the rotation of shares. In this scheme shares are rectangular in shape and are created in a fully random manner. Stacking the two shares reconstructs the first secret. Rotating the first share by 90° counterclockwise and stacking it with the second share reconstructs the second secret.
Tzung-Her Chen et al offered the multiple image encryption schemes by rotating random grids, without any pixel expansion and codebook redesign. A non-expansion reversible visual secret sharing method that does not need to define the lookup table offered by Fang. To encode four secrets into two shares and recovering the reconstructed images without distortions Zhengxin Fu et al intended a rotation visual cryptography scheme. Rotation visual cryptography scheme construction was based on correlative matrices set and random permutation, which can be used to encode four secret images into two shares. Jonathan Weir et al suggested sharing multiple secrets using visual cryptography. A master key is generated for all the secrets; correspondingly, secrets are shared using the master key and multiple shares are obtained.4. Black and White Images:
Visual cryptographic solutions operate on binary or binarized inputs. Therefore, natural (continuous-tone) images must be first converted into halftone images by using the density of the net dots to simulate the original gray or color levels in the target binary representation. Then, the halftone version of the input image is used instead of the original secret image to produce the shares. The decrypted image is obtained by stacking the shares together. Because binary data can
IJSER © 2013 http://www.ijser.org
International Journal of Scientific & Engineering Research Volume 4, Issue3, March-2013 5
ISSN 2229-5518
be displayed either as frosted or transparent when printed on transparencies or viewed on the screen, overlapping shares that contain seemingly random information can reveal the secret image without additional computations or any knowledge of cryptographic keys.
However, due to the nature of the algorithm, the decrypted image is darker, contains a number of visual impairments, and most of visual cryptography solutions increase the spatial resolution of the secret image. In addition, the requirement for inputs of the binary or dithered nature only limits the applicability of visual cryptography.
Most of the existing secret sharing schemes are generalized within the so-called {k,n}- threshold framework that confidentially divides the content of a secret message into n shares in the way that requires the presence of at least k, for k≤n, shares for the secret message reconstruction, Thus, the framework can use any of n!/(k!(n−k)!) possible combinations of k shares to recover the secret message, whereas the use of k−1 or less shares should not reveal the secret message.
Use of digital media has exploded in the past few years, primarily due to several distinct
advantages that digital media can offer over analog media. These advantages include higher quality, easier editing, perfect copying and easier and more efficient transmission over information network. The wide dissemination of digital media also creates some potential problems. Due to the popularity of Internet commerce and digital library applications, the intellectual property right (IPR) protection is becoming increasingly important. Content providers will be reluctant to provide their valuable contents if they are not assured that their contents are securely protected. Some good examples are the deployments of the digital versatile disk (DVD) market and the online music market.
Fig. 3. VCS and the structures of sub-pixels
IJSER © 2013 http://www.ijser.org
Inte
https://diarynote.indered.space
コメント