Who Distributes It? Privacy-Preserving Image Sharing Scheme with Illegal Distribution Detection

Author(s):  
Tianpeng Deng ◽  
Xuan Li ◽  
Biao Jin ◽  
Jinbo Xiong
2016 ◽  
Vol 16 (02) ◽  
pp. 1650010 ◽  
Author(s):  
P. Mohamed Fathimal ◽  
P. Arockia Jansi Rani

With our lives trundling toward a fully-digital ecosystem in break-neck speed, today’s encryption and cryptography are facing the challenge of ensuring security and future-readiness of our transactions. When such transactions involve multiple hands, transmission of such data in discrete and recoverable parts (secret shares) guarantees confidentiality. This paper’s objective is to present a foolproof way of multiple secret sharing, eliminating issues such as half-toning and degradation of visual quality of the recovered images. This [Formula: see text] out of [Formula: see text] steganography and authenticated image sharing (SAIS) scheme for multiple color images generates [Formula: see text] relevant shares with the ability to reconstruct the secret images using [Formula: see text] shares and facility to find out any move for appropriation of share cover images. The key aspects of this proposed scheme is to use simple Boolean and arithmetic operations with reduction of computational complexity from [Formula: see text] to [Formula: see text] and to share multiple images without any pixel expansion.


2017 ◽  
Vol 22 (S1) ◽  
pp. 2293-2307 ◽  
Author(s):  
Li Li ◽  
M. Shamim Hossain ◽  
Ahmed A. Abd El-Latif ◽  
M. F. Alhamid

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Lina Zhang ◽  
Xuan Dang ◽  
Li Feng ◽  
Junhan Yang

Due to the widespread adoption and popularity of digital images in distributed storage, Secret Image Sharing (SIS) has attracted much attention. However, preventing the cheating of shares is an important problem that needs to be solved in the traditional SIS scheme. An adversary without image shares may participate in the restoration phase as a share owner. In this phase, the adversary can obtain real shares or prevent recovering real images by submitting fake shadows. Our schemes are based on the original Thien-Lin’s scheme. In the scheme I, we use some XOR operations to get two authentication codes through all secret pixel values to achieve a lightweight and fast-calculated authentication scheme for cheating prevention. This scheme is suitable for small devices with limited resources. In scheme II, we use a hash algorithm to generate the authentication code. This scheme is suitable for environments with larger storage space and higher security levels. Since all pixel values are involved in the authentication in our proposed schemes, it can prevent fake shadow images from cheating. Meanwhile, the shadow size is almost the same as the original Thien-Lin’s scheme. Experimental results and theoretical analysis show that the proposed schemes are feasible and effective.


Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2063
Author(s):  
Jiang-Yi Lin ◽  
Ji-Hwei Horng ◽  
Chin-Chen Chang

The (k, n)-threshold reversible secret image sharing (RSIS) is technology that conceals the secret data in a cover image and produces n shadow versions. While k (kn) or more shadows are gathered, the embedded secret data and the cover image can be retrieved without any error. This article proposes an optimal (2, 3) RSIS algorithm based on a crystal-lattice matrix. Sized by the assigned embedding capacity, a crystal-lattice model is first generated by simulating the crystal growth phenomenon with a greedy algorithm. A three-dimensional (3D) reference matrix based on translationally symmetric alignment of crystal-lattice models is constructed to guide production of the three secret image shadows. Any two of the three different shares can cooperate to restore the secret data and the cover image. When all three image shares are available, the third share can be applied to authenticate the obtained image shares. Experimental results prove that the proposed scheme can produce secret image shares with a better visual quality than other related works.


2016 ◽  
Vol 9 (17) ◽  
pp. 4075-4088 ◽  
Author(s):  
Zhi-Hui Wang ◽  
Ya-Feng Di ◽  
Jianjun Li ◽  
Chin-Chen Chang ◽  
Hui Liu

Sign in / Sign up

Export Citation Format

Share Document