scispace - formally typeset
Search or ask a question

Showing papers on "Visual cryptography published in 2020"


Journal ArticleDOI
Shuming Jiao1, Jun Feng1, Yang Gao1, Ting Lei1, Xiaocong Yuan1 
TL;DR: Two novel visual cryptography schemes are proposed by combining VC with single-pixel imaging (SPI) for the first time, where the secret image is shared by multiple illumination pattern sequences and it can be recovered when the visual key patterns are projected onto identical items.
Abstract: Two novel visual cryptography (VC) schemes are proposed by combining VC with single-pixel imaging (SPI) for the first time. It is pointed out that the overlapping of visual key images in VC is similar to the superposition of pixel intensities by a single-pixel detector in SPI. In the first scheme, QR-code VC is designed by using opaque sheets instead of transparent sheets. The secret image can be recovered when identical illumination patterns are projected onto multiple visual key images and a single detector is used to record the total light intensities. In the second scheme, the secret image is shared by multiple illumination pattern sequences and it can be recovered when the visual key patterns are projected onto identical items. The application of VC can be extended to more diversified scenarios by our proposed schemes.

64 citations


Journal ArticleDOI
TL;DR: The two proposed constructions for constituting a threshold probabilistic CBW-VCS are introduced, where the generated color shares are non-expansible, and are proven to be valid constructions which satisfy the security and contrast conditions.

24 citations


Journal ArticleDOI
TL;DR: A construction method for (t, k, n)-XVCS with essential shadows is proposed and the secret image can be revealed perfectly, and the shadow size is small compared with VCS.

16 citations


Journal ArticleDOI
TL;DR: A technique for embedding a secret message within that of a cover-image to ensure the interceptors will not observe the presence of such hidden data is presented and it is proved that the proposed method outperformed all the Joint Photographic Experts Group (the JPEG) and the Joint Quantization Table Modification (the JQTM) based method in terms of quality of image, security level and embedding capacity.
Abstract: Owing to the increasing growth in digital communication as well as the multimedia applications, security has now become a very significant problem in the communication as well as storage space of such images. The Visual Cryptography (VC) has been used for hiding the information that are in the images which is a special technique of encryption that is decrypted by a human visual system. In this paper, a technique for embedding a secret message within that of a cover-image to ensure the interceptors will not observe the presence of such hidden data is presented. The method has an essential conception by means of a simple Least Significant Bit (LSB) substitution. Being inspired by the steganography approach, the current work splits the cover images into n blocks of 8X 8 pixels and into a secret message of n partitions in order to improve the image quality and to increase the capacity of secret message along with its security level. For the purpose of improving this stego-image quality and for increasing the capacity of secret message along with its security level, being inspired by the current work that splits cover images into the n blocks of 8X 8 pixels and into a secret message of n partitions. In the proposed method, the Cuckoo Search (CS) is used for searching an approximate and optimal solution of finding any optimal substitution matrix to transform the message in every block as opposed to finding a single optimal matrix for substitution and the entire cover-image is presented. The final quality of its resulting in the stego-image, and its secret message and its capacity with the level of security of this method proposed will be calculated and then comparted to the other different methods. The results of the experiment proved that the proposed method outperformed all the Joint Photographic Experts Group (the JPEG) and the Joint Quantization Table Modification (the JQTM) based method in terms of quality of image, security level and embedding capacity.

15 citations


Journal ArticleDOI
TL;DR: Theoretic analysis and experimental results demonstrate the feasibility and advantages of the proposed (2, 3)-VCS, which can share one or two secret images into 3 shadows, stacking any two shadows will reveal the secret image.
Abstract: Visual cryptography scheme (VCS) shares a binary secret image into multiple shadows, stacking qualified set of shadows will decode the secret image without computer resources. In this paper, we propose a (2, 3)-VCS, which can share one or two secret images into 3 shadows, stacking any two shadows will reveal the secret image. The shadow size is 3/2 times of the secret image. The contrasts of the revealed image are 1/3 and 1/2 when we share one and two secret images, respectively. We can also reveal the secret image by XOR decoding operation, and the visual quality of the revealed image can be further improved. By XOR decoding operation, the contrasts of the revealed image will be 2/3 and 1 when we share one or two secret images, respectively. In the case of sharing two secret images, the revealed two secret images have no distortion. Theoretic analysis and experimental results demonstrate the feasibility and advantages of the proposed (2, 3)-VCS.

14 citations


Proceedings ArticleDOI
05 Mar 2020
TL;DR: The technique proposed in the paper first encrypts the medical image and then embeds it into 3 cover images and later on the receiver side, the secret image will be reconstructed from three shares (meaningful) followed by its decryption.
Abstract: In today's world, the internet is the fastest growing mode of communication. Hence, it is important to secure the data transmitted in this medium. The shared data could be in the forms of image, audio, video, etc. To provide secrecy of data many techniques have been proposed in the literature review. Visual cryptography is one among them. This paper proposes an Extended Visual Cryptography Technique (EVCT) for medical image security. Visual cryptography is a technique of sharing secret information in forms like images, text, etc. The technique proposed in the paper first encrypts the medical image and then embeds it into 3 cover images. Later on the receiver side, the secret image will be reconstructed from three shares (meaningful) followed by its decryption. The meaningful shares used in the proposed technique uses a 3X3 block size for each pixel in the secret image. No pixel expansion approach for encryption is proposed in the paper. The encryption and the embedding approaches are used in this process is lossless and less complex.

13 citations


Journal ArticleDOI
TL;DR: The performance analysis proves that (k, n) SVC improves the quality of the reconstructed secret image with increased Peak Signal-to-Noise Ratio (PSNR) up to 21% and Pixel error is calculated as Mean Square Error (MSE) and it is reduced up to 77%.
Abstract: An increase in information sharing and growth of Cloud Computing, Internet of Things (IoT), Machine Learning and mobile applications have brought human life in the digital world. Many times, financial transactions, medical communications that involve the transfer of images impose threats to our Privacy, Personal Identity and Personal Health Information (PHI). Such image data are being stolen while in transfer and made the processing of digital images vulnerable in World Wide Web (WWW). Protecting the image data from intruders becomes an essential demand. Various techniques such as Encryption, Steganography and Watermarking are in place to protect image data. Such techniques imply complex computations for encryption and decryption and the quality of image decrypted is reduced. Visual Cryptography (VC) is a new encryption method uses combinational techniques to encode the image into ‘n’ shares and decodes by stacking the shares without complex traditional cryptographic algorithms. The Signific Visual Cryptography (SVC) aims to transfer the real time images securely without compromising the quality. SVC is implemented for (k, n) scheme and (n, n) scheme of VC and supports several real time images such as natural images, medical images, and Quick Response (QR) images. To develop SVC scheme, a new Error Abatement Technique (EAT) is proceeded with two filtering strategies namely, Value Discretization Filtering (VDF) and Reduced Error Filtering (REF) to provide significant meaning to pixel values. The performance analysis proves that (k, n) SVC improves the quality of the reconstructed secret image with increased Peak Signal-to-Noise Ratio (PSNR) up to 21% and Pixel error is calculated as Mean Square Error (MSE) and it is reduced up to 77%. (n, n) SVC maintains integrity of the secret image with zero MSE without complex computations.

11 citations


Journal ArticleDOI
TL;DR: Enhanced Semantic Visual Secret Sharing Scheme is introduced that transmits a gray-scale secret image to the receiver using two color cover images and the secret image is reconstructed by digitally stacking the shares together and the result analysis shows that the ESVSS achieves security and improves the quality of the reconstructed image.
Abstract: Sharing multimedia information through the means of internet has increased many folds in this digital world. Information needs to be send across various secure channel as it contains sensitive data such as bank account details, medical reports or any financial documents. Due to the importance of information sharing, security is the most important objective that needs to be addressed while sharing this sensitive information. In order to share the information securely, one such way is visual secret sharing or visual cryptography. In this paper, introduced Enhanced Semantic Visual Secret Sharing (ESVSS) Scheme that transmits a gray-scale secret image to the receiver using two color cover images. At the receiver end, the secret image is reconstructed by digitally stacking the shares together. The result analysis shows that the ESVSS achieves security and improves the quality of the reconstructed image. The quality is measured by Peak Signal to Noise Ratio (PSNR) up to +39 dB and Mean Square Error is reduced to 6. The Universal Image Quality Index (UIQI) results are recorded up to 90% for the reconstructed image with minimal computational complexity.

9 citations


Journal ArticleDOI
31 Dec 2020-Symmetry
TL;DR: Wang et al. as discussed by the authors designed a flip VC for gray-scale and color cover images based on constraint error diffusion, which enjoys the following features: Color cover images, no computation needed for decoding, and no interference from cover image on the recovered secret image.
Abstract: Visual cryptography (VC) has found numerous applications in privacy protection, online transaction security, and voting security, etc. To counteract potential cheating attacks, Lin et al. proposed flip visual cryptography in 2010, where a second secret image can be revealed by stacking one share with a flipped version of another share. The second secret image can be designed as an additional verification mechanism. However, Lin’s scheme produces meaningless shares and is only applicable to binary secret images. It is interesting to explore whether it is possible to extend the flip VC to having cover images (i.e., extended VC) and these cover images are color images. This problem is challenging since too many restricting conditions need to be met. In this paper, we designed a flip VC for gray-scale and color cover images based on constraint error diffusion. We show that it is possible to meet all the constraints simultaneously. Compared with existing schemes, our scheme enjoys the following features: Color cover images, no computation needed for decoding, and no interference from cover image on the recovered secret image.

9 citations



Journal ArticleDOI
TL;DR: The proposed Voronoi-based Visual Cryptography (VVC) technique permits to drastically reduce the amount of encoded and transmitted information by comparison with a traditional VC scheme.
Abstract: A common processing scheme of Visual Cryptography (VC) consists of generating two ciphered images from a secret image. The sender transmits these key images via two different channels. The receiver collects the key images and recovers the secret image by superimposing them. In this article, Voronoi tessellation is exploited in Visual Cryptography for the first time to the best of our knowledge. The proposed Voronoi-based Visual Cryptography (VVC) technique permits to drastically reduce the amount of encoded and transmitted information by comparison with a traditional VC scheme. Hence, the technique can be used for transmissions of secret images with enforcement of the transmission reliability by enhancing the redundancy of information or with communication networks and technologies having low bandwidth and memory. Moreover, the random arrangement of the Voronoi polygons makes the transmission of the secret image more secure since the sender and the recipient use a private generator of random points. In addition, shape reconstruction properties of the image-based Voronoi representation are stated.

Book ChapterDOI
01 Jan 2020
TL;DR: The proposed architecture provides revocability to multimodal biometric templates and secures their storage and transmission over a remote network with the help of visual cryptography technique.
Abstract: This work proposes an architecture for multimodal biometric recognition systems where user, recognition system, and template database are remotely located over a network. As the number of biometrics are limited and once lost they are compromised forever, it becomes imperative to design systems that optimize recognition rates and also address security and privacy issues for biometric-enabled authentication schemes. The proposed architecture provides revocability to multimodal biometric templates and secures their storage and transmission over a remote network with the help of visual cryptography technique. The proposed architecture gives a good matching performance and also fulfills four template protection criteria, i.e., security, diversity, revocability, and performance. Various attack scenarios such as phishing, replay, database, man-in-middle, and attack via record multiplicity are also addressed.

Journal ArticleDOI
TL;DR: Visual cryptography is an encryption technique that decomposes a secret image into multiple shares that are digitally ‘overlapped’ based on logical operations to recover the original secret image.
Abstract: Visual cryptography is an encryption technique that decomposes a secret image into multiple shares that are digitally ‘overlapped’ based on logical operations to recover the original secret image. ...

Journal ArticleDOI
03 Mar 2020
TL;DR: Using the features of the randomness for each encoding process in visual cryptography and the visual recognizability with naked human eyes, VC is applied to design and enhance text-based captcha (VCETC), and the recognition rate is in some degree decreased.
Abstract: Nowadays, lots of applications and websites utilize text-based captchas to partially protect the authentication mechanism. However, in recent years, different ways have been exploited to automatically recognize text-based captchas especially deep learning-based ways, such as, convolutional neural network (CNN). Thus, we have to enhance the text captchas design. In this paper, using the features of the randomness for each encoding process in visual cryptography (VC) and the visual recognizability with naked human eyes, VC is applied to design and enhance text-based captcha. Experimental results using two typical deep learning-based attack models indicate the effectiveness of the designed method. By using our designed VC-enhanced text-based captcha (VCETC), the recognition rate is in some degree decreased.

Journal ArticleDOI
TL;DR: This study theoretically analyzes the performances of the proposed TVCS approach, and demonstrates implementation of the approach, to provide better visual quality of recovered images by improving on previous methods.
Abstract: The appearance of shares encoded by traditional visual cryptography is not easy to distinguish and meaningless. It means the shares cannot be managed efficiently nor user-friendly. A tagged visual cryptography scheme (TVCS) provides additional tag images for the shares and decodes the tag images by folding up a single tagged share. A TVCS allows users to efficiently manage shares and greatly increases the user-friendliness of the shares. Previous researches have focused on codebook-based and random-grid-based TVCS approaches, but the visual qualities of recovered secret images and tag images can still be improved. Therefore, this study aims to provide better visual quality of recovered images by improving on previous methods. Moreover, the proposed approach supports adjustable visual qualities of recovered secret images and tag images. In this study, we theoretically analyze the performances of the proposed approach and then demonstrate implementation of the approach.

Journal ArticleDOI
22 May 2020
TL;DR: This paper proposes a (t, s, k, n) VCS with essential participants (so called (t- s,k, n)-EVCS), where the secret image is shared into n shadows with s essentials and n-s non-essentials.
Abstract: Visual cryptography scheme (VCS) shares a binary secret image into multiple shadows printed on transparencies. Stacking shadows can visually decode the secret image without computational resources. Specifically, a (k, n) threshold VCS ((k, n)-VCS) shares a secret image into n shadows, stacking any k shadows can reveal the secret image by human visual system, while any less than k shadows cannot decode any information regarding the secret image. In practice, some participants (essentials) play more important roles than others (non-essentials). In this paper, we propose a (t, s, k, n) VCS with essential participants (so called (t, s, k, n)-EVCS). The secret image is shared into n shadows with s essentials and n-s non-essentials. Any k shadows, including at least t essentials, can reveal the secret image. The proposed scheme is constructed from a monotonic (K, N)-VCS. The condition and optimal choice of (K, N)-VCS to construct (t, s, k, n)-EVCS are given by solving integer programming model. The experimental results are conducted to verify the feasibility of our scheme.

Journal ArticleDOI
TL;DR: A security authentication method is designed based on fractal and visual cryptography based on the discrete fractal Brownian random field model that is effective against common attacks such as JPEG compression, scaling, rotation operation, clipping, added noise, filtering, and blurring.
Abstract: In this paper, we aimed to discuss the security authentication requirements of medical images in the medical network, and a security authentication method is designed based on fractal and visual cryptography. Based on the discrete fractal Brownian random field model, the gray-level statistical information and spatial structure information of medical images is fully mined. The gray distribution of medical images is expressed in the form of fractal features. By using the spatial data mining methods, the data of fractal structure space is analyzed, and by using the stability of the energy structure, the authentication features are formed. Using the visual cryptography (VC), the robustness of the authentication method is further enhanced. Through the centralized test of common medical images and the comparison analysis with existing methods, it is further verified that the method is effective against common attacks such as JPEG compression, scaling, rotation operation, clipping, added noise, filtering, and blurring.

Journal ArticleDOI
TL;DR: A pixel expansion adjustable ( k , n ) -XVC scheme, which allows pixel expansion to be changed among 2 k - 1 - 1 different values, which can ensure each pixel being exactly recovered with the same average contrast no matter it takes any pixel expansion value.
Abstract: A ( k , n ) visual cryptography (VC) scheme encodes a secret image into n shadows that are printed on transparencies distributed among a group of n participants secretly, and reveal the secret image by stacking no less than k of them. Its decryption requires no computation and attracts much attention in image security applications. The pixel expansion and contrast are two important characteristics to evaluate the visual quality of the revealed secret image for a ( k , n ) -VC scheme. The ( k , n ) XOR-based VC (XVC) schemes can greatly improve the visual quality including both pixel expansion and contrast. Previous methods require complex computation and result in high pixel expansion when they are used to construct such schemes. In this paper, we propose a pixel expansion adjustable ( k , n ) -XVC scheme, which allows pixel expansion to be changed among 2 k - 1 - 1 different values. It can ensure each pixel being exactly recovered with the same average contrast no matter it takes any pixel expansion value. The least pixel expansion is much smaller than previous schemes. Our scheme can be easily implemented based on any conventional OR-based ( k , n ) -VC (OVC) scheme.

Journal ArticleDOI
TL;DR: Experimental results show that the proposed copyright protection scheme clearly verifies the copyright of the digital images, is robust to withstand several image processing attacks and handles false positive cases efficiently.
Abstract: A copyright protection scheme based on curvelet transform, k-means clustering and extended visual cryptography is proposed for color images. Unlike the existing schemes, the proposed scheme creates meaningful shares to provide better security and handles false positive cases efficiently. Curvelet Transform is applied on Y component of host image to generate six-scale layers. Out of these layers, non fine scale layers are selected to generate the master share, which is further processed by Henon map to enhance its security. Two watermarks are used in the proposed scheme. One of them is provided by the user and other one is constructed by using Cb and Cr components of the host image. Second watermark is used to to handle false positives. Meaningful ownership share is constructed from the master share, both watermarks and cover image by using extended visual secret sharing. Master share is overlapped with its corresponding ownership share to reveal the watermark which is further used to prove the ownership. Experimental results show that the proposed scheme clearly verifies the copyright of the digital images, is robust to withstand several image processing attacks and handles false positive cases efficiently. Comparison with the existing copyright protection schemes shows that the proposed scheme gives better performance.

Journal ArticleDOI
TL;DR: It is theoretically proved that the proposed size-invariant VC scheme for grayscale image underpinned by the efficient direct binary search (EDBS) algorithm is as secure as the traditional VC, while its effectiveness is validated through experiments and comparative analyses.
Abstract: The reconstructed image of the size-invariant visual cryptography (VC) is inevitably accompanied by the loss of secret image information and the degradation of perceptual quality. Here, the halftone technique comes to the forefront since it can realistically simulate the grayscale image from a discrete binary image. Thus, by combining VC sharing with grayscale image halftone technique, this paper proposes a size-invariant VC scheme for grayscale image underpinned by the efficient direct binary search (EDBS) algorithm, in which the multi-pixel encryption VC sharing is adopted into the EDBS halftone process. Through local optimizations and global iterations, the optimal reconstructed image is obtained. To further enhance the contrast of the reconstructed image with limited computational power, the image information is probabilistically extracted according to the inverse mapping in the codebook. It is theoretically proved that the proposed scheme is as secure as the traditional VC, while its effectiveness is validated through experiments and comparative analyses.

Journal ArticleDOI
TL;DR: Two schemes to secure information in the form of images, found to be more secure than existing visual cryptographic scheme and are more reliable and imperceptible are presented.

Journal ArticleDOI
TL;DR: This study purposes the Master-Slave synchronization via active controller and real time simulation of five different chaotic systems such as Lorenz, Sprott, Rucklidge, Moore-Spiegel, Rössler to perform real time synchronization in LabVIEW environment.
Abstract: Received: 25 May 2020 Accepted: 8 August 2020 In recent years, chaotic systems have begun to take a substantial place in literature due to increasing importance of secure communication. Chaotic synchronization which has emerged as a necessity for secure communication can now be performed with many different methods. This study purposes the Master-Slave synchronization via active controller and real time simulation of five different chaotic systems such as Lorenz, Sprott, Rucklidge, Moore-Spiegel, Rössler. Master slave synchronization was performed because of synchronization realized between the same type of chaotic systems with different initial parameters and also because of the systems were expected to behave similarly as a result of synchronization. Active control method was used to amplify the difference signal between master and slave systems which have different initial parameters and to return back synchronization information to the slave system. The real time simulation and synchronization of the master and slave systems performed successfully in LabVIEW environment. Furthermore, for the real time implementation, analogue outputs of NI-DAQ card used and real time results also were observed on an oscilloscope and secure communication application using sinusoidal signal and an image encryption application achieved successfully.

Journal ArticleDOI
TL;DR: A modified phase retrieval algorithm is proposed and a hierarchical visual cryptography scheme (HVCS) is presented that overcomes the problems that are mentioned and can share multiple secret images.
Abstract: Visual cryptography is generally based on the base matrix scheme or the random grid scheme. These schemes may cause some problems, such as the expansion of the shares and the recovered images and the distortion of the recovered images. In this paper, we propose a modified phase retrieval algorithm and present a hierarchical visual cryptography scheme (HVCS). The scheme overcomes the problems that are mentioned and can share multiple secret images. Considering the differences in the social division of labor, there is a hierarchy between the shared images in the proposed scheme, that is, the participants have different rights. Further, to make the proposed scheme more applicable to practical needs, we propose a generalized HVCS by modifying the phase retrieval algorithm again so that each level can have more than one participant. The effectiveness and feasibility of the proposed scheme are verified by theoretical analysis and numerical simulation.

Proceedings ArticleDOI
01 Sep 2020
TL;DR: By the aid of neural networks, two criteria called encryption-inconsistency and decryption-consistency for evaluating the shares and the recovered images, respectively are proposed for visual cryptography schemes.
Abstract: Visual cryptography schemes are developed for image security, where encryption is realized by distributing a secret image into shares and decryption is done only by stacking the shares. Human eyesight is usually used to evaluate the security and performance of visual cryptography schemes. However, objective criteria for visual cryptography schemes are not yet established. In this paper, by the aid of neural networks, we propose two criteria called encryption-inconsistency and decryption-consistency for evaluating the shares and the recovered images, respectively. We also implemented the experiments for two representatives of visual cryptography schemes by applying three popular convolutional neural networks (CNN) to adopt our proposed criteria.

Book ChapterDOI
01 Jan 2020
TL;DR: A comparative study of VC for binary images is presented with respect to different parameters and draws the current barriers related to the visual cryptography schemes.
Abstract: Visual Cryptography (VC) is a type of image secret sharing scheme which decrypts an original secret image with Human Visual System (HVS). In this, the original image can be alienated into n shadows or shares and allocated to n participants; stacking any k shares reveals the secret image which ensures the security measures. In this paper, we examined the recent research advances in black and white VCSs. We reviewed the existing techniques and a comparative study of VC for binary images is presented. The study is performed with respect to different parameters and draws the current barriers related to the visual cryptography schemes.

Journal ArticleDOI
TL;DR: The proposed visual crypto-mask steganography method overcomes this drawback and support good payload capacity with multi modal approach of embedding biometrics, resulting in ∞ PSNR, a secured model in communicating sensitive (biometric features) information over the internet.
Abstract: With increase in growth of data and digital threat, demand of securing the data communicated over the internet is an essential play in the digital world. In the vision of digitalizing services with the next generation of security to the sensitive data transmitted over the internet by hiding the existence of the data using next generation cryptography by fusing cryptography techniques is one the major technique adopted. With this the aim in traditional Least Significant Bit (LSB) is one of the widely used technique. Where the secret message or image are placed in the cover image in the least significant bits of RGB Channels resulting in a stego image. But the drawback is, on suspecting the differences in the pixels of original and stegoimage in the secret data embedded can be guessed and extracted by attacker. The Proposed visual crypto-mask steganography method overcomes this drawback and support good payload capacity with multi modal approach of embedding biometrics, resulting in ∞ PSNR. The authenticated person face and fingerprint information is transmitted in a cover image and mask image (magic sheet) using proposed steganography and is combined with Random Visual Crypto Technique. Which results in enhanced and advance visual crypto steganography secured model in communicating sensitive (biometric features) information over the internet. Where the complete information cannot be extracted using only cover image. Mask image (magic sheet) is used along with cover image that reveals the secret data in the receiving end.

Journal ArticleDOI
TL;DR: In the proposed technique, additional basis matrices for encrypting the secret pixels are used and the quality of the recovered secret image is compared with traditional (2, 2) VCS using various image quality metrics.
Abstract: Visual cryptography is a technique used to share a secret among many participants. The problem with visual cryptography technique is that the secret is not perfectly recovered, i.e. a black secret ...

Journal ArticleDOI
TL;DR: In this article, the authors proposed an invisible watermarking scheme to protect biometric information from harmful attacks by segmenting the host image into blocks using edge entropy and then selecting the appropriate band coefficients using 2D-DWT transformation.

Proceedings ArticleDOI
01 Jan 2020
TL;DR: An online voting system for Maharashtra Carrom Association where members can cast their vote with their computers, and laptops, and to maintain the security the method is using CAPTCHA code and Image Share technology.
Abstract: The main aim of using visual cryptography in voting system is to give provision for casting vote for internal decisions in an organization. It is flexible enough to cast vote from remote places. Election is a total confidential process and is held with maximum secrecy. Hence, we have proposed an online voting system for Maharashtra Carrom Association where members can cast their vote with their computers, and laptops. To maintain the security we are using CAPTCHA code and Image Share technology. The proposed method offers anonymity of voter identity, while keeping the votes private, and the election transparent and secure.

Book ChapterDOI
01 Jan 2020
TL;DR: This chapter aims to help the readers to get familiar with the classical VC algorithms, including the classical deterministic VC with pixel expansion as developed in Naor and Shamir’s seminal work.
Abstract: This chapter aims to help the readers to get familiar with the classical VC algorithms. These algorithms are also stepstones for developing more complicated algorithms in later chapters. First, we introduce the general framework of VC, such as access structure and general requirements (security and contrast). Then, we introduce the classical deterministic VC with pixel expansion as developed in Naor and Shamir’s seminal work. Next, the size-invariant algorithms are summarized, including the probabilistic VC and random grid VC. Some examples will be discussed for the readers that are new to this topic. Finally, various security levels in visual cryptography will be discussed, including strong security and several weak securities.