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

scholarly journals Secret Image Sharing with Dealer-Participatory and Non-Dealer-Participatory Mutual Shadow Authentication Capabilities

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 234
Author(s):  
Yue Jiang ◽  
Xuehu Yan ◽  
Jianqing Qi ◽  
Yuliang Lu ◽  
Xuan Zhou
Keyword(s):  
Information Hiding ◽  
Detection Rate ◽  
Secret Image Sharing ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Secret Image ◽  
Image Sharing ◽  
Lossless Recovery ◽  
Authentication Schemes ◽  
Level Plane

A ( k , n ) threshold secret image sharing (SIS) method is proposed to divide a secret image into n shadows. The beauty of this scheme is that one can only reconstruct a secret image with k or more than k shadows, but one cannot obtain any information about the secret from fewer than k shadows. In the ( k , n ) threshold SIS, shadow authentication means the detection and location of manipulated shadows. Traditional shadow authentication schemes require additional bits for authentication; need much information to be public; or need to put each shadow into a host image, utilizing the information hiding technique, which makes the generation, recovery and authentication complexity higher. Besides, most existing schemes work when a dealer participates in recovery. Our contribution is that we propose a SIS method for a ( k , n ) threshold with dealer-participatory and non-dealer-participatory mutual shadow authentication capabilities which integrates polynomial-based SIS and visual secret sharing (VSS) through using the result of VSS to “guide” the polynomial-based SIS by a screening operation. In our scheme, when an authentication image is public, all involved actors (participants and dealer) can mutually authenticate each other by exchange the lowest level plane instead of the whole shadow. Our scheme is suitable for the case with and without a dealer participate recovery. In addition, the proposed scheme has characteristics of low generation and authentication complexity, no pixel expansion, 100% detection rate and lossless recovery.

SECRET IMAGE SHARING BASED ON CHAOTIC MAP AND CHINESE REMAINDER THEOREM

2012 ◽  
Vol 10 (03) ◽  
pp. 1250023 ◽  
Author(s):  
CHUNQIANG HU ◽  
XIAOFENG LIAO ◽  
DI XIAO
Keyword(s):  
Digital Image ◽  
Secret Sharing ◽  
Chinese Remainder Theorem ◽  
Chaotic Map ◽  
Secret Image Sharing ◽  
Image Size ◽  
Pixel Expansion ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme

Secret sharing is an efficient method for transmitting the image securely. This paper proposes an efficient secret sharing scheme for secret image. The protocol allows each participant to share a secret gray image with the rest of participants. In our scheme, a secret digital image is divided into n pieces, which are further distributed into n participants. The secret digital image can be reconstructed if and only if r or more legal participants cooperate together. These schemes have no pixel expansion. It is general in nature and can be applied on any image size. The proposed scheme is based on the chaotic map and the Chinese Remainder theorem. The security of the scheme is analyzed and the protocol is proven to be secure and be able to resist statistic and exhaustive attacks.

scholarly journals Secret Image Sharing Scheme Based on a Boolean Operation

2014 ◽  
Vol 14 (2) ◽  
pp. 98-113 ◽  
Author(s):  
Amitava Nag ◽  
Sushanta Biswas ◽  
Debasree Sarkar ◽  
Partha Pratim Sarka
Keyword(s):  
Fault Tolerance ◽  
Secret Sharing ◽  
Boolean Operation ◽  
Secret Image Sharing ◽  
Research Papers ◽  
Secret Image ◽  
Image Sharing ◽  
Generation Technique ◽  
Sharing Scheme ◽  
Secret Image Sharing Scheme

Abstract Traditionally extensive researches have been done on secret image sharing which support the fault tolerance property. But their reconstruction complexity is high. Some research papers on secret image sharing are also available with smaller reconstruction complexity, due to the use of a Boolean operation. But these research works lack the fault tolerance property which is the heart of secret sharing. This paper deals with a general (k, n) secret image sharing scheme for gray scale images with both low reconstruction complexity and preservation of the fault tolerance property. Moreover, the proposed sharing generation technique can also be applied on colour images.

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.

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 Multi Secret Image Sharing Scheme of General Access Structure with Meaningful Shares

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1582
Author(s):  
Hongliang Cai ◽  
Dan Tang
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Schemes ◽  
Access Structure ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
General Access Structure ◽  
Multi Secret Sharing ◽  
Secret Image Sharing Scheme

A Multi Secret Image sharing scheme can share several secret images among certain participators securely. Boolean-based secret sharing schemes are one kind of secret sharing method with light-weighted computation compared to the previous complex algebraic-based methods, which can realize the sharing of multi secret images. However, the existing Boolean-based multi secret sharing schemes are mostly restricted to the particular case of (2, n) and (n, n), only few Boolean-based multi secret sharing schemes study the general access structure, and the shares are mostly meaningless. In this paper, a new Boolean-based multi secret sharing scheme with the general access structure is proposed. All the shares are meaningful, which can avoid attracting the attention of adversaries, and the secret images can be recovered in a lossless manner. The feasibility of the scheme is proven, the performance is validated by the experiments on the gray images, and the analysis of the comparison with other methods is also given out.

scholarly journals An Image Secret Sharing Method Based on Matrix Theory

Symmetry ◽  
2018 ◽  
Vol 10 (10) ◽  
pp. 530 ◽  
Author(s):  
Wanmeng Ding ◽  
Kesheng Liu ◽  
Xuehu Yan ◽  
Huaixi Wang ◽  
Lintao Liu ◽  
...  
Keyword(s):  
Secret Sharing ◽  
Matrix Theory ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Lossless Recovery ◽  
Sharing Scheme ◽  
Image Secret Sharing ◽  
Special Case ◽  
Secret Image Sharing Scheme

Most of today’s secret image sharing technologies are based on the polynomial-based secret sharing scheme proposed by shamir. At present, researchers mostly focus on the development of properties such as small shadow size and lossless recovery, instead of the principle of Shamir’s polynomial-based SS scheme. In this paper, matrix theory is used to analyze Shamir’s polynomial-based scheme, and a general (k, n) threshold secret image sharing scheme based on matrix theory is proposed. The effectiveness of the proposed scheme is proved by theoretical and experimental results. Moreover, it has been proved that the Shamir’s polynomial-based SS scheme is a special case of our proposed scheme.

Sign in / Sign up

Export Citation Format

Share Document