A Study of Shamir-based Secret Image Sharing Approaches

碩士 === 玄奘大學 === 資訊科學學系碩士班 === 95 === A secret sharing scheme divides an important secret message to n shares for each participant. The important secret message cannot be reconstructed when we collect less than threshold shares, say t shares. That is, anyone observes no information about the secret m...

Full description

Bibliographic Details
Main Authors: Yu-Wei Chien, 簡祐緯
Other Authors: Chien-Chang Chen
Format: Others
Language:zh-TW
Published: 2007
Online Access:http://ndltd.ncl.edu.tw/handle/39273663286691269253
id ndltd-TW-095HCU08396001
record_format oai_dc
spelling ndltd-TW-095HCU083960012015-10-13T11:31:59Z http://ndltd.ncl.edu.tw/handle/39273663286691269253 A Study of Shamir-based Secret Image Sharing Approaches Shamir秘密分享於數位影像之研究 Yu-Wei Chien 簡祐緯 碩士 玄奘大學 資訊科學學系碩士班 95 A secret sharing scheme divides an important secret message to n shares for each participant. The important secret message cannot be reconstructed when we collect less than threshold shares, say t shares. That is, anyone observes no information about the secret message from only one share. A multi-secret sharing approach lets one participant reconstruct many secret messages from only one share. In this paper, we propose three methods for sharing digital images. In the first method, we can perfectly reconstruct the secret image. The second method can reconstruct many secret images when each participant only preserves one share. However, the reconstructed image is slightly different with the source image. In the third method, we adopt hash function to propose a multistage secret image sharing that the reconstructed image is consistent with the source image. Experimental results show that the proposed approach can reduce the possessing load efficiently but secure enough. Chien-Chang Chen 陳建彰 2007 學位論文 ; thesis 43 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 玄奘大學 === 資訊科學學系碩士班 === 95 === A secret sharing scheme divides an important secret message to n shares for each participant. The important secret message cannot be reconstructed when we collect less than threshold shares, say t shares. That is, anyone observes no information about the secret message from only one share. A multi-secret sharing approach lets one participant reconstruct many secret messages from only one share. In this paper, we propose three methods for sharing digital images. In the first method, we can perfectly reconstruct the secret image. The second method can reconstruct many secret images when each participant only preserves one share. However, the reconstructed image is slightly different with the source image. In the third method, we adopt hash function to propose a multistage secret image sharing that the reconstructed image is consistent with the source image. Experimental results show that the proposed approach can reduce the possessing load efficiently but secure enough.
author2 Chien-Chang Chen
author_facet Chien-Chang Chen
Yu-Wei Chien
簡祐緯
author Yu-Wei Chien
簡祐緯
spellingShingle Yu-Wei Chien
簡祐緯
A Study of Shamir-based Secret Image Sharing Approaches
author_sort Yu-Wei Chien
title A Study of Shamir-based Secret Image Sharing Approaches
title_short A Study of Shamir-based Secret Image Sharing Approaches
title_full A Study of Shamir-based Secret Image Sharing Approaches
title_fullStr A Study of Shamir-based Secret Image Sharing Approaches
title_full_unstemmed A Study of Shamir-based Secret Image Sharing Approaches
title_sort study of shamir-based secret image sharing approaches
publishDate 2007
url http://ndltd.ncl.edu.tw/handle/39273663286691269253
work_keys_str_mv AT yuweichien astudyofshamirbasedsecretimagesharingapproaches
AT jiǎnyòuwěi astudyofshamirbasedsecretimagesharingapproaches
AT yuweichien shamirmìmìfēnxiǎngyúshùwèiyǐngxiàngzhīyánjiū
AT jiǎnyòuwěi shamirmìmìfēnxiǎngyúshùwèiyǐngxiàngzhīyánjiū
AT yuweichien studyofshamirbasedsecretimagesharingapproaches
AT jiǎnyòuwěi studyofshamirbasedsecretimagesharingapproaches
_version_ 1716845813572829184