K out of N Secret Sharing Scheme for Multiple Color Images with Steganography and Authentication

2016 ◽  
Vol 16 (02) ◽  
pp. 1650010 ◽  
Author(s):  
P. Mohamed Fathimal ◽  
P. Arockia Jansi Rani
Keyword(s):  
Secret Sharing ◽  
Visual Quality ◽  
Color Images ◽  
Pixel Expansion ◽  
Image Sharing ◽  
Digital Ecosystem ◽  
Sharing Scheme ◽  
Text Steganography ◽  
Key Aspects

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.

scholarly journals Meaningful Secret Image Sharing Scheme with High Visual Quality Based on Natural Steganography

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1452
Author(s):  
Yuyuan Sun ◽  
Yuliang Lu ◽  
Jinrui Chen ◽  
Weiming Zhang ◽  
Xuehu Yan
Keyword(s):  
Visual Quality ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Lossless Recovery ◽  
Sharing Scheme ◽  
Image Protection ◽  
Embedding Rate ◽  
Secret Image Sharing Scheme

The (k,n)-threshold Secret Image Sharing scheme (SISS) is a solution to image protection. However, the shadow images generated by traditional SISS are noise-like, easily arousing deep suspicions, so that it is significant to generate meaningful shadow images. One solution is to embed the shadow images into meaningful natural images and visual quality should be considered first. Limited by embedding rate, the existing schemes have made concessions in size and visual quality of shadow images, and few of them take the ability of anti-steganalysis into consideration. In this paper, a meaningful SISS that is based on Natural Steganography (MSISS-NS) is proposed. The secret image is firstly divided into n small-sized shadow images with Chinese Reminder Theorem, which are then embedded into RAW images to simulate the images with higher ISO parameters with NS. In MSISS-NS, the visual quality of shadow images is improved significantly. Additionally, as the payload of cover images with NS is larger than the size of small-sized shadow images, the scheme performs well not only in visual camouflage, but also in other aspects, like lossless recovery, no pixel expansion, and resisting steganalysis.

scholarly journals A New Bi-Level Encoding and Decoding Scheme for Pixel Expansion Based Visual Cryptography

2019 ◽  
Vol 6 (1) ◽  
pp. 18-42
Author(s):  
Ram Chandra Barik ◽  
Suvamoy Changder ◽  
Sitanshu Sekhar Sahu
Keyword(s):  
Information Security ◽  
Secret Sharing ◽  
Visual Cryptography ◽  
Color Images ◽  
Secret Sharing Scheme ◽  
Normal Vision ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Host Image ◽  
Sharing Scheme

Mapping of image-based object textures to ASCII characters can be a new modification towards visual cryptography. Naor and Shamir proposed a new dimension of Information security as visual cryptography which is a secret sharing scheme among N number of participants with pixel expansion. Later on, many researchers extended the visual secret sharing scheme with no expansion of pixel regions in binary and color images. By stacking k shares the secret can be decoded using normal vision. In this paper the authors have proposed a modification towards visual cryptography by converting the message in the form of printable ASCII character-based numerical encoding patterns in a binary host image. The encoding of the message is represented as ASCII numeric and a texture of those numeric are arranged to form a binary host image. Then, N numbers of shares are built up but after stacking all the shares the decoding of the message is achieved by converting ASCII numeric to the secret.

SECRET IMAGE SHARING BASED ON CHAOTIC MAP AND CHINESE REMAINDER THEOREM

2012 ◽  
Vol 10 (03) ◽  
pp. 1250023 ◽  
Author(s):  
CHUNQIANG HU ◽  
XIAOFENG LIAO ◽  
DI XIAO
Keyword(s):  
Digital Image ◽  
Secret Sharing ◽  
Chinese Remainder Theorem ◽  
Chaotic Map ◽  
Secret Image Sharing ◽  
Image Size ◽  
Pixel Expansion ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme

Secret sharing is an efficient method for transmitting the image securely. This paper proposes an efficient secret sharing scheme for secret image. The protocol allows each participant to share a secret gray image with the rest of participants. In our scheme, a secret digital image is divided into n pieces, which are further distributed into n participants. The secret digital image can be reconstructed if and only if r or more legal participants cooperate together. These schemes have no pixel expansion. It is general in nature and can be applied on any image size. The proposed scheme is based on the chaotic map and the Chinese Remainder theorem. The security of the scheme is analyzed and the protocol is proven to be secure and be able to resist statistic and exhaustive attacks.

scholarly journals VISUAL CRYPTOGRAPHY FOR COLOR IMAGES

2013 ◽  
pp. 147-149
Author(s):  
ASHWATHIMESANGLA AO
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Color Images ◽  
Secret Sharing Scheme ◽  
Secret Image ◽  
Secret Information ◽  
Host Image ◽  
Sharing Scheme ◽  
Visual Cryptography Scheme

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.

A novel secret image sharing scheme for true-color images with size constraint

2009 ◽  
Vol 179 (19) ◽  
pp. 3247-3254 ◽  
Author(s):  
Du-Shiau Tsai ◽  
Gwoboa Horng ◽  
Tzung-Her Chen ◽  
Yao-Te Huang
Keyword(s):  
Color Images ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
True Color ◽  
Secret Image Sharing Scheme

Secured Communication Method using Visual Secret Sharing Scheme for Color Images

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.
Keyword(s):  
Secret Sharing ◽  
Color Images ◽  
Secret Sharing Scheme ◽  
Visual Secret Sharing ◽  
Sharing Scheme ◽  
Communication Method ◽  
Secured Communication

Chaotic Map for Securing Digital Content

2016 ◽  
Vol 3 (1) ◽  
pp. 20-35 ◽  
Author(s):  
Dhiraj Pandey ◽  
U. S. Rawat
Keyword(s):  
Secret Sharing ◽  
Chaotic Map ◽  
Logistic Map ◽  
Visual Cryptography ◽  
Visual Quality ◽  
Digital Content ◽  
Digital Information ◽  
Pixel Expansion ◽  
Empirical Results ◽  
Logistic Chaotic Map

Progressive Visual Cryptography (PVC) is quite suitable for sharing sensitive digital data.Previous research on PVC, such as Fang et al. (2006) and W.P.Fang et al.(2008) were all carrying pixel-expansion problem and also gives a poor visual quality on the recovered stacked image. Recently, Hou&Quan (2011) have developed a progressive scheme for secret sharing. It is observed that shares generated by the scheme are free from pixel expansion problem, but shares are not fully secure. In this paper, a new progressive sharing algorithm based on logistic chaotic map has been proposed to overcome the said limitation of Hou (2011) scheme. The irregular outputs of the logistic map are used to encode a secret digital information carrying image. The performance of the algorithm in the scheme of Hou (2011) is critically analyzed and compared with new suggested scheme. Empirical results are presented to showcase the performance of the authors' proposed scheme in terms of its effectiveness (imperceptibility and security) and feasibility.

scholarly journals Secret Image Sharing Scheme Based on a Boolean Operation

2014 ◽  
Vol 14 (2) ◽  
pp. 98-113 ◽  
Author(s):  
Amitava Nag ◽  
Sushanta Biswas ◽  
Debasree Sarkar ◽  
Partha Pratim Sarka
Keyword(s):  
Fault Tolerance ◽  
Secret Sharing ◽  
Boolean Operation ◽  
Secret Image Sharing ◽  
Research Papers ◽  
Secret Image ◽  
Image Sharing ◽  
Generation Technique ◽  
Sharing Scheme ◽  
Secret Image Sharing Scheme

Abstract Traditionally extensive researches have been done on secret image sharing which support the fault tolerance property. But their reconstruction complexity is high. Some research papers on secret image sharing are also available with smaller reconstruction complexity, due to the use of a Boolean operation. But these research works lack the fault tolerance property which is the heart of secret sharing. This paper deals with a general (k, n) secret image sharing scheme for gray scale images with both low reconstruction complexity and preservation of the fault tolerance property. Moreover, the proposed sharing generation technique can also be applied on colour images.

Sign in / Sign up

Export Citation Format

Share Document