Password Protected Visual Cryptography via Cellular Automaton Rule 30

  title={Password Protected Visual Cryptography via Cellular Automaton Rule 30},
  author={Roman V Yampolskiy and Jovan David Rebolledo M{\'e}ndez and Musa Hindi},
  journal={Trans. Data Hiding Multim. Secur.},
Visual cryptography depends on two shares. The initial configuration, extra security bits and the number of the rule for the CA along with the number of computed steps serve as a password for a visually encrypted image. The second share could contain a predefined pattern; the developed algorithm uses a snap- shot of a CA after a certain number of steps to generate the predefined share. Only one of these shares has to be random. The developed encryption system is a hybrid between visual and… 

Efficient multiple secret visual cryptography via CA-rule 30

  • M. YadavRanvijay
  • Computer Science
    2016 International Conference on Communication and Signal Processing (ICCSP)
  • 2016
A visual cryptography scheme that encodes a set of T >= 2 secrets into two rectangular shares that is efficient and more secure as compare to the existing multiple secret VC scheme, due to the less storage requirement and random pattern generation through cellular automata.

RGB Image Encryption through Cellular Automata, S-Box and the Lorenz System

The use of the PRNG bitstreams from both of the cellular automata and the Lorenz system, as keys, combined with the S-box results in the needed non-linearity and complexity inherent in well-encrypted images, which is sufficient to frustrate attackers.

Cellular Automata Based Image Authentication Scheme Using Extended Visual Cryptography

An authentication scheme is proposed in which no embedding into the cover images is performed and meaningful authentication shares are created using the watermark and cover images, which makes the scheme completely imperceptible.


A simple encryption technique, based on twodimensional cellular automata has been proposed, in which the local neighborhood pixel values of an image are used as part of the encryption key to encrypt the image,based on certain cellular Automata rules.

Secret Image Sharing Over Cloud Using One-Dimensional Chaotic Map

A simple method to secure an image for privacy-preserving storage over cloud infrastructure using one-dimensional chaotic logistic map to divide the secret image into two shares such that no image information is revealed.

On the origin of synthetic life: attribution of output to a particular algorithm

The problem of determining origin of samples is presented as a generalized version of Darwin's original problem, showing that the problem is in fact unsolvable, in the general case, if computational resources of considered originator algorithms have not been limited and priors for such algorithms are known to be equal.

Detecting Qualia in Natural and Artificial Agents

It is shown that computers are at least rudimentarily conscious with potential to eventually reach superconsciousness, and a test for confirming certain subjective experiences in a tested agent is introduced.

Guidelines for Artificial Intelligence Containment

A number of guidelines are proposed which should help AI safety researchers to develop reliable sandboxing software for intelligent programs of all levels to make it possible to study and analyze intelligent artificial agent while maintaining certain level of safety.



Novel authentication system using visual cryptography

This paper aims to provide a comparative study of various Visual Cryptographic schemes based on pixel expansion, no of shares, size and quality of reconstructed image, etc and some real-life applications of visual cryptography.

Encryption of cell-oriented computer generated hologram by using visual cryptography

A secret management scheme in which important information is distributed to plural members of a group and then can be accessed only with the authorization under the agreements of the members, has

Encryption of cell-oriented computer generated hologram by using visual cryptography

A secret management scheme in which important information is distributed to plural members of a group and then can be accessed only with the authorization under the agreements of the members, has

Cellular automata computations and secret key cryptography

Visual Cryptography

A new type of cryptographic scheme, which can decode concealed images without any cryptographic computations, is considered, which is perfectly secure and very easy to implement.

Halftone visual cryptography

The proposed method utilizes the void and cluster algorithm to encode a secret binary image into n halftone shares (images) carrying significant visual information, and shows that the visual quality of the obtained halftones are observably better than that attained by any available visual cryptography method known to date.

Contrast-Enhanced Visual Cryptography Schemes Based on Additional Pixel Patterns

By using additional pixel patterns for the white pixels, the contrast of the reconstructed secret image can be improved than in the case of existing visual cryptography schemes.

Visual cryptography and threshold schemes

This article presents some background to traditional secret-sharing schemes, then explains visual schemes, describing some of the basic construction techniques used, and topics discussed include: two out of two scheme,Two out of n schemes, and graph access structures.

Self-Adaptive Image Encryption Based on Memory Cellular Automata

Simulation results on some gray level images confirm that the proposed algorithm can be realized easily while guaranteeing high security and sensitivity levels, and other properties such as randomness.

Secure Identification Documents Via Pattern Recognition and Public-Key Cryptography

We present an approach to authenticating photo-ID documents that relies on pattern recognition and public-key cryptography and has security advantages over physical mechanisms that currently