LOSSLESS SECRET SHARING SCHEME WITH HIGH QUALITY SHARES BASED ON VQ-COMPRESSED IMAGES

2011 ◽  
Vol 25 (04) ◽  
pp. 529-546
Author(s):  
CHIN-CHEN CHANG ◽  
KUO-NAN CHEN ◽  
NGOC-TU HUYNH
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Compression Method ◽  
Pixel Expansion ◽  
High Quality ◽  
Secret Image ◽  
Compressed Images ◽  
Sharing Scheme ◽  
Xor Operation

In this paper, we propose an efficient secret sharing scheme without pixel expansion. The scheme first uses the VQ-compression method to compress a secret image. This allows senders to share a larger secret image than other methods. Moreover, the proposed method also allows participants to reconstruct a lossless secret image. The generated shadows are meaningful with high quality, so the image does not attract any suspicion from attackers. Because the scheme uses XOR operation during the construction and revealing phases, it is suitable for secret sharing applications.

scholarly journals A High-Quality Authenticatable Visual Secret Sharing Scheme Using SGX

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Denghui Zhang ◽  
Zhaoquan Gu
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Third Party ◽  
Secret Sharing Scheme ◽  
High Quality ◽  
Secret Image ◽  
Digital Devices ◽  
Sharing Scheme ◽  
Main Components

Visual cryptography scheme (VCS) is a secret-sharing scheme which encrypts images as shares and can decrypt shares without digital devices. Although a participant can reveal the secret image by merely stacking a sufficient number of shares, the visual quality of recovered images is reduced, and malicious adversaries can cheat participants by giving faked shares. The paper presents a novel VCS called T-VCS (trusted VCS) which consists of two main components: a high-quality VCS and an enhanced verification scheme of shares based on the emerging Intel Software Guard eXtensions (SGX). While providing high-quality recovery, T-VCS keeps the size of the shares the same as the original secret image. We use SGX to act as a trusted third party (TTP) to verify the validity of the shares in an attested enclave without degrading the image quality. The experimental results show that T-VCS can achieve a balance among contrast, share size, and verification efficiency.

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 Threshold Secret Sharing Scheme for Compartmented Access Structures

Cryptography ◽  
2020 ◽  
pp. 438-448
Author(s):  
P. Mohamed Fathimal ◽  
P. Arockia Jansi Rani
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Sharing Scheme ◽  
Secret Image ◽  
Access Structures ◽  
Sharing Scheme ◽  
Single Host ◽  
Compartmented Access Structures ◽  
Key Features

In the realm of visual cryptography, secret sharing is the predominant method of transmission and reception of secure data. Most of the (n, n) secret sharing schemes suffer from one common flaw — locking of information when the all- n number of receivers are not available for some reason. This paper proposes a new method of compartmented secret sharing scheme where some threshold number of equally privileged from each compartment can retrieve data. This scheme rules out regeneration of secret image at the single compartment thereby eliminating the danger of misusing secret image. The key features of this scheme are: better visual quality of the recovered image with no pixel expansion; non-requirement of half toning of color images; less computational complexity by reconstructing secret through XORing and simple addition of all share images. This scheme is highly beneficial in applications where data has to be stored securely in a database and in cloud computing to synchronize information passed to different groups or clusters from a single host.

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.

Meaningful Share Generation for (2, 2)-Multiple Visual Secret Sharing Scheme Without Pixel Expansion

2014 ◽  
Vol 58 (7) ◽  
pp. 1598-1606 ◽  
Author(s):  
Chao-Liang Liu ◽  
Wang-Jui Tsai ◽  
Ting-Yi Chang ◽  
Chun-Cheng Peng ◽  
Peng-Shiang Wong
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Sharing Scheme ◽  
Meaningful Share
Sign in / Sign up

Export Citation Format

Share Document