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.
[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.
[Show abstract][Hide abstract] ABSTRACT: In this work, the use of memory cellular automata to design a cryptographic protocol to provide assurance of digital images integrity is studied It is shown that the proposed protocol is secure against the adequate cryptanalytic attacks As a consequence, memory cellular automata seems to be suitable candidates to the design of hash functions.
Cellular Automata, 7th International Conference on Cellular Automata, for Research and Industry, ACRI 2006, Perpignan, France, September 20-23, 2006, Proceedings; 01/2006
[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.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.