研究生: |
劉毅成 Liu, Yi-Cheng |
---|---|
論文名稱: |
基於Shamir的(k, n)門檻方法之影像分享 Image Sharing Based on Shamir's (k, n) Threshold Scheme |
指導教授: |
陳朝欽
Chen, Chaur-Chin |
口試委員: | |
學位類別: |
碩士 Master |
系所名稱: |
電機資訊學院 - 資訊系統與應用研究所 Institute of Information Systems and Applications |
論文出版年: | 2011 |
畢業學年度: | 99 |
語文別: | 英文 |
論文頁數: | 25 |
中文關鍵詞: | 秘密分享 、影像分享 、(k, n)門檻方法 |
外文關鍵詞: | secret sharing, image sharing, (k, n) threshold scheme |
相關次數: | 點閱:3 下載:0 |
分享至: |
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
A typical technique of image sharing is that the dealer separates the secret image into n shared images and distributes them to n participants such that any k of them can recover the secret image while fewer than k shared images cannot get sufficient information to reveal the secret image. The idea of image sharing comes from the (k, n) threshold scheme independently investigated by Blakley and Shamir in 1979.
In this thesis, we implement a method of secret image sharing which is based on the concept of affine cipher and the idea of Thien and Lin’s scheme to get the permutation image and generate the shared images. In the proposed method, we choose two numbers, (a, b), as the key and use them to shuffle the pixel locations and meanwhile preserve the same histogram before the sharing step. The method scrambles the relative locations between the original pixels to avoid the exposure of silhouettes of shared images. Experiments with two different images and permutation keys are provided.
一般典型的秘密影像分享技術,是由一莊家將秘密影像切分成n張分享的子圖,並交由n位參與者保管,使得只要收集到其中任k張就能回復秘密影像,同時若少於k張則無法得知足夠的訊息去還原這張秘密影像。這個影像分享的觀念來自於1979年,由Blakley及Shamir所各別研究提出的(k, n)門檻方法。
在本篇論文中,我們提出一個方法來實作秘密影像分享,其中利用affine cipher的概念與林志青教授等所提出的架構,來得到重組後的影像與產生分享的子圖。在所提出的方法中,於分享的步驟前,我們選定(a, b)兩個數來當作鑰匙,並利用它們來對像素位置做洗牌,同時保有原來直方圖的分布。這個方法打亂了原來像素間的相關位置,避免使分享的子圖暴露出秘密影像的輪廓。我們提供了兩張影像與兩組重組鑰匙來做為實驗結果。
[Asmu1983] C. Asmuth and J. Bloom, “A modular approach to key safeguarding,” IEEE Transactions 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 Processing Societies, vol. 48, 313-317, 1979.
[Chan1998] C.C. Chang and R.J. Hwang, “Sharing secret images using shadow codebooks,” Information Sciences, vol. 111, no. 1-4, 335-345, 1998.
[Chan2002] C.C. Chang, C.S. Tsai, and T.S. Chen, “Sharing multiple secrets in digital images,” Journal of Systems and Software, vol. 64, no. 2, 163-170, 2002.
[Chan2008] C.C. Chang, Y.P. Hsieh, and C.H. Lin, “Sharing secrets in stego images with authentication,” Pattern Recognition, vol. 41, no. 10, 3130-3137, 2008.
[Chen2005] C.C. Chen, W.Y. Fu, and C.C. Chen, “ A Geometry-Based Secret Image Sharing Approach,” Proceedings of Image and Vision Computing New Zealand, 428-431, Dunedin, Otago, New Zealand, 2005.
[Chen2009] C.C. Chen, C.C. Chen, and Y.C. Lin, “Weighted modulated secret image sharing method,” Electronic Imaging, vol. 18, no. 4, 1-6, 2009.
[John1998] N.F. Johnson and S. Jajodia, “Exploring steganography: Seeing the Unseen,” IEEE Computer, vol. 31, no. 2, 26-34, 1998.
[Kuma2006] A. Kumar and N. Rajpal, “Secret Image Sharing Using Pseudo-Random Sequence,” International Journal of Computer Science and Network Security, vol. 6, no. 2b, 185-193, 2006.
[Lin2004] C.C. Lin and W.H. Tsai, “Secret image sharing with steganography and authentication,” Systems and Software, vol. 73, no. 3, 405-414, 2004.
[Naor1995] M. Naor and A. Shamir, “Visual Cryptography,” Advances in Cryptology: Eurpocrypt’94, Springer-Verlag, 1-12, 1995.
[Podi2001] C.I. Podilchuk and E.J. Delp, “Digital Watermarking: Algorithms and Applications,” IEEE Signal Processing Magazine, vol. 18, no. 4, 33-46, 2001.
[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,” Computers & Graphics, vol. 26, no. 1, 765-770, 2002.
[Thie2003] C.C. Thien and J.C. Lin, “An Image-Sharing method with user-friendly shadow images,” IEEE Transactions on Circuits and. Systems for Video Technology, vol. 13, no. 12, 1161-1169, 2003.
[Thie2004] C.C. Thien, J.C. Lin, and Y.S. Wu, “Sharing and hiding secret images with size constraint,” Pattern Recognition, vol. 37 no. 7, 1377-1385, 2004.
[Trap2006] W. Trappe and L.C. Washington, Introduction to Cryptography with Coding Theory, Pearson International Edition, 2006.
[Wang2006] R.Z. Wang and C.H. Su, “Secret image sharing with smaller shadow images,” Pattern Recognition Letters, vol. 27 no. 6, 551-555, 2006.
[Yang2007] C.N. Yang, K.H. Yu, and R. Lukac, “User-Friendly Image Sharing Using Polynomials with Different Primes,” Imaging Systems and Technology, vol. 17, no. 1, 40-47, 2007.
[Web01] http://en.wikipedia.org/wiki/Cryptography, last access on April 13, 2011.
[Web02] http://en.wikipedia.org/wiki/Secret_sharing, last access on April 4, 2011.
[Web03] http://en.wikipedia.org/wiki/Steganography, last access on April 16, 2011.