Cheating Prevention Method in Visual Cryptography by Using Random Grids

2013 ◽  
Vol 416-417 ◽  
pp. 1423-1428
Author(s):  
Hong Wei Lin ◽  
Xue Song Yang ◽  
Shu Wen Wang
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Random Grids ◽  
Secret Image ◽  
Prevention Method

The traditional cheating prevention is usually based on visual cryptography (VC), in which the constructed image is bigger than the secret image because of the pixel expansion. In this paper, we studied the cheating problems in visual secret sharing (VSS) by random grids (RG) which can prevent the cheating activities with no pixel expansion. We considered the attacks of collusive cheaters who may deviate from the scheme in any way. We presented the cheating method and applied it on attacking existent n-out-of-n VSS scheme based on RG. Then we proposed one cheat-preventing scheme that can prevent the cheating activity upon.

scholarly journals A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion

Cryptography ◽  
2018 ◽  
Vol 2 (4) ◽  
pp. 28
Author(s):  
Ying-Yu Chen ◽  
Bo-Yuan Huang ◽  
Justie Juan
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Original Image ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Threshold Secret Sharing ◽  
Secret Image ◽  
Sharing Scheme ◽  
Progressive Visual Secret Sharing ◽  
Positive Integers

Visual cryptography (VC) encrypts a secret image into n shares (transparency). As such, we cannot see any information from any one share, and the original image is decrypted by stacking all of the shares. The general (k, n)-threshold secret sharing scheme (SSS) can similarly encrypt and decrypt the original image by stacking at least k (≤ n) shares. If one stack is fewer than k shares, the secret image is unrecognizable. Another subject is progressive visual secret sharing, which means that when more shares are progressively stacked, the combined share becomes clearer. In this study, we constructed an advanced scheme for (k, n)-threshold SSS that can be encrypted in VC for any positive integers n ≥ k ≥ 2 through the method of combination, and the size of each share is the same as that of the original image. That is, no pixel expansion is required. Our scheme is novel, and the results from the theoretical analysis and simulation reveal that our scheme exhibits favorable contrast to that of other related schemes.

scholarly journals Collusion Attacks in XOR Based RG-VSS

2019 ◽  
Vol 8 (10) ◽  
pp. 2339-2345
Keyword(s):  
Secret Sharing ◽  
Data Security ◽  
Visual Cryptography ◽  
Visual Quality ◽  
Visual Secret Sharing ◽  
Security Issue ◽  
Collusion Attacks ◽  
Secret Image ◽  
The Past

Visual secret sharing (VSS) is a well-known technique from the past few decades for data security. Recently, XOR based VSS has attracted many researchers due to its lossless or good visual quality of reconstructed secret image. Cheating in visual cryptography based VSS was introduced by Horng et. al. in 2006. Cheating occurs when a dishonest participant presents fake share and performs stacking of fake share with honest participants who have genuine share, thereby revealing the fake secret image instead of the original secret image. Cheating occurs when some XOR based VSS are exposed to collusion attacks. Here, in this paper, we have demonstrated and proved that there is a security issue in existing XOR based VSS schemes.

Sharing Multiple Digital Images via Halftoning Methods

2012 ◽  
Vol 182-183 ◽  
pp. 1992-1997
Author(s):  
Kai Hui Lee ◽  
Pei Ling Chiu
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Encryption Algorithm ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Binary Images ◽  
Multiple Secrets ◽  
Image Area ◽  
Display Quality ◽  
Encryption Method

The visual secret sharing for multiple secrets (VSSM) technique allows for the encryption of more than one secret images in a given image area. Previous research on VSSM schemes has a pixel expansion problem that limits the capability to increase the capacity of secret image encryption. Moreover, the VSSM schemes focus on sharing binary images to date. These drawbacks limit the applicability of existing VSSM schemes. In this study, we propose a novel encryption algorithm to address these problems. The proposed algorithm adopts a visual cryptography (VC)–based encryption method that can eliminate the pixel expansion problem and is applicable to halftone secret images. The experimental results demonstrate that the proposed approach not only can increase the capacity of VSSM schemes, but also can maintain an excellent level of display quality in the recovered secret images.

scholarly journals A New Bi-Level Encoding and Decoding Scheme for Pixel Expansion Based Visual Cryptography

2019 ◽  
Vol 6 (1) ◽  
pp. 18-42
Author(s):  
Ram Chandra Barik ◽  
Suvamoy Changder ◽  
Sitanshu Sekhar Sahu
Keyword(s):  
Information Security ◽  
Secret Sharing ◽  
Visual Cryptography ◽  
Color Images ◽  
Secret Sharing Scheme ◽  
Normal Vision ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Host Image ◽  
Sharing Scheme

Mapping of image-based object textures to ASCII characters can be a new modification towards visual cryptography. Naor and Shamir proposed a new dimension of Information security as visual cryptography which is a secret sharing scheme among N number of participants with pixel expansion. Later on, many researchers extended the visual secret sharing scheme with no expansion of pixel regions in binary and color images. By stacking k shares the secret can be decoded using normal vision. In this paper the authors have proposed a modification towards visual cryptography by converting the message in the form of printable ASCII character-based numerical encoding patterns in a binary host image. The encoding of the message is represented as ASCII numeric and a texture of those numeric are arranged to form a binary host image. Then, N numbers of shares are built up but after stacking all the shares the decoding of the message is achieved by converting ASCII numeric to the secret.

scholarly journals Emerging Trends in Visual Secret Sharing

2018 ◽  
Vol 7 (3.12) ◽  
pp. 374
Author(s):  
Mainejar Yadav ◽  
Ranvijay .
Keyword(s):  
Secret Sharing ◽  
State Of The Art ◽  
Visual Cryptography ◽  
Research Area ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Emerging Trends ◽  
Random Grid ◽  
Challenges And Opportunities ◽  
Visual Authentication

Visual Secret Sharing (VSS) is an increased applicability of traditional secret sharing. In VSS, the secret information is recovered by human visual system or lightweight computational device. There are two models available in VSS, one is Visual Cryptography (VC) which is introduced by Naor's in 1994 and other is a Random Grid (RG) based VSS which is proposed by Keren and Kafri. This state of the art covers both the models of VSS along with its application. The various application areas of VSS are visual authentication and identification, image encryption, access control, data hiding etc. The chapter has also covered various future enhancements in VC based on cryptanalysis, optimal pixel expansion, multiple secret encoding, progressive VC etc. Random Grid based VSS have some advantages over VC, which eliminates the need of Pixel expansion and codebook. But still, there is scope for the improvements in the contrast and the complexity of exiting algorithms. So there are various challenges and opportunities which make it an exciting research area to work upon. 

Improved Extended Progressive Visual Cryptography Scheme Using Pixel Harmonization

2021 ◽  
Vol 15 (2) ◽  
pp. 196-216
Author(s):  
Suhas Bhagate ◽  
Prakash J. Kulkarni
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Sharing Schemes ◽  
Pixel Expansion ◽  
Secret Image ◽  
Secret Information ◽  
Meaningful Shares ◽  
Visual Cryptography Scheme

Security of information is of much concern in the modern internet era. Secret sharing schemes provide mechanism of encrypting secret information to prevent illicit usage. Visual cryptography is a secret sharing technique that facilitates encryption of a secret image. Visual cryptography allows us to effectively and efficiently share secrets among a number of trusted parties by hiding secrets within images. These images are encoded into multiple shares as per the rules indicated in basis matrices and later decoded by stacking required number of shares. Progressive visual cryptography has a specialty of recovering secret image as soon as more than one shares received gradually. Existing progressive visual cryptography schemes have severe limitations like data disclose on shares and higher pixel expansion. Improved progressive visual cryptography scheme deals with these limitations. Improved extended progressive visual cryptography scheme solves the issue of management of noise like meaningless shares by creating meaningful shares without any pixel expansion efficiently.

scholarly journals A Common General Access Structure Construction Approach in Secret Image Sharing

2020 ◽  
Vol 12 (3) ◽  
pp. 96-110
Author(s):  
Xuehu Yan ◽  
Yuliang Lu ◽  
Lintao Liu
Keyword(s):  
Secret Sharing ◽  
Access Structure ◽  
Secret Image Sharing ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Linear Congruence ◽  
Secret Image ◽  
Image Sharing ◽  
General Access Structure ◽  
Special Case

(k, n) threshold is a special case of the general access structure (GAS) in secret image sharing (SIS), therefore GAS is more extensive than (k, n) threshold. Most of conventional SIS, including visual secret sharing (VSS), polynomial-based SIS, linear congruence (LC)-based SIS, etc., were proposed with only (k, k) threshold or (k, n) threshold other than GAS. This article introduces a common GAS construction approach in SIS with on pixel expansion from existing (k, k) threshold or (k, n) threshold SIS. The authors input classic SIS methods to test the efficiency and feasibility of the proposed common GAS construction approach. Experiments are presented to indicate the efficiency of the approach by illustrations and analysis.

scholarly journals Verifiable Essential Secret Image Sharing with Multiple Decryptions

2019 ◽  
Vol 8 (2) ◽  
pp. 2211-2220
Keyword(s):  
Secret Sharing ◽  
Human Visual System ◽  
Simple Computation ◽  
Secret Image Sharing ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Secret Image ◽  
Image Sharing ◽  
Verification Process ◽  
Multiple Decryptions

We know that the essential secret image sharing (ESIS) scheme differs from traditional visual secret sharing with respect to the essentiality of the shares. In ESIS, to reconstruct the secret image, threshold number of the shares are required which includes all the essential shares. All the shares are very sensitive because it carries the secret information. Hence, reliability and authenticity of the shares before the decoding of the secret image are required which prevents a participant from intentionally or unintentionally to provide invalid shares. Proposed method is a novel verifiable essential secret image sharing (VESIS) with multiple decryption. Multiple decryption means that the decoding and verification process is done by human visual system as well as by EX-ORing the shares. Apart from this, proposed scheme also eliminates unnecessary encryption constraints of VSS like pixel expansion, explicit codebook and the number of the participants and it is also required simple computation and O(k) complexity for the decoding process.

scholarly journals VISUAL CRYPTOGRAPHY FOR COLOR IMAGES

2013 ◽  
pp. 147-149
Author(s):  
ASHWATHIMESANGLA AO
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Color Images ◽  
Secret Sharing Scheme ◽  
Secret Image ◽  
Secret Information ◽  
Host Image ◽  
Sharing Scheme ◽  
Visual Cryptography Scheme

Visual cryptography is a secret sharing scheme for encrypting a secret image, it is a perfectly secure way that allows secret sharing without any cryptographic computation, which is termed as Visual Cryptography Scheme (VCS). In this paper secret image is divided into shares (printed on transparencies), and each share holds some information. At the receiver this shares are merged to obtain the secret information which is revealed without any complex computation. The proposed algorithm is for color host image, divided into three color planes Red, Green, Blue and merged with secret image which is binarized and divided into shares. The decoding requires aligning the result obtained by merging color host image and shares, so as to obtain the secret image.

scholarly journals Fault-Tolerant Visual Secret Sharing Schemes without Pixel Expansion

2016 ◽  
Vol 6 (1) ◽  
pp. 18 ◽  
Author(s):  
Justie Juan ◽  
Yung-Chang Chen ◽  
Song Guo
Keyword(s):  
Secret Sharing ◽  
Fault Tolerant ◽  
Secret Sharing Schemes ◽  
Visual Secret Sharing ◽  
Pixel Expansion
Sign in / Sign up

Export Citation Format

Share Document