Abstract
A secret sharing scheme based on one-dimensional bipermutive cellular automata is discussed in this paper. The underlying idea is to represent the secret as a configuration of a bipermutive CA and to iteratively apply a preimage computation algorithm until a sufficiently long configuration to be splitted among the participants is obtained. The scheme is proved to be both perfect and ideal, and a simple extension is shown to induce a sequential access structure which eventually becomes cyclic, where the upper bound on the length of the cycles depends on the radius of the adopted local rule.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blakley, G.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, pp. 313–317. AFIPS Press, Monval (1979)
del Rey, Á.M., Mateus, J.P., Sánchez, G.R.: A secret sharing scheme based on cellular automata. Appl. Math. Comput. 170(2), 1356–1364 (2005)
Eslami, Z., Ahmadabadi, J.Z.: A verifiable multi-secret sharing scheme based on cellular automata. Inf. Sci. 180(15), 2889–2894 (2010)
Eslami, Z., Razzaghi, S.H., Ahmadabadi, J.Z.: Secret image sharing based on cellular automata and steganography. Pattern Recogn. 43(1), 397–404 (2010)
Gutowitz, H.: Cryptography with dynamical systems. In: Goles, E., Boccara, N. (eds.) Cellular Automata and Cooperative Phenomena, pp. 237–274. Kluwer Academic Press (1993)
Marañón, G.Á., Encinas, L.H., del Rey, Á.M.: A multisecret sharing scheme for color images based on cellular automata. Inf. Sci. 178(22), 4382–4395 (2008)
Oliveira, G., Coelho, A., Monteiro, L.: Cellular automata cryptographic model based on bi-directional toggle rules. Int. J. Mod. Phys. C 15(8), 1061–1068 (2004)
Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)
Stinson, D.R.: Cryptography: theory and practice, 3rd edn. CRC Press, Boca Raton (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Mariot, L., Leporati, A. (2014). Sharing Secrets by Computing Preimages of Bipermutive Cellular Automata. In: Wąs, J., Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2014. Lecture Notes in Computer Science, vol 8751. Springer, Cham. https://doi.org/10.1007/978-3-319-11520-7_43
Download citation
DOI: https://doi.org/10.1007/978-3-319-11520-7_43
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11519-1
Online ISBN: 978-3-319-11520-7
eBook Packages: Computer ScienceComputer Science (R0)