Visual Secret Sharing Without Pixel Expansion

2015 ◽  
Vol 7 (2) ◽  
pp. 20-30
Author(s):  
Ali Makki Sagheer ◽  
Laith Hamid Abed
Keyword(s):  
Secret Sharing ◽  
Computer Network ◽  
Security Analysis ◽  
Visual Secret Sharing ◽  
Secret Key ◽  
Pixel Expansion ◽  
Image Security ◽  
Image Sharing ◽  
Powerful Approach ◽  
Common Problems

Visual Secret Sharing (VSS) is a powerful approach for protecting image sharing through unsecured computer network such as the Internet. Pixel expansion and bad image quality are the most common problems of this approach. Visual secret sharing technique is proposed for grayscale images to eliminate pixel expansion problem using image compression. The experimental results and security analysis illustrate that the proposed visual secret sharing technique leads to better results in terms of image security and quality together with pixel expansion's elimination. The obtained results showed that the accomplished image security is stronger than the security of the traditional secret sharing technique as the secret key encryption is associated with VSS approach.

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.

K out of N Secret Sharing Scheme for Multiple Color Images with Steganography and Authentication

2016 ◽  
Vol 16 (02) ◽  
pp. 1650010 ◽  
Author(s):  
P. Mohamed Fathimal ◽  
P. Arockia Jansi Rani
Keyword(s):  
Secret Sharing ◽  
Visual Quality ◽  
Color Images ◽  
Pixel Expansion ◽  
Image Sharing ◽  
Digital Ecosystem ◽  
Sharing Scheme ◽  
Text Steganography ◽  
Key Aspects

With our lives trundling toward a fully-digital ecosystem in break-neck speed, today’s encryption and cryptography are facing the challenge of ensuring security and future-readiness of our transactions. When such transactions involve multiple hands, transmission of such data in discrete and recoverable parts (secret shares) guarantees confidentiality. This paper’s objective is to present a foolproof way of multiple secret sharing, eliminating issues such as half-toning and degradation of visual quality of the recovered images. This [Formula: see text] out of [Formula: see text] steganography and authenticated image sharing (SAIS) scheme for multiple color images generates [Formula: see text] relevant shares with the ability to reconstruct the secret images using [Formula: see text] shares and facility to find out any move for appropriation of share cover images. The key aspects of this proposed scheme is to use simple Boolean and arithmetic operations with reduction of computational complexity from [Formula: see text] to [Formula: see text] and to share multiple images without any pixel expansion.

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

A Visual Secret Sharing Scheme Based on Improved Local Binary Pattern

2018 ◽  
Vol 32 (06) ◽  
pp. 1850017 ◽  
Author(s):  
Wenyin Zhang ◽  
Frank Y. Shih ◽  
Shunbo Hu ◽  
Muwei Jian
Keyword(s):  
Secret Sharing ◽  
Local Binary Pattern ◽  
Computational Cost ◽  
Image Data ◽  
Local Contrast ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Secret Information ◽  
Sharing Scheme ◽  
Exact Determination

A visual secret sharing (VSS) scheme is intended to share secret information in a group to avoid potential treat of interruption and modification. In this paper, we present a novel VSS scheme based on the improved local binary pattern (LBP) operator. It makes full use of local contrast features of LBP for concealing secret image data into different image shares, which can be used to recover the secret easily and exactly. By varying LBP extensions, we can design various kinds of VSS schemes for sharing secret information. Compared to the currently available VSS algorithms, the proposed scheme demonstrates better randomness in shares with less pixel expansion and exact determination in reconstruction with lower computational cost.

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 Applying Secret Image Sharing to Economics

2021 ◽  
Vol 13 (4) ◽  
pp. 16-25
Author(s):  
Xuemei Zhao ◽  
Tongtong Zhang ◽  
Jun Liu ◽  
Canju Lu ◽  
Huan Lu ◽  
...  
Keyword(s):  
Secret Sharing ◽  
Investment Decision ◽  
Secret Image Sharing ◽  
Visual Secret Sharing ◽  
Secret Image ◽  
Image Sharing

Economics has some limitations, such as insecure multiple parties economical investment decision and leakage of business quotation. Secret image sharing (SIS) for (k, n)-threshold is such a technique that protects an image through splitting it into n shadows, a.k.a. shadow images or shares, assigned to n corresponding participants. The secret image can be disclosed by obtaining k or more shadows. Polynomial-based SIS and visual secret sharing (VSS) are the chief research branches. This paper first analyzes the insecure issues in economics and then introduces two methods to apply typical SIS schemes to improve economical security. Finally, experiments are realized to illustrate the efficiency of the methods.

Sign in / Sign up

Export Citation Format

Share Document