Article

A secure scheme to share secret color images

Computer Physics Communications (Impact Factor: 2.41). 12/2005; 173:9-16. DOI: 10.1016/j.cpc.2005.07.002
Source: DBLP

ABSTRACT The main goal of this work is to study how discrete dynamical systems can be used to design secret sharing schemes. Specifically, the proposed scheme permits to share secret color images, and it is based on bidimensional cellular automata. The main idea is to analyze how a simple reversible model of computation allows one to compute the shares and then using the reverse computation in order to recover the secret image. Moreover, the proposed scheme exhibits good statistical properties.

0 Bookmarks
 · 
52 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Summary This paper presents a new visual cryptography scheme for secure digital transmission. Visual cryptography can be seen as a one-time pad system. Then, it cannot be reused. In this paper, we apply Diffie and Hellman (D-H) key agreement method and toral automorphism (TA) such that visual cryptography can be reused. Both secret and symmetry-key are represented in binary image. The proposed scheme is simple and easy to be implemented for shadow images. Therefore, it can be used in many electronic business applications.
    01/2008;
  • [Show abstract] [Hide abstract]
    ABSTRACT: The main goal of this work is to research how neighborhood configurations of two-dimensional cellular automata (2-D CA) can be used to design secret sharing schemes, and then a novel (n, n)-threshold secret image sharing scheme based on 2-D CA is proposed. The basic idea of the scheme is that the original content of a 2-D CA can be reconstructed following a predetermined number of repeated applications of Boolean XOR operation to its neighborhood. The main characteristics of this new scheme are: each shared image has the same size as the original one; the recovered image is exactly the same as the secret image, i.e., there is no loss of resolution or contrast; and the computational complexity is linear. Simulation results and formal analysis demonstrate the correctness and effectiveness of the proposed sharing scheme.
    Optics & Laser Technology 04/2012; 44(3):538–548. · 1.37 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Cellular automata have been used for design of cryptosystems. Recently some secret sharing schemes based on linear memory cellular automata have been introduced which are used for both text and image. In this paper, we illustrate that these secret sharing schemes are vulnerable to dishonest participants' collusion. We propose a cheating model for the secret sharing schemes based on linear memory cellular automata. For this purpose we present a novel uniform model for representation of all secret sharing schemes based on cellular automata. Participants can cheat by means of sending bogus shares or bogus transition rules. Cheaters can cooperate to corrupt a shared secret and compute a cheating value added to it. Honest participants are not aware of cheating and suppose the incorrect secret as the valid one. We prove that cheaters can recover valid secret by removing the cheating value form the corrupted secret. We provide methods of calculating the cheating value.
    01/2008;