Random-grid based progressive visual secret sharing scheme with adaptive priority

Chao, Her-Chang; Fan, Tzuo-Yau

doi:10.1016/j.dsp.2017.05.009

Cited by 30 publications

(75 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These algorithms do not introduce pixel expansion as the traditional SIS algorithms do, and their main concern is global progressiveness. Chao and Fan [12] proposed a random-grid-based progressive visualization secret-sharing scheme; in this scheme, each user participating in the secret sharing could adjust the priority of the shared image block according to their security decision level. During restoration, the secret image could be restored to different extents based on the priority of the stacked shares.…”

Section: A Image Restorationmentioning

confidence: 99%

Progressive Image Restoration Based on CP-ABE With Constant-Size Ciphertext and Constant Bilinear Calculation

2019

View full text Add to dashboard Cite

Sharing photos on an open social platform with one-to-many features increases the leakage risk of information of the shared photos. Ciphertext-policy attribute-based encryption (CP-ABE) is a one-to-many public key cryptosystem, and its access policy can be set by data owners. Therefore, if we share the protected image on the social platform and encrypt the restoration parameters of the shared image with CP-ABE, then only the accessor whose attribute set satisfies the access policy of CP-ABE can decrypt the ciphertext corresponding to his/her attribute level and then restore the image with the corresponding sharpness level. Consequently, image information protection is realized in a one-to-many scenario. However, for the existing CP-ABE, only when further shortening its ciphertext, reducing the number of bilinear pairing calculations during decryption, and ensuring flexible access policies is it beneficial for CP-ABE to be widely used in popular smart terminals that can run social software. Furthermore, existing algorithms for restoring images also have room for improvement in terms of time and space requirements. For this reason, we propose a progressive image restoration strategy based on the improved CP-ABE in this paper. For the improvement of CP-ABE, we design a new encryption scheme to achieve a shorter constant-size ciphertext, construct an auxiliary function to help the independent authority centers generate private keys for users in new ways, design a decryption algorithm with only one bilinear pairing calculation, and provide the update algorithms for attribute revocation. Subsequently, we build a distributed CP-ABE based on our improved CP-ABE, and the correctness and security of the proposed CP-ABE algorithm are also proven. In addition, we follow the tree access policy to support the access policy, including AND, OR, NOT and threshold operations simultaneously, to adapt to the requirement of some user attributes that undergo frequent changes. Moreover, based on the atmospheric scattering model, we adopt three algorithms to restore the protected image in the dehazing mode according to the sharpness parameters. Compared with the existing literature, we provide users with not only a flexible and efficient access control strategy, shorter constant-size ciphertext and fewer bilinear calculations but also multiple algorithms for restoring images. The experimental results for six privilege levels demonstrate the superiority of our algorithms in protecting image information. INDEX TERMS CP-ABE, constant-size ciphertext, bilinear pairing calculation, progressive image restoration, atmospheric scattering model.

show abstract

Section: A Image Restorationmentioning

confidence: 99%

Progressive Image Restoration Based on CP-ABE With Constant-Size Ciphertext and Constant Bilinear Calculation

2019

View full text Add to dashboard Cite

show abstract

“…The study in [26] proposes a random-grid-based progressive visual secret sharing scheme and the priority weighting of each share can be adjusted. However, the scheme has pixel expansion, which makes the recovered image visually different from the original secret image.…”

Section: Introductionmentioning

confidence: 99%

Progressive Secret Image Sharing Scheme Based on Semantic Segmentation

Zhang

Zheng

Liu³

2020

IEEE Access

View full text Add to dashboard Cite

Secret Image Sharing (SIS) plays an important role in the field of information security. At present, from the perspective of image restoration, SIS schemes are roughly divided into two categories: traditional threshold SIS schemes and Progressive SIS (PSIS) schemes. The former provides an all-ornothing recovery mode in image reconstruction phase. If one of these shadows is damaged or lost, the reconstruction will fail. In contrast, the latter can present the original image progressively during the reconstruction phase. In this paper, a PSIS scheme based on semantic segmentation is proposed, where only specific objects or sensitive areas in the image are shared. After simple processing, the remaining background images can be publicly transmitted on insecure channels of the network. The background image will be regarded as a normal picture by people without shares. Owners who have reached the share of trapdoor numbers can recover a key target in an image. As the share increases, more key targets can be recovered. This paper is the first to propose secure secret sharing of images based on semantic targets. Through this method, it is possible to perform permission control on the target that needs to be divided and shared. Since the shared object is not the entire image, it can save storage space to a certain extent. Finally, through the analysis of the experimental results and comparison with other works, it can be concluded that the proposed scheme has a higher level of security and the amount of data that needs to be transmitted is small.

show abstract

“…In essence, which is still a progressive scheme. On this basis, Chao et al [30] improved the progressive visual cryptography scheme with adaptive priority, wherein the priority weighting of each share can be adjusted. More deeply, the relationship between probabilistic EM-based VCS and RG-based VCS is analyzed in [31][32] and they concluded that a RG-based VCS is a subset of a probabilistic EM-based VCS and improving the contrast of RG-based VCS is the future work.…”

Section: Introductionmentioning

confidence: 99%

Improved Contrast for Threshold Random-grid-based Visual Cryptography

2018

KSII TIIS

View full text Add to dashboard Cite

Pixel expansion and contrast are two major performance parameters for visual cryptography scheme (VCS), which is a type of secret image sharing. Random Grid (RG) is an alternative approach to solve the pixel expansion problem. Chen and Tsao proposed the first (k, n) RGbased VCS, and then Guo et al., Wu et al., Shyu, and Yan et al. significantly improved the contrast in recent years. However, the investigations on improving the contrast of threshold RG-based VCS are not sufficient. In this paper, we develop a contrast-improved algorithm for (k, n) RG-based VCS. Theoretical analysis and experimental results demonstrate that the proposed algorithm outperformers the previous threshold algorithms with better visual quality and a higher accuracy of contrast.

show abstract

Random-grid based progressive visual secret sharing scheme with adaptive priority

Cited by 30 publications

References 19 publications

Progressive Image Restoration Based on CP-ABE With Constant-Size Ciphertext and Constant Bilinear Calculation

Progressive Image Restoration Based on CP-ABE With Constant-Size Ciphertext and Constant Bilinear Calculation

Progressive Secret Image Sharing Scheme Based on Semantic Segmentation

Improved Contrast for Threshold Random-grid-based Visual Cryptography

Contact Info

Product

Resources

About