Image communication scheme based on dynamic visual cryptography and computer generated holography

Palevicius, Paulius; Ragulskis, Minvydas

doi:10.1016/j.optcom.2014.09.041

Cited by 16 publications

(8 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other researchers also proposed DVC scheme for assessing chaotic oscillations [75]. In addition to being able to protect multiple secrets, another advantage of DVC is that its recovered images have high contrast but it suffers from high memory complexity which reduces its effectiveness for real-time applications [71].…”

Section: Number Of Secretsmentioning

confidence: 99%

See 1 more Smart Citation

An overview of visual cryptography techniques

Ibrahim

Teh

Abdullah

2021

Multimed Tools Appl

View full text Add to dashboard Cite

Visual cryptography is an encryption technique that decomposes secret images into multiple shares. These shares are digitally or physically overlapped to recover the original image, negating the need for complex mathematical operations or additional hardware. There have been many variations of visual cryptography proposed over the years, each addressing different problems or to fulfill different security requirements. Existing review papers on the area only cover certain types of visual cryptography or lack comparisons between the various schemes. To address this gap, this paper provides broad overview of the area to aid new researchers in identifying research problems or to select suitable visual cryptography methods for their desired applications. For more veteran researchers in the area, our paper provides the most up-to-date coverage of the state-of-the-art. We first provide an introduction to the various categories of visual cryptography techniques, including a discussion on recently proposed schemes. These schemes are then compared in terms of their features, performance metrics, advantages and disadvantages. Compared to prior work, we extend the number of comparison metrics to include signal-to-noise ratio and the type of shares. Over 40 visual cryptography schemes that have been proposed in the past two decades were analyzed and compared. Our findings indicate that existing problems such as pixel expansion, poor quality of recovered image quality, computational and memory complexities still exist, and a optimizing the trade-off between these requirements still requires further investigation. We conclude the paper with a discussion of these open problems and future research directions.

show abstract

Section: Number Of Secretsmentioning

confidence: 99%

“…Although there are schemes that are able to encrypt multiple secrets, they are either inefficient or are difficult to use [31,55,61,71,74,75,102]. For example, schemes that involve rotating shares may lead to decryption errors when the rotation angles are inaccurate [41].…”

Section: Open Problems and Directionsmentioning

confidence: 99%

An overview of visual cryptography techniques

Ibrahim

Teh

Abdullah

2021

Multimed Tools Appl

View full text Add to dashboard Cite

show abstract

“…al. [4] "Image communication scheme based on dynamic visual cryptography and computer generated holography" This paper proposes the mixture of dynamic visual cryptography (an optical technique supported the interaction of visual cryptography and time-averaging geometric moiré) with Gerchberg-Saxton algorithmic rule. A stochastic moiré grating is employed to plant the secret into one cover image.…”

Section: Literature Surveymentioning

confidence: 99%

A Review Report on Time Domain-Attribute-based Access Control for Video substance distribution: A Cryptographic Approach

Gaurav¹,

Gupta²

2017

IJCA

View full text Add to dashboard Cite

Visual cryptography encodes a secret binary image (SI) keen on share of unsystematic binary sample. If the share is xeroxed against transparencies, the key figure is often visually decrypted by means that of superimposing a skilled subset of transparencies, however no secret data is obtained from the superposition of a forbidden subset. The binary model of the N allocates, although, contain no visual consequence and hinder the objectives of visual cryptography. The perfect security condition of VC scheme needs the strict demand where any t-1 or fewer transparencies cannot extract much knowledge regarding the key. The secret image is at the same time embedded into color halftone shares. Visual cryptography (VC) could be a secret sharing method of decay a secret picture into n transparencies, and consequently the stack of any t out of n transparencies disclose the key content. A HVC generate procedure is projected that can make an option for secret halftone image into color half-tone shares. In [1], authors centre of attention how to securely distribute video contents to an assured collection of persons for the period of a testing time period in cloud-based multimedia systems, and propose a cryptographic come within reach of, a provably secure time domain attribute-based access control (TAAC) scheme, to secure the cloud-based video content sharing.

show abstract

“…SS has many application scenarios, such as access control, transmitting passwords, cloud computing security, block chain security, distributed storage system, etc. [3][4][5][6].…”

Section: Introductionmentioning

confidence: 99%

Lossless and Efficient Secret Image Sharing Based on Matrix Theory Modulo 256

et al. 2020

View full text Add to dashboard Cite

Most of today’s secret image sharing (SIS) schemes are based on Shamir’s polynomial-based secret sharing (SS), which cannot recover pixels larger than 250. Many exiting methods of lossless recovery are not perfect, because several problems arise, such as large computational costs, pixel expansion and uneven pixel distribution of shadow image. In order to solve these problems and achieve perfect lossless recovery and efficiency, we propose a scheme based on matrix theory modulo 256, which satisfies ( k , k ) and ( k , k + 1 ) thresholds. Firstly, a sharing matrix is generated by the filter operation, which is used to encrypt the secret image into n shadow images, and then the secret image can be obtained by matrix inverse and matrix multiplication with k or more shadows in the recovery phase. Both theoretical analyses and experiments are conducted to demonstrate the effectiveness of the proposed scheme.

show abstract

Image communication scheme based on dynamic visual cryptography and computer generated holography

Cited by 16 publications

References 23 publications

An overview of visual cryptography techniques

An overview of visual cryptography techniques

A Review Report on Time Domain-Attribute-based Access Control for Video substance distribution: A Cryptographic Approach

Lossless and Efficient Secret Image Sharing Based on Matrix Theory Modulo 256

Contact Info

Product

Resources

About