English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/15958
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Graphic multi-secret sharing schemes with one-dimensional cellular automata

AuthorsHernández Encinas, Luis; Hernández Álvarez, Fernando; Durán Díaz, Raúl
KeywordsGraphic cryptography
Multi-secret sharing schemes
One-dimensional cellular automata
Issue DateJul-2009
AbstractA multi-secret sharing scheme, which is based on one-dimensional reversible cellular automata with memory, allowing any member of a set of participants to share a secret color image with the rest of participants is presented. Moreover, it is also explained that with this scheme, any participant is able to recover all the secret color images if and only if the whole set of participants pools their shadows. Finally, the security of the multi-secret sharing scheme is studied and it is proved that the protocol withstands the most important attacks. In particular, it is secure against any statistical attack.
DescriptionIn: The 2009 World Congress in Computer Science, Computer Engineering, and Applied Computing (WORLDCOMP'09), The 2009 International Conference on Security and Management (SAM'09), Vol II, Proceedings 576--582. H.R. Arabnia and K. Daimi (Eds.), Las Vegas (USA), July, 2009
Appears in Collections:(IFA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
SAM3264.pdf1,37 MBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.