Lossless progressive secret sharing for grayscale and color images

2019 ◽  
Vol 78 (17) ◽  
pp. 24837-24862 ◽  
Author(s):  
Heri Prasetyo ◽  
Chih-Hsien Hsia
2021 ◽  
Vol 7 (4) ◽  
pp. 70
Author(s):  
Heri Prasetyo ◽  
Chih-Hsien Hsia ◽  
Alim Wicaksono Hari Prayuda

A new technique for progressive visual secret sharing (PVSS) with adaptive priority weight is proposed in this paper. This approach employs the bitwise and eXclusive-OR (XOR) based approaches for generating a set of shared images from a single secret image. It effectively overcomes the former scheme limitation on dealing with an odd number of stacked or collected shared images in the recovery process. The presented technique works well when the number of stacked shared images is odd or even. As documented in experimental results, the proposed method offers good results over binary, grayscale, and color images with a perfectly reconstructed secret image. In addition, the performance of the proposed method is also supported with theoretical analysis showing its lossless ability to recover the secret image. However, it can be considered as a strong substitutive candidate for implementing a PVSS system.


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.


Author(s):  
ASHWATHIMESANGLA AO

Visual cryptography is a secret sharing scheme for encrypting a secret image, it is a perfectly secure way that allows secret sharing without any cryptographic computation, which is termed as Visual Cryptography Scheme (VCS). In this paper secret image is divided into shares (printed on transparencies), and each share holds some information. At the receiver this shares are merged to obtain the secret information which is revealed without any complex computation. The proposed algorithm is for color host image, divided into three color planes Red, Green, Blue and merged with secret image which is binarized and divided into shares. The decoding requires aligning the result obtained by merging color host image and shares, so as to obtain the secret image.


2021 ◽  
Vol 22 (4) ◽  
pp. 803-810
Author(s):  
John Blesswin A. John Blesswin A. ◽  
Selva Mary G. John Blesswin A. ◽  
Manoj Kumar S. Selva Mary G.


Sign in / Sign up

Export Citation Format

Share Document