Secret Image Sharing Based on Encrypted Pixels

Zhou, Zhili; Yang, Ching-Nung; Cao, Yi; Sun, Xingming

doi:10.1109/access.2018.2811722

Cited by 40 publications

(12 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, when adopting basic logic operations on VCS, the operations should be pixel-wise and cannot definitely be bit-wise since basic logic operations on bit-level need the help of computer and image manipulation program. Such bit-based secret image sharing methods [27] will need the help of computer even though only simple computations are required. Because VCS uses pixel-wise operation, the secret image I should be black-and-white (binary), where each pixel is either 1 or 0.…”

Section: Motivationmentioning

confidence: 99%

Boolean Operation Based Visual Cryptography

et al. 2019

Self Cite

View full text Add to dashboard Cite

A (k, n)-Traditional Visual Cryptographic Scheme (VCS) based on basis matrices encoded a secret image into n shadow images distributed among n participants. When any k participants superimposed their shadow images, the secret image can be visually revealed. This stacking operation in decoding process is equivalent to perform OR operation. Basis matrices of a (k, n) OR-operation based VCS (OVCS) have been proved in the (k, n) XOR-operation based VCS (XVCS) underlying XOR operation to enhance the contrast 2 (k−1) times. Although XOR operation has been used to excavate good property of basis matrices in OVCS, other properties of basis matrices are obviously ignored in visual cryptography. In this paper, we define two new Boolean-operation based VCSs, AND-operation based VCS (AVCS) and NOT-operation based VCS (NVCS), and prove that basis matrices in a (k, n)-OVCS can be used as basis matrices in (k n)-AVCS and (k, n) NVCS, respectively. Furthermore, we obtain a general converting formula of their contrasts among OVCS, AVCS, XVCS, and NVCS. With OVCS, there does not exist perfect whiteness. However, with other Boolean-operation based VCSs (XVCS, AVCS, and NVCS), there may exist this situation. Therefore, new contrast is also given to precisely evaluate visual quality of Boolean-operation based VCSs. Some observations and results demonstrate how to properly use these Boolean-operation based VCSs for decoding. INDEX TERMS Visual secret sharing, visual cryptography, secret image sharing, threshold scheme, boolean operation.

show abstract

Section: Motivationmentioning

confidence: 99%

Boolean Operation Based Visual Cryptography

et al. 2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…For the dealer nonparticipatory decryption, when a participant exchanges the share with any other k − 1 participants, the participant decrypts the secret with good quality by Lagrange interpolation. After Shamir's work, many works [26]- [29] developed improved polynomial-based ISS schemes to obtain desirable properties. Polynomial-based ISS is significant because the decrypted secret image has no pixel expansion and high quality.…”

Section: Introductionmentioning

confidence: 99%

A Common Method of Share Authentication in Image Secret Sharing

Yan

Yang

et al. 2021

IEEE Trans. Circuits Syst. Video Technol.

Self Cite

View full text Add to dashboard Cite

Because of the importance of digital images and their extensive application to digital watermarking, block chain, access control, identity authentication, distributive storage in the cloud and so on, image secret sharing (ISS) is attracting ever-increasing attention. Share authentication is an important issue in its practical application. However, most ISS schemes with share authentication ability require a dealer to participate in the authentication (namely, dealer participatory authentication). In this paper, we design an ISS for a (k, n)-threshold with separate share authentication abilities of both dealer participatory authentication and dealer nonparticipatory authentication. The advantages of polynomial-based ISS and visual secret sharing (VSS) are skillfully fused to achieve these two authentication abilities without sending a share by using a screening operation. In addition, the designed scheme has the characteristics of low decryption (authentication) complexity, lossless decryption and no pixel expansion. Experiments and theoretical analyses are performed to show the effectiveness of the designed scheme.

show abstract

“…[10] proposed a new (t, s, k, n)-ESIS scheme based on Shamir's scheme, where essential shadows are more important than non-essential shadows. In addition, shadow images with diferent priorities [11][12][13][14][15].Thus, Shamir's polynomial-based scheme has been widely used in SIS [16][17][18].…”

Section: Introductionmentioning

confidence: 99%

An Image Secret Sharing Method Based on Matrix Theory

et al. 2018

View full text Add to dashboard Cite

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.

show abstract

Secret Image Sharing Based on Encrypted Pixels

Cited by 40 publications

References 14 publications

Boolean Operation Based Visual Cryptography

Boolean Operation Based Visual Cryptography

A Common Method of Share Authentication in Image Secret Sharing

An Image Secret Sharing Method Based on Matrix Theory

Contact Info

Product

Resources

About