Proceedings of 2010 Cross-Strait Conference on Information Science and Technology (CSCIST 2010 E-BOOK)

Qinhuangdao,China,7.9-7.13,2010

ISBN: 978-1-935068-15-0 Scientific Research Publishing, USA

E-Book 840pp Pub. Date: July 2010

Category: Computer Science & Communications

Price: $120

Title: Essential Secret Image Sharing Scheme
Source: Proceedings of 2010 Cross-Strait Conference on Information Science and Technology (CSCIST 2010 E-BOOK) (pp 471-474)
Author(s): Chien-chang Chen, Department of Information Management, Hsuan Chuang University, Hsinchu
Abstract: This paper presents an essential secret image sharing scheme that essential shared images are necessary in recovering the secret image. A (s, t, n) essential secret image sharing scheme shares a secret image to two kinds of shared images, essential and non-essential ones, and number of total shared image is n. Two criteria are needed to recover the secret image. Firstly, the number of essential images is at least s. Secondly, the number of collect shared images, including essential and non-essential ones, is at least t. An essential participant possesses a shared image from the secret image and another shared data from a created random seed. A non-essential shared image is obtained from XOR result of a shared image and the random image that is generated from previous seed. First step in recovering algorithm recovers the random seed from s essential shared images so as to acquire the random image for non-essential shared images. Second step gathers t shared images to recover the secret image. Experimental results reveal that the proposed method distinguishes essential and non-essential shared images and keeps the essential shared images necessary in recovering the secret image.
Free SCIRP Newsletters
Copyright © 2006-2024 Scientific Research Publishing Inc. All Rights Reserved.
Top