A Study on Secret Image Sharing

碩士 === 國立清華大學 === 資訊工程學系 === 101 === The information security is more and more important while the internet communication grows up, so the secret image sharing technique will be a useful method to protect our secret. This technique, also called (k,n) threshold scheme, distributes secret image to...

Full description

Bibliographic Details
Main Authors: Tsai, Ming-Hong, 蔡明鴻
Other Authors: Chen, Chaur-Chin
Format: Others
Language:en_US
Published: 2013
Online Access:http://ndltd.ncl.edu.tw/handle/92975334403435944121
id ndltd-TW-101NTHU5392039
record_format oai_dc
spelling ndltd-TW-101NTHU53920392015-10-13T22:06:57Z http://ndltd.ncl.edu.tw/handle/92975334403435944121 A Study on Secret Image Sharing 秘密影像分享技術之探討 Tsai, Ming-Hong 蔡明鴻 碩士 國立清華大學 資訊工程學系 101 The information security is more and more important while the internet communication grows up, so the secret image sharing technique will be a useful method to protect our secret. This technique, also called (k,n) threshold scheme, distributes secret image to n shadow images which can be preserved by n participants, and we can reveal the secret image by any more than k of the shadow images. If we only collect fewer than k shadow images, we cannot get sufficient information to reveal the secret image. In this thesis, we implement three existing secret sharing method and the proposed method. The main idea of the proposed method is based on Chinese Remainder Theorem. It needs fewer parameters than other methods but needs an additional image to ensure we can completely reveal the secret image. However, if we do not have this image, we still can reveal a very similar image. Chen, Chaur-Chin 陳朝欽 2013 學位論文 ; thesis 20 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 國立清華大學 === 資訊工程學系 === 101 === The information security is more and more important while the internet communication grows up, so the secret image sharing technique will be a useful method to protect our secret. This technique, also called (k,n) threshold scheme, distributes secret image to n shadow images which can be preserved by n participants, and we can reveal the secret image by any more than k of the shadow images. If we only collect fewer than k shadow images, we cannot get sufficient information to reveal the secret image. In this thesis, we implement three existing secret sharing method and the proposed method. The main idea of the proposed method is based on Chinese Remainder Theorem. It needs fewer parameters than other methods but needs an additional image to ensure we can completely reveal the secret image. However, if we do not have this image, we still can reveal a very similar image.
author2 Chen, Chaur-Chin
author_facet Chen, Chaur-Chin
Tsai, Ming-Hong
蔡明鴻
author Tsai, Ming-Hong
蔡明鴻
spellingShingle Tsai, Ming-Hong
蔡明鴻
A Study on Secret Image Sharing
author_sort Tsai, Ming-Hong
title A Study on Secret Image Sharing
title_short A Study on Secret Image Sharing
title_full A Study on Secret Image Sharing
title_fullStr A Study on Secret Image Sharing
title_full_unstemmed A Study on Secret Image Sharing
title_sort study on secret image sharing
publishDate 2013
url http://ndltd.ncl.edu.tw/handle/92975334403435944121
work_keys_str_mv AT tsaiminghong astudyonsecretimagesharing
AT càimínghóng astudyonsecretimagesharing
AT tsaiminghong mìmìyǐngxiàngfēnxiǎngjìshùzhītàntǎo
AT càimínghóng mìmìyǐngxiàngfēnxiǎngjìshùzhītàntǎo
AT tsaiminghong studyonsecretimagesharing
AT càimínghóng studyonsecretimagesharing
_version_ 1718073796062085120