No Access

A (2, n)-SECRET SHARING SCHEME BASED ON LINEAR CELLULAR AUTOMATA

Department of Applied Mathematics, E. P. S. de Ávila, Universidad de Salamanca, C/Hornos Caleros 50, 05003-Ávila, Spain

Department of Applied Mathematics, E. T. S. I. I. de Béjar, Universidad de Salamanca, Avda. Fernández Ballesteros 2, 37700-Béjar, Salamanca, Spain

Search for more papers by this author

, and

G. RODRÍGUEZ SÁNCHEZ

Department of Applied Mathematics, E. P. S. de Zamora, Universidad de Salamanca, Avda. Requejo 33, 49022-Zamora, Spain

Search for more papers by this author

https://doi.org/10.1142/S0129183108013072Cited by:0 (Source: Crossref)

Abstract

An algorithm to share a secret among a set of users is introduced in this work. It is based on the use of linear cellular automata over the finite set 𝔽₂ and it is considered as a generalization of a previous work due to the authors dealing with an elementary cellular automata-based secret sharing scheme. The algorithm is shown to be secure, ideal, and perfect.

Keywords:

PACS: 05.65.+b, 89.70.+c, 89.75.-k

You currently do not have access to the full text article.
Recommend the journal to your library today!

References

C. Asmuth and J. Bloom, IEEE T. Inform. Theory 29, 208 (1983), DOI: 10.1109/TIT.1983.1056651. Web of Science, Google Scholar
G. R. Blakley, Proc. AFIPS48 (1979) p. 313. Google Scholar
P. Chaudhuri et al. , Additive Cellular Automata. Theory and Applications 1 ( IEEE Computer Society Press , Los Alamitos , 1997 ) . Google Scholar
E. D. Karnin, J. W. Greene and M. E. Hellman, IEEE T. Inform. Theory 29, 35 (1983), DOI: 10.1109/TIT.1983.1056621. Web of Science, Google Scholar
A. M. del Rey, J. P. Mateus and G. R. Sánchez, Appl. Math. Comput. 170, 1356 (2005). Web of Science, Google Scholar
A. M. del Rey and G. R. Sánchez, Int. J. Mod. Phys. C 18, 1707 (2007), DOI: 10.1142/S0129183107011613. Link, Web of Science, ADS, Google Scholar
A. Shamir, Commun. ACM 22, 612 (1979), DOI: 10.1145/359168.359176. Web of Science, Google Scholar