| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 394182 | Information Sciences | 2010 | 6 Pages |
Abstract
In this paper, we propose a verifiable (t, n)-threshold multi-secret sharing scheme, based on one-dimensional cellular automata where the number of secrets is not restricted by n or t. We show that our scheme can be used to solve an open problem proposed recently in Alvarez et al. (2008) [G. Alvarez, L. Hernández Encinas, A. Martín del Rey, A multisecret sharing scheme for color images based on cellular automata, Information Sciences 178 (2008) 4382–4395].
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Z. Eslami, J. Zarepour Ahmadabadi,