Secret Image Sharing Scheme Based on a Boolean Operation

Nag, Amitava; Biswas, Sushanta; Sarkar, Debasree; Sarka, Partha Pratim

doi:10.2478/cait-2014-0023

Cited by 16 publications

(11 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chen and Tsao developed an RG-based (2, n)-threshold VSS scheme [14] in the same year. Later, some researchers considered the use of XOR operations in their (k, n)-threshold VSS schemes [15,16]. In 2015, Ref.…”

Section: Introductionmentioning

confidence: 99%

A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion

2018

View full text Add to dashboard Cite

Visual cryptography (VC) encrypts a secret image into n shares (transparency). As such, we cannot see any information from any one share, and the original image is decrypted by stacking all of the shares. The general (k, n)-threshold secret sharing scheme (SSS) can similarly encrypt and decrypt the original image by stacking at least k (≤ n) shares. If one stack is fewer than k shares, the secret image is unrecognizable. Another subject is progressive visual secret sharing, which means that when more shares are progressively stacked, the combined share becomes clearer. In this study, we constructed an advanced scheme for (k, n)-threshold SSS that can be encrypted in VC for any positive integers n ≥ k ≥ 2 through the method of combination, and the size of each share is the same as that of the original image. That is, no pixel expansion is required. Our scheme is novel, and the results from the theoretical analysis and simulation reveal that our scheme exhibits favorable contrast to that of other related schemes.

show abstract

Section: Introductionmentioning

confidence: 99%

A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion

2018

View full text Add to dashboard Cite

show abstract

“…Besides Shamir's scheme, some new techniques are introduced in SIS works. Nag et al 31 presented an SIS scheme based on a boolean operation which can achieve less recovery time compared with the existing schemes. Eslami et al 32 and AzzaA et al 33 realized SIS based on cellular automata.…”

Section: Related Workmentioning

confidence: 99%

Privacy‐preserving image retrieval in a distributed environment

Zhou

Qin

Hou

et al. 2022

Int J of Intelligent Sys

View full text Add to dashboard Cite

Nowadays, several image-based smart services have been widely used in our daily lives, generating many digital images. Since smart devices outsource digital images to the cloud, researchers prefer to select some desired targets from the massive images within the cloud for analysis and improve smart services. Therefore, protective image retrieval on the cloud has attained maximum concentration for privacy-preserving purposes, and the availability assurance of images on the cloud is also a crucial link. Ensuring image security and availability in the cloud environment and precisely preserving retrieval accuracy is comes as a utilitysecurity dilemma while few existing works have explicitly addressed it. Therefore, this paper proposes privacy-preserving image retrieval in the distributed environment based on the combination of image encryption for similarity search and secret image sharing. On the basis of them, we define two-stage encryption. The first-stage encryption algorithm is introduced by modifying Wolfram's reversible cellular automata-based image encryption, which can create a set of processing images to ensure image security and retrieval accuracy. Then, the second-stage encryption algorithm is put forward based on secret image sharing to improve image security and availability. The color histogram could be extracted from the encrypted images for similarity retrieval, and the shadows could be

show abstract

“…Amitava Nag et al proficiently put forward a new (k, n) secret sharing scheme [7] with the help of Boolean operations. In this scheme, n-k shares are lost, secret image could be recovered using remaining k shares.…”

Section: Related Workmentioning

confidence: 99%

An Optimized Secret Image Sharing Scheme Based on Ant Colony Optimization Algorithm

Ilayaraja¹

2017

IJET

View full text Add to dashboard Cite

A secret image kept in a single information-carrier could be easily retrieved or damaged by unauthorized entity. In the gigantic internet communication, the secret image sharing schemes can be used to share a secret image with utmost confidentiality over unsecured public channels. In this scheme a secret image is programmed into n transparencies of arbitrary prototypes. It is possible to decode the secret image visually by superimposing a qualified subset of transparencies. Nevertheless, no secret image can be acquired from the superposition of an illegal subset. In this paper, an efficient Ant Colony Optimization (ACO) algorithm is proposed for secret image sharing scheme. The original secret image pixels and key matrix is used to construct the transparencies. Here an ACO algorithm is utilized to optimize the key matrix to improve the transparency image quality. Experiments are conducted to show the security and efficiency of the proposed scheme. Comparisons with previous approaches show the advantages of the proposed scheme. Keyword-Secret Sharing; Image Sharing; Ant Colony Optimization; Pixels; I. INTRODUCTION Nowadays transmitting multimedia data by means of all-pervasive Internet is the trend gaining interest. With the advent of e-commerce, it has become extremely essential to tackle the sensitive issues of affording data security, especially in the ever-blooming open network environment of the modern era. The encrypting technologies of the time-honored cryptography are generally employed to shelter data safety extensively [1]. Cryptography is used to send and receive encrypted information which can be decrypted only by the sender or receiver. This technique is mainly used to store and transmit the data in an appropriate manner that can be read and processed only by the intended person. In the cryptography process, encryption is the conversion of plaintext (ordinary text or clear text) into cipher text and the reverse process is called decryption and the people who are working in this domain are called as cryptographers. With the emergence of multimedia applications, there is a huge demand for transmission and secured storage of information. So security is indispensable for proper data protection. If the information is protected, the intruders may not be able to distort the data. It becomes challenging to transmit the data in a secured and proper manner. Cryptographic techniques afford the confidentiality and security by reducing the prospect of adversaries [2]. Unlike traditional cryptographic methods such as Data Encryption Standard (DES) scheme and Advanced Encryption Standard (AES) scheme, the Visual Cryptography (VC) scheme provides fast decryption without any complex computation [3]. Visual Cryptography (secret sharing scheme) is a modern cryptographic technique used to share the secret data in a secure pattern, maintained with utmost confidentiality. A sender transmits the secret data which is divided into shadows and it holds hidden information. When all of these shadows are aligned and stacked toget...

show abstract

Secret Image Sharing Scheme Based on a Boolean Operation

Cited by 16 publications

References 18 publications

A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion

A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion

Privacy‐preserving image retrieval in a distributed environment

An Optimized Secret Image Sharing Scheme Based on Ant Colony Optimization Algorithm

Contact Info

Product

Resources

About