A verifiable multi-secret sharing scheme based on cellular automata

  • Authors:
  • Z. Eslami;J. Zarepour Ahmadabadi

  • Affiliations:
  • Department of Computer Science, Shahid Beheshti University, Tehran, Iran;Department of Computer Science, Shahid Beheshti University, Tehran, Iran

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2010

Quantified Score

Hi-index 0.07

Visualization

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. Hernandez Encinas, A. Martin del Rey, A multisecret sharing scheme for color images based on cellular automata, Information Sciences 178 (2008) 4382-4395].