Title of article
A verifiable multi-secret sharing scheme based on cellular automata
Author/Authors
Z. Eslami، نويسنده , , J. Zarepour Ahmadabadi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
6
From page
2889
To page
2894
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
Secret image sharing , Cryptographic protocol , Discrete Logarithm Problem , Cellular automata , secret sharing scheme
Journal title
Information Sciences
Serial Year
2010
Journal title
Information Sciences
Record number
1214020
Link To Document