scholarly journals Progressive Secret Sharing with Adaptive Priority and Perfect Reconstruction

2021 ◽  
Vol 7 (4) ◽  
pp. 70
Author(s):  
Heri Prasetyo ◽  
Chih-Hsien Hsia ◽  
Alim Wicaksono Hari Prayuda
Keyword(s):  
Secret Sharing ◽  
Recovery Process ◽  
Color Images ◽  
Perfect Reconstruction ◽  
Visual Secret Sharing ◽  
Secret Image ◽  
Progressive Visual Secret Sharing ◽  
A New Technique ◽  
Progressive Secret Sharing ◽  
Exclusive Or

A new technique for progressive visual secret sharing (PVSS) with adaptive priority weight is proposed in this paper. This approach employs the bitwise and eXclusive-OR (XOR) based approaches for generating a set of shared images from a single secret image. It effectively overcomes the former scheme limitation on dealing with an odd number of stacked or collected shared images in the recovery process. The presented technique works well when the number of stacked shared images is odd or even. As documented in experimental results, the proposed method offers good results over binary, grayscale, and color images with a perfectly reconstructed secret image. In addition, the performance of the proposed method is also supported with theoretical analysis showing its lossless ability to recover the secret image. However, it can be considered as a strong substitutive candidate for implementing a PVSS system.

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 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.

Secured Communication Method using Visual Secret Sharing Scheme for Color Images

2021 ◽  
Vol 22 (4) ◽  
pp. 803-810
Author(s):  
John Blesswin A. John Blesswin A. ◽  
Selva Mary G. John Blesswin A. ◽  
Manoj Kumar S. Selva Mary G.
Keyword(s):  
Secret Sharing ◽  
Color Images ◽  
Secret Sharing Scheme ◽  
Visual Secret Sharing ◽  
Sharing Scheme ◽  
Communication Method ◽  
Secured Communication

scholarly journals XOR-ed visual secret sharing scheme with robust and meaningful shadows based on QR codes

2019 ◽  
Vol 79 (9-10) ◽  
pp. 5719-5741 ◽  
Author(s):  
Longdan Tan ◽  
Yuliang Lu ◽  
Xuehu Yan ◽  
Lintao Liu ◽  
Xuan Zhou
Keyword(s):  
Error Correction ◽  
Secret Sharing ◽  
Qr Code ◽  
Quick Response ◽  
Salt And Pepper Noise ◽  
Visual Secret Sharing ◽  
Qr Codes ◽  
Secret Image ◽  
Sharing Scheme ◽  
Salt And Pepper

AbstractQuick response (QR) codes are becoming increasingly popular in various areas of life due to the advantages of the error correction capacity, the ability to be scanned quickly and the capacity to contain meaningful content. The distribution of dark and light modules of a QR code looks random, but the content of a code can be decoded by a standard QR reader. Thus, a QR code is often used in combination with visual secret sharing (VSS) to generate meaningful shadows. There may be some losses in the process of distribution and preservation of the shadows. To recover secret images with high quality, it is necessary to consider the scheme’s robustness. However, few studies examine robustness of VSS combined with QR codes. In this paper, we propose a robust (k, n)-threshold XOR-ed VSS (XVSS) scheme based on a QR code with the error correction ability. Compared with OR-ed VSS (OVSS), XVSS can recover the secret image losslessly, and the amount of computation needed is low. Since the standard QR encoder does not check if the padding codewords are correct during the encoding phase, we replace padding codewords by initial shadows shared from the secret image using XVSS to generate QR code shadows. As a result, the shadows can be decoded normally, and their error correction abilities are preserved. Once all the shadows have been collected, the secret image can be recovered losslessly. More importantly, if some conventional image attacks, including rotation, JPEG compression, Gaussian noise, salt-and-pepper noise, cropping, resizing, and even the addition of camera and screen noises are performed on the shadows, the secret image can still be recovered. The experimental results and comparisons demonstrate the effectiveness of our scheme.

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.

Sign in / Sign up

Export Citation Format

Share Document