簡易檢索 / 詳目顯示

研究生: 蔡明鴻
Tsai, Ming-Hong
論文名稱: 秘密影像分享技術之探討
A Study on Secret Image Sharing
指導教授: 陳朝欽
Chen, Chaur-Chin
口試委員: 陳煥宗
Chen, Hwann-Tzong
陳建彰
Chen, Chien-Chang
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年: 2013
畢業學年度: 101
語文別: 英文
論文頁數: 20
中文關鍵詞: 秘密分享技術秘密影像分享技術(k,n)門檻技術
外文關鍵詞: Secret sharing scheme, Secret image sharing scheme, (k,n)-threshold scheme
相關次數: 點閱:2下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 隨著網路通訊的持續成長,資訊安全已成為一項重要的課題,秘密影像分享技術就是一種能夠保護我們秘密影像的方法。這項技術也被稱為(k,n) 門檻方法,它將秘密影像切分成n張子影像,並交由n位參與者保管,當我們收集到任意k張以上的子影像時就能成功還原回秘密影像,但假如我們只收集到少於k張的子影像時,則無法獲得足夠的資訊來還原秘密影像。
    在這篇論文中,我們實作了三種現有的秘密影像分享的方法以及我們所提出的方法,這方法的主要精神是基於中國餘式定理來還原。跟其他方法相比,它需要較少的參數,但是需要一個額外的影像來確保我們能夠無失真的還原回秘密影像,而假如我們缺少這張影像,我們仍然可以還原出一張與秘密影像非常相似的影像。


    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.

    Chapter 1 Introduction....................................1 Chapter 2 Algorithms for Secret Image Sharing:A Review....4 2.1 Shamir-Based Method...................................4 2.2 Blakley-Based Method..................................6 2.3 Asmuth-Based Method...................................7 Chapter 3 Proposed Secret Image Sharing Method............9 3.1 The Proposed Secret Image Sharing Method..............9 3.2 The Proposed Secret Image Revealing Method...........10 3.3 Discussion...........................................11 Chapter 4 Experimental Results...........................12 4.1 Shamir-Based Method..................................13 4.2 Blakley-Based Method.................................15 4.3 Asmuth-Based Method..................................16 4.4 Proposed Secret Image Sharing Method.................17 4.5 Runtime of Different Methods.........................18 Chapter 5 Conclusion.....................................19 References...............................................20

    [Asmu1983] C. Asmuth and J. Bloom, “A Modular Approach to Key Safeguarding,” IEEE Trans. On Information Theory, Vol. 29, No. 2, 208-210, 1983
    [Blak1979] G.R. Blakley, “Safeguarding cryptographic keys,” Proceedings of the National Computer Conference, New York, American Federation of Information Proceeding Societies, Vol. 48, 313-317, 1979.
    [Sham1979] A. Shamir, “How to share a secret,” Communications of the ACM, Vol. 22, No.11, 612-613, 1979.
    [Thie2002] C.C. Thien and J.C. Lin, “Secret image sharing,” Computer & Graphics, Vol. 26, No.1 765-7710, 2002.
    [Ulut2009] M. Ulutas, V.V. Nabiyev, and G. Ulutas, “A New Secret Image Sharing Technique Based on Asmuth Bloom’s Scheme”, Application of Information and Communication Technologies, 1-5, 2009.
    [web01] http://mathworld.wolfram.com/LagrangeInterpolatingPolynomial.html, last access on March 7, 2013.
    [web02]
    http://en.wikipedia.org/wiki/Secret_sharing, last access on March 7, 2013.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE