Title: Fast-weighted secret image sharing
Authors: Lin, Sian-Jheng
Chen, Lee Shu-Teng
Lin, Ja-Chen
Department of Computer Science
Keywords: secret image sharing;Galois field;Lagrange polynomial;Chinese remainder theorem
Issue Date: 1-Jul-2009
Abstract: Thien and Lin [Comput. and Graphics 26(5), 765-770 (2002)] proposed a threshold scheme to share a secret image among n shadows: any t of the n shadows can recover the secret, whereas t-1 or fewer shadows cannot. However, in real life, certain managers probably play key roles to run a company and thus need special authority to recover the secret in managers' meeting. (Each manager's shadow should be more powerful than an ordinary employee's shadow.) In Thien and Lin's scheme, if a company has less than t managers, then manager's meeting cannot recover the secret, unless some managers were given multiple shadows in advance. But this compromise causes managers inconvenience because too many shadows were to be kept daily and carried to the meeting. To solve this dilemma, a weighted sharing method is proposed: each of the shadows has a weight. The secret is recovered if and only if the total weights (rather than the number) of received shadows is at least t. The properties of GF(2(r)) are utilized to accelerate sharing speed. Besides, the method is also a more general approach to polynomial-based sharing. Moreover, for convenience, each person keeps only one shadow and only one shadow index. (C) 2009 Society of Photo-Optical Instrumentation Engineers. [DOI: 10.1117/1.3168644]
URI: http://dx.doi.org/10.1117/1.3168644
ISSN: 0091-3286
DOI: 10.1117/1.3168644
Volume: 48
Issue: 7
End Page: 
Appears in Collections:Articles

Files in This Item:

  1. 000268489400035.pdf