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
Journal ArticleDOI
TL;DR: A new way for phishing websites classification is advised to solve the problem of phishing by dissolve the original image captcha into two shares that are stored in separate database servers.
Abstract: Phishing is an attempt by an individual or a group to thieve personal confidential information such as passwords, credit card information etc from unsuspecting sufferer for burglary, financial gain and other criminal activities. The first defense should be strengthening the authentication mechanism in a web application. A simple username and password based authentication is not sufficient for web sites providing critical financial transactions. Here we have advised a new way for phishing websites classification to solve the problem of phishing. Phishing websites involves a collection of key within its content-parts as well as the browser-based security indicators provided along with the website. The use of images is try to keep the privacy of image captcha by dissolve the original image captcha into two shares that are stored in separate database servers such that the original image captcha can be acknowledged only when both are available together the individual sheet images do not confess the status of the original image captcha. Once the original image captcha is announced to the user it can be used as the password. Several solutions have been suggested to handle phishing.

1 citations

01 Jan 2015
TL;DR: Various modes and methodologies are described in order to understand a special type of visual cryptography known as Halftone visual cryptography, where a secret image can be visually revealed from overlapping shadow images without additional computations.
Abstract: In visual secret sharing (VSS) schemes, a secret image can be visually revealed from overlapping shadow images without additional computations. Originally proposed by Naor and Shamir various other visual cryptographic schemes were proposed, so as to make the concept better compact and to get a better image quality concerning contrast, quality , pixel expansion and various other issues. In this paper various modes and methodologies are described in order to understand a special type of visual cryptography known as Halftone visual cryptography. Furthermore, the various techniques and types included in halftone visual cryptography are described in brief. More efforts are required to decrease the share's cross inference from other shares in the future. So, that the quality of recovered image does not degrades.

1 citations

01 Jan 2013
TL;DR: This paper critically reviews such branches of cryptography like lattice cryptography, quantum cryptography, and visual cryptography, which each method has its own advantages and limitations.
Abstract: Cryptography is the art and science of achieving security by encoding messages to make them non readable. Cryptography has a long and fascinating history. Now a day, there are many branches of cryptography like lattice cryptography, quantum cryptography, and visual cryptography and so on. Each method has its own advantages and limitations. This paper critically reviews such branches of cryptography.

1 citations

Journal ArticleDOI
TL;DR: The proposed scheme is a general k, n-RIVSS scheme, in which any t k ≤ t ≤ n shares can be used to reconstruct the secret regions up to t-k + 1 levels, but no information about the input image can be revealed by any k-1 or fewer shares.
Abstract: The concept of region incrementing in visual cryptography was introduced to encrypt an image into multiple secrecy levels. But, it suffers from the pixel expansion increasing exponentially as the number of participants grows. In this paper, we propose a region incrementing visual secret sharing RIVSS scheme based on random grids. The proposed scheme is a general k, n-RIVSS scheme, in which any t k ≤ t ≤ n shares can be used to reconstruct the secret regions up to t-k + 1 levels. However, no information about the input image can be revealed by any k-1 or fewer shares. With a nice property of region incrementing, the proposed scheme benefits by sharing an image without any pixel expansion and codebook requirement. We give formal proofs and experimental results to confirm both correctness and feasibility of our scheme.

1 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