A novel scheme for lossless authenticated multiple secret images sharing using polynomials and extended visual cryptography
Reads0
Chats0
About:
This article is published in Iet Information Security.The article was published on 2021-01-01 and is currently open access. It has received 5 citations till now. The article focuses on the topics: Visual cryptography & Lossless compression.read more
Citations
More filters
Journal ArticleDOI
(k, N) Secret Image Sharing Scheme with Privileged Set
Journal ArticleDOI
Renewal of secret and shadows in secret image sharing
TL;DR: Wang et al. as discussed by the authors proposed a scheme for renewing secret image and shadow images by multiplying the original and renewed shadow of the corresponding serial number to get a new shadow over finite fields.
Book ChapterDOI
Multifactor IoT Authentication System for Smart Homes Using Visual Cryptography, Digital Memory, and Blockchain Technologies
Proceedings ArticleDOI
BEMSS- Blockwise Encryption based Multi Secret Sharing scheme for Securing Visual Content
TL;DR: In this article , an (n,n) multi-secret image encryption with a secret sharing scheme is proposed using blockwise encryption, which recovers n lossless the secret images by modulo and blockwise decryption process.
Journal ArticleDOI
Competitive Swarm Improved Invasive Weed Optimization-Based Secret Sharing Scheme for Visual Cryptography
TL;DR: Wang et al. as mentioned in this paper proposed a robust visual cryptography-based data sharing scheme, named Competitive Swarm Improved Invasive Weed Optimization (CSIIWO) for sharing multiple data, where the confidential data is shared by dividing the visual details into multiple shares such that the encryption and the decryption are performed for reconstructing the original image back by stacking the splitted shares.
References
More filters
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Journal ArticleDOI
Secret image sharing
Chih-Ching Thien,Ja-Chen Lin +1 more
TL;DR: A method such that a secret image is shared by n shadow images, and any r shadow images of them can be used to restore the whole secret image, and the size of each shadow image is smaller than the secret image in this method.
Journal ArticleDOI
Extended capabilities for visual cryptography
TL;DR: An extended visual cryptography scheme, for an access structure (ΓQual,ΓForb) on a set of n participants, is a technique to encode n images in such a way that when the authors stack together the transparencies associated to participants in any set X∈�Qual they get the secret message with no trace of the original images, but any X∈Γ forb has no information on the shared image.
Journal ArticleDOI
Cheating Prevention in Visual Cryptography
Chih-Ming Hu,Wen-Guey Tzeng +1 more
TL;DR: A generic method that converts a VCS to another VCS that has the property of cheating prevention is proposed and the overhead of the conversion is near optimal in both contrast degression and pixel expansion.
Journal ArticleDOI
VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches
Sian-Jheng Lin,Ja-Chen Lin +1 more
TL;DR: This paper presents a novel method to combine two major branches of image sharing: VC and PSS, where each transparency is a two-in-one carrier of the information, and the decoding has two options.