| Summary: | 碩士 === 銘傳大學 === 資訊工程學系碩士班 === 96 === In this thesis we study three problems in secret image sharing: (1) sharing multiple images in general access structures, (2) sharing multiple images using constant-size keys, and (3) sharing one image in a threshold structure by Chinese remainder theorem. We design novel schemes for these three problems.
For the first problem, our scheme, which is based on Shamir’s (n, n) threshold scheme, is the first result for sharing more than one secret image among participants with any given general access structure. One major disadvantage for this approach is that the sizes of the shadows for all participants may be different for a certain access structure. The second problem is meant to deals with this disadvantage so that each participant only takes a constant-size key, instead of various-size shadows. We propose schemes for threshold and general structures, respectively. This is a new development in secret image sharing in the view that the size of information distributed to each participant is so small that it is very easy to carry (or just to memorize).
Regarding the third problem, we devise two new threshold secret image sharing schemes. Applying Chinese remainder theorem, instead of following Shamir’s idea of using polynomial interpolation for secret sharing, reveal new possibilities in the area of secret image sharing.
The secrecy analyses of these schemes are discussed. We also implement our designs and the experimental results demonstrate the feasibility and applicability of the proposed schemes.
|
|---|
