scispace - formally typeset
Search or ask a question
Topic

Visual cryptography

About: Visual cryptography is a research topic. Over the lifetime, 1724 publications have been published within this topic receiving 25300 citations.


Papers
More filters
01 Jan 2013
TL;DR: This project is proposing a new approach named as “Image Captcha Based Authentication Using Visual Cryptography" to solve the problem of phishing.
Abstract: Anti-phishing mechanisms in the websites currently focus on helping users to verify whether a web site is genuine or not. Phishing on the web pages is an attempt by an individual or a group to threats/hackers trying to retrieve an individual’s personal confidential information such as passwords, usernames/confidential info, credit card information etc. In this project, we are proposing a new approach named as “Image Captcha Based Authentication Using Visual Cryptography" to solve the problem of phishing. Textual keyword validation along with visual cryptography is a major advantage of this project. To increase more security “Blowfish Algorithm” can be used to divide the original image captcha into many blocks and rearrangement can be done. Then “Splitting and Rotating Algorithm” can be used to rotate the rearranged blocks. The use of visual cryptography technique((2,2) VCS scheme) is explored to preserve the privacy of image captcha by degenerating the original image captcha into two different image shares by manipulating the black and white pixel value of the image captcha. Part of the image share will be stored in the servers such that the original image captcha can be revealed only when both (client,server) of the shares are simultaneously available. The individual share images do not reveal the identity of the original image captcha. Once the original image captcha is revealed after merging different shares, which can be used as the password. Dynamically generating the Captcha image by the system is one of the major advantage of the system.

2 citations

Proceedings ArticleDOI
01 Dec 2017
TL;DR: The proposed Embedded Visual Cryptography Scheme (EVCS) uses gray threshold with morphological operation for secure transmission of bank cheque over the network and shows the high performance in terms PSNR, UQI and MSE for secure transmitters over network.
Abstract: Today, banking system has carried banking for the customer's expediency, supporting set of services, where authentication plays a vital role. Due to the fabulous apprehension and growth in the field of hacking, that it is not safe to rely on web to accumulate all the information. So in order to beat this problem we have proposed an efficient algorithm for secured bank cheque authentication by Embedded image Cryptography scheme. It is a cryptographic approach that uses visual information as input, encryption and decryption is done by using human visual system. The proposed method Embedded Visual Cryptography Scheme (EVCS) uses gray threshold with morphological operation for secure transmission of bank cheque over the network. In this approach first apply gray threshold with morphological operation and divide the input image into different number of secret share images using traditional visual cryptography technique. Embed the each share into different cover images. Finally, stack the embedded images to get the original information of images. The performance of proposed method is calculated by using PSNR, UQI and MSE Value. The proposed EVCS shows the high performance in terms PSNR, UQI and MSE for secure transmission of bank cheque over network.

2 citations

Book ChapterDOI
18 Dec 2013
TL;DR: A new Extended RIVC scheme is proposed which uses the characteristics of both RIVCS and Extended VCS which adds a meaningful cover image to the shares which solves all the above mentioned drawbacks of the existing schemes.
Abstract: Region Incrementing Visual Cryptography (RIVC) is an important and active research area. In (2, n) region incrementing visual cryptographic scheme, a single secret image is divided into multiple secret regions. We need at least 2 secret shares to be superimposed to reveal the 1st secret region. By stacking more and more shares we get the entire image revealed. All the existing schemes for RIVCS suffer from the problems like color reversal, pixel expansion and low contrast. Also conventional RIVCS schemes generate noise like shares. The management of these shares is also problem, as there is no way to identify these shares. Thus we are proposing a new Extended RIVC scheme which uses the characteristics of both RIVCS and Extended VCS which adds a meaningful cover image to the shares. Our proposed method solves all the above mentioned drawbacks of the existing schemes. The main contributions in this paper are: a) No pixel expansion b)Meaningful share images c)Increased contrast d) No color reversal e) Improved Security.

2 citations

01 Jan 2014
TL;DR: This paper proposes a technique of encode the password of a customer by improved Steganography, which is able to utilize at most all eight adjacent neighbors so that imperceptibility value grows bigger.
Abstract: Core banking is a set of services provided by a group of networked bank branches. Bank customers may access their funds and perform other simple transactions from any of the member branch offices. The major issue in core banking is the authenticity of the customer. Due to unavoidable hackingof the databases on the internet, it is always quite difficult totrust the information on the internet. To solve this problemof authentication, we are proposing an algorithm based onimage processing, improved steganography and visual cryptography. This paper proposes a technique of encode the password of a customer by improved Steganography, most of the steganographic techniques use either three or four adjacent pixels around a target pixel whereas the proposed technique is able to utilize at most all eight adjacent neighbors so that imperceptibility value grows bigger.and thendividing it into shares. Total number of shares to be created isdepending on the scheme chosen by the bank. When two sharesare created, one is stored in the Bank database and the otheris kept by the customer. The customer has to present the shareduring all of his transactions. This share is stacked with the firstshare to get the original image. Then decoding method issued to take the hidden password on acceptance or rejection of the output and authenticates the customer.

2 citations

Journal ArticleDOI
TL;DR: Wang et al. as discussed by the authors proposed a contrastenhanced (k, n) CBW-VCS based on random grids, named (k n) RG-CBW-vCS, in which a binary secret image is encrypted into n color shares that have no pixel expansion.
Abstract: In traditional visual cryptography schemes (VCSs), pixel expansion remains to be an unsolved challenge. To alleviate the impact of pixel expansion, several colored-black-and-white VCSs, called CBW-VCSs, were proposed in recent years. Although these methods could ease the effect of pixel expansion, the reconstructed image obtained by these methods may also suffer from low contrasts. To address this issue, we propose a contrast-enhanced (k, n) CBW-VCS based on random grids, named (k,n) RG-CBW-VCS, in this article. By applying color random grids, a binary secret image is encrypted into n color shares that have no pixel expansion. When any k1 (k1> k) color shares are collected together, the stacked results of them can be identified as the secret image; whereas the superposition of any k2 (k2< k) color shares shows nothing. Through theoretical analysis and experimental results, we justify the effectiveness of the proposed (k, n) RG-CBW-VCS. Compared with related methods in feature, contrast, and pixel expansion, the results indicate that the proposed method generally achieves better performance.

2 citations


Network Information
Related Topics (5)
Wireless sensor network
142K papers, 2.4M citations
81% related
Feature extraction
111.8K papers, 2.1M citations
79% related
Network packet
159.7K papers, 2.2M citations
78% related
Wireless network
122.5K papers, 2.1M citations
77% related
Fuzzy logic
151.2K papers, 2.3M citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202334
202291
202158
202064
201982
2018132