Sharing secret color images using cellular automata with memory
| dc.creator | Alvarez, Gonzalo | |
| dc.creator | Hernandez, Luis | |
| dc.creator | Martin, Angel | |
| dc.date | 2003-12-17 | |
| dc.date.accessioned | 2026-07-07T03:20:44Z | |
| dc.date.available | 2026-07-07T03:20:44Z | |
| dc.description | A {k,n}-threshold scheme based on two-dimensional memory cellular automata is proposed to share images in a secret way. This method allows to encode an image into n shared images so that only qualified subsets of k or more shares can recover the secret image, but any k-1 or fewer of them gain no information about the original image. The main characteristics of this new scheme are: each shared image has the same size that the original one, and the recovered image is exactly the same than the secret image; i.e., there is no loss of resolution. | |
| dc.description | 17 pages, 6 figures, LaTeX format | |
| dc.identifier | https://arxiv.org/abs/cs/0312034 | |
| dc.identifier | http://arxiv.org/abs/cs/0312034 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31932 | |
| dc.subject | Cryptography and Security | |
| dc.subject | I.4.9 | |
| dc.title | Sharing secret color images using cellular automata with memory | |
| dc.type | text |