A secret sharing scheme based on cellular automata

Rey, Ángel Martín del; Mateus, Joaquim P.; Sánchez, Gerardo Rodríguez

doi:10.1016/j.amc.2005.01.026

Cited by 46 publications

(11 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Generally, in recovering phase, any − 1 or fewer shadows cannot provide sufficient information to restore the original secret image. For the proof of this feature, please refer to Section 3.2 in the scheme of [31].…”

Section: Analysis Of the Embeddable Capacity Embedding Ways And Othmentioning

confidence: 99%

A Reversible Steganography Scheme of Secret Image Sharing Based on Cellular Automata and Least Significant Bits Construction

Guo

et al. 2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Secret image sharing schemes have been extensively studied by far. However, there are just a few schemes that can restore both the secret image and the cover image losslessly. These schemes have one or more defects in the following aspects: (1) high computation cost; (2) overflow issue existing when modulus operation is used to restore the cover image and the secret image; (3) part of the cover image being severely modified and the stego images having worse visual quality. In this paper, we combine the methods of least significant bits construction (LSBC) and dynamic embedding with one-dimensional cellular automata to propose a new lossless scheme which solves the above issues and can resist differential attack and support parallel computing. Experimental results also show that this scheme has the merit of big embedding capacity.

show abstract

Section: Analysis Of the Embeddable Capacity Embedding Ways And Othmentioning

confidence: 99%

A Reversible Steganography Scheme of Secret Image Sharing Based on Cellular Automata and Least Significant Bits Construction

Guo

et al. 2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Using linear memory cellular automata, a secret sharing scheme has been proposed initially by [5]. As the scheme is a (t,n)-threshold one, the secret is considered as an initial configuration of a t-order LMCA, while remaining (t-1) configurations are randomly generated.…”

Section: Secret Sharing Using Lmcasmentioning

confidence: 99%

“…The set {C 0 ,C 1 ,.....,C t-1 } is then used to build an (n+t-1)-th order evolution of the LMCA to obtain a set of n consecutive configuration {C t ,C t+1 ,.....,C n+t-1 } distributed among the n participants. When required, any set of t consecutive configurations {C t+ ,C t++1 ,.....,C 2t+-1 } is used to define a set {̃( 0) ,̃( 1) , … ,̃( −1) } as the initial configuration to run the inverse LMCA backward for +t iterations and recover the secret [5]. The set of t-1 transition rules used for the LMCA evolution 1, 2,....., t-1 is generated initially by the dealer and made public without affecting the security of the scheme.…”

Section: Secret Sharing Using Lmcasmentioning

confidence: 99%

“…The LMCA model provides linear complexity for both sharing and reconstruction phases, and leads to best runtime performances for large-scaled secrets. The first attempt for using LMCA in secret sharing has been proposed in [5] by considering the secret as an initial configuration of a t-order LMCA, and randomly generate the remaining (t-1) configurations. The evolution of the constructed LMCA produces n consecutive configurations used to define the n different shares distributed among the n participants.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Designing Robust LMCA-based Threshold Secret Sharing Scheme for Digital Images Using Multiple Configurations Assignment

Anani

Faraoun

2015

JCOMSS

View full text Add to dashboard Cite

In this paper, we present a new (t,n)-threshold secret images sharing scheme based on linear memory cellular automata (LMCA). While all existing LMCA-based sharing scheme are not robust, the proposed one provides full robustness property. Precisely, any subset of t participants can collude to recover the shared secret, in contrast to existing LMCA-based schemes when this is possible only for participants having consecutive shares. To achieve robustness, produced shares are constructed using subsets of different LMCA’s configurations instead of using single ones. The subsets are defined according to an assignments matrix that is generated using a specific heuristic. The proposed scheme is shown to be robust, and its security is experimentally evaluated with respect to the problem of secret color image sharing. Obtained results illustrate the secrecy of the produced shares, while comparison gives an accurate evaluation with respect to existing schemes.

show abstract

“…In [10], a particular type of discrete dynamical system called one-dimensional memory cellular automata, denoted for short by CA, is used to design a (t, n)-threshold scheme in which at least t consecutive shares are needed to reconstruct the secret. In [6], these structures are employed in the context of secret image sharing with steganographic properties.…”

Section: Introductionmentioning

confidence: 99%