Color Image Sharing Method Based on Lagrange’s Interpolating Polynomial

Author(s):  
Guiqiang Chen ◽  
Jianjun Liu ◽  
Liqin Wang
Keyword(s):  
2019 ◽  
Vol 8 (4) ◽  
pp. 2797-2800

visual cryptography system proposed a image encryption and decryption method. In the proposed method Red, Green, Blue color images using visual cryptography. In existing system is working for share created, it is encrypted separately by using visual secret share creation (VSS) algorithms. The proposed work is original images share1 and ahare2 created XOR-Based visual cryptography. This proposed schemes share1 encryption and share2 encryption included in RSA algorithm. The share1 and ahare2 decryption process is enable secret image sharing and then stacking. The proposed system is value calculate the PSNR and MSE formula and then image security using NPCR and UACI formula. The visual cryptography existing work to compare the proposed work and better results quality of RGB color images. The color image encryption and decryption using RSA algorithm and matlab coding.


2015 ◽  
Vol 11 (2) ◽  
pp. 94
Author(s):  
Djihed Anani ◽  
Kamel M. Faraoun

In this paper, we present a new (t,n)-threshold secret images sharing scheme based on linear memory cellular automata (LMCA). While all existing LMCA-based sharing scheme are not robust, the proposed one provides full robustness property. Precisely, any subset of t participants can collude to recover the shared secret, in contrast to existing LMCA-based schemes when this is possible only for participants having consecutive shares. To achieve robustness, produced shares are constructed using subsets of different LMCA’s configurations instead of using single ones. The subsets are defined according to an assignments matrix that is generated using a specific heuristic. The proposed scheme is shown to be robust, and its security is experimentally evaluated with respect to the problem of secret color image sharing. Obtained results illustrate the secrecy of the produced shares, while comparison gives an accurate evaluation with respect to existing schemes.


Author(s):  
KUN-YUAN CHAO ◽  
JA-CHEN LIN

In secret image sharing, a polynomial interpolation technique heavy experiences a computation load when the secret image is retrieved later. To the contrary, fast approaches often need larger storage space due to pixel expansion property. This paper proposes a missing-allowable (k, n) scheme which is fast and with a reasonable pixel expansion rate (per). The scheme generates n extremely-noisy shadow images for the given secret color image A, and any k out of these n shadows can recover A loss-freely. In average, to decode a color pixel of A, the retrieval uses only three exclusion-OR operations among 24-bit numbers. Hence, the new method has very fast decoding speed, and its pixel expansion rate is always acceptable (0 < per < 2).


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Shamsa Kanwal ◽  
Saba Inam ◽  
Omar Cheikhrouhou ◽  
Kinza Mahnoor ◽  
Atef Zaguia ◽  
...  

Due to the growing of the use of Internet and communication media, image encryption is rapidly increased. Image sharing through unsafe open channels is vulnerable for attacking and stealing. For protecting the images from attacks, encryption techniques are required. Recently, new and efficient chaos-based techniques have been suggested to develop secure image encryption. This study presents a novel image encryption framework based on integrating the chaotic maps and color codes. Three phases are involved in the proposed image encryption technique. Piecewise chaotic linear map (PWLCM) is used in the first phase for permuting the digital image. In the second phase, substitution is done using Hill cipher which is the mixing of color codes with the permuted image. The third phase is implemented by XORing, a sequence generated by the chaotic logistic map (CLM). The proposed approach enhances the diffusion ability of the image encryption making the encrypted images resistant to the statistical differential attacks. The results of several analyses such as information entropy, histogram correlation of adjacent pixels, unified average changing intensity (UACI), number of pixel change rate (NPCR), and peak signal-to-noise ratio (PSNR) guarantee the security and robustness of the proposed algorithm. The measurements show that the proposed algorithm is a noble overall solution for image encryption. Thorough comparison with other image encryption algorithms is also carried out.


Author(s):  
KaiPing Wang ◽  
ChiangLung Liu ◽  
DerChyuan Lou

Sign in / Sign up

Export Citation Format

Share Document