Multi-layer Secret Image Sharing

Fang, Wen‐Pinn

doi:10.1109/iihmsp.2010.22

Cited by 4 publications

(5 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two properties are essential to a VSS scheme: visually recognizable and security [19]. For measuring the visual quality, which determines how well human eyes can recognize the recovered image, the recovered secret image S corresponding to the original secret image S is evaluated through contrast.…”

Section: Related Workmentioning

confidence: 99%

“…For measuring the visual quality, which determines how well human eyes can recognize the recovered image, the recovered secret image S corresponding to the original secret image S is evaluated through contrast. Contrast is commonly defined in the following two respects [8,10,18,19] Definition 1. Light transmittance of the image S is denoted as T(S), and T(S) = w/t = 1 − (b/t), where b is the number of the black pixel, and w is the number of the white pixel, and t = w + b.…”

Section: Related Workmentioning

confidence: 99%

“…At the same time, some schemes related to the progressive VSS (PVSS) scheme have been proposed in recent years [18][19][20][21][22][23][24][25][26][27][28][29]. The term "progressive" indicates that the greater the number of shares stacked together, the clearer the restored image is.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

2018

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

2018

View full text Add to dashboard Cite

show abstract

“…Fourth, cross-department-supported sharing is different from progressive sharing [7,8,19]. In progressive sharing, the unveiling of the secret decreases in error to finally become error free.…”

Section: Conflicts Of Interestmentioning

confidence: 99%

“…Because sharing is useful, all four aforementioned papers [1][2][3][4] have been frequently cited, particularly Shamir [1], which has had more than 10,000 citations from 1979 to 2019. Many recent studies have also focused on sharing [5][6][7][8][9][10][11][12][13][14][15][16][17][18][19]. Finally, as for image sharing, some readers may wonder why one cannot just use a key to encrypt the secret image and then share the key with authorized personnel.…”

Section: Introductionmentioning

confidence: 99%

Secret Image Sharing Revisited: Forbidden Type, Support Type, and Their Two Approaches

Chao

Lin

2020

Applied Sciences

View full text Add to dashboard Cite

In this paper, we introduce two new image-sharing types to extend the applicability of sharing. Type 1 is our so-called forbidden type. In its sharing system, any t of the n shares can recover the secret image, unless the t shares form a forbidden group listed in a forbidden list. Type 2 is our so-called cross-department support type. If a government has 3 departments {DEPH, DEPM, DEPL}, then 3 thresholds (tH, tM and tL) exist. Any tH number of officers from department DEPH can unveil the secret image, and likewise for any tM and tL number of officers from departments DEPM and DEPL, respectively. Type 2 image sharing allows a secret to be disclosed not only in an intra-department meeting but also in a cross-department meeting. In this study, both types are implemented through two approaches: the polynomial and linear-equations approaches. Hackers can be confused when two approaches are mixed. As for the applications, use Type 1 to protect sensitive information in medical or military images or legal documents; and use type 2 to support cross-department crime investigation, industrial production, etc.

show abstract

Secure image sharing method over unsecured channels

Al-Najjar

Alharthi

Atrey

2014

Multimed Tools Appl

View full text Add to dashboard Cite

Image sharing has become a prominent field in large and small networks. However, in order to deliver the shares to their respective shareholders, we need a secure channel to protect the shares from potential attacks by other users on the network. These users can locate the shares and retrieve the image using the Lagrange interpolation method if they are able to locate the minimum required number of shares. This paper proposes a method to protect the privacy and security of the shares when sending them through unsecured channels. The proposed method is divided into three phases. In the first phase, image pixels are changed using the column and row indices, then the shares are created using Shamir's secret sharing (SSS) method. Then a relationship is created between the shares using a linear independence function. In the second phase, the first part of the image is encrypted to hide the solver data. Finally, in the third phase, the data is shared using the SSS method. Participants can retrieve the whole image by applying the reverse order of the proposed method using only the information from the sender through the same channel. The simulation results show that the proposed method is efficient and robust against different types of attacks and can be used to send the shares over unsecured channels.

show abstract

Multi-layer Secret Image Sharing

Cited by 4 publications

References 8 publications

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

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

Secret Image Sharing Revisited: Forbidden Type, Support Type, and Their Two Approaches

Secure image sharing method over unsecured channels

Contact Info

Product

Resources

About