跳到主要內容

臺灣博碩士論文加值系統

(3.95.131.146) 您好!臺灣時間:2021/07/26 04:31
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:藍永青
研究生(外文):Yung-Ching Lan
論文名稱:基於隨機網格之增值式視覺秘密分享
論文名稱(外文):Incrementing Visual Cryptography Using Random Grids
指導教授:王任瓚王任瓚引用關係
指導教授(外文):Ran-Zan Wang
學位類別:碩士
校院名稱:元智大學
系所名稱:資訊工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2009
畢業學年度:97
語文別:英文
論文頁數:42
中文關鍵詞:視覺式秘密分享隨機網格機密分享
外文關鍵詞:Visual CryptographyRandom GridsSecret Sharing
相關次數:
  • 被引用被引用:0
  • 點閱點閱:210
  • 評分評分:
  • 下載下載:2
  • 收藏至我的研究室書目清單書目收藏:0
視覺式秘密分享是一種圖像秘密的機密保護機制,其最大的特點為解密的過程是利用人眼來辨識機密,完全不需要任何電腦輔助的計算。傳統的視覺式秘密分享方法大都將整張圖像視為一體來處理,因此整張圖像的內容將被限制於一個單一機密等級。Wang等人[27]於2007年提出一個多層次的視覺式秘密分享,將一張圖像的內容分成n個層級,並編碼成n+1張分存圖像。這個方法隨著者參與解密的分存圖像增加,可揭露越多層級的機密資訊。此方法賦予視覺式秘密分享具備分享多個層級機密的功能,但仍有下列兩個弱點: (1)像素擴張量太大,(2)疊合圖像中不同機密層級的區域會出現不同的明亮對比,可能洩漏出尚未解出之機密數量與位置的蹤跡。
在本研究中,我們利用隨機網格的概念設計一個增值式的視覺式秘密分享。在所提出的方法中,機密圖像會被分割為屬於1至n機密層級的多個圖像區域,並且編碼成n+1張分存圖像。這個方法具有下列特性: (1)每一張分存圖像都看似雜訊,無法從中看出任何機密資訊,(2)每一張分存圖像都與原圖的大小一樣,(3)任t (2≦t≦n+1) 張分存圖像能還原t-1個層級的機密,(4)疊合所有的分存圖像可解密出全部的機密,(5)在疊合圖像中,尚未解碼的機密區域與數量是完全不可知的,(6)解碼的過程是由人眼來檢視疊合圖像中所呈現的訊息,不需要任何電腦輔助的計算。
Visual cryptography (VC) is an image-based secret protection mechanism in which the decoding process is conducted by inspecting the stacked shares with the unaided eye without any computation. In traditional VC schemes, the content of an image is usually processed as a single secret, which limits the whole image to a unique secret property. Recently, Wang et. al. [27] proposed a multilevel VC scheme in which the secrets on the original image are concealed in such a way that more levels of secrets are revealed when more shares are engaged in the decoding process. The scheme endows an image with multiple secret levels in VC applications; however, it also suffers from two weaknesses: (1) the pixel expansion is large, and (2) the contrast varies among the regions of different secret levels on the stacked images.
In this study, we propose a non-expansible VC scheme using the concept of random grids with the ability of incremental revealing of the secrets. In the proposed n-level incrementing VC using random grids, the secret image S is designated to multiple regions associated with n secret levels, and encrypted to n+1 shares which exhibits the following properties: (1) each share has noise-like appearance and cannot obtain any secret in S, (2) the size of each share is the same as S, (3) any t (2≦t≦n+1) shares can be used to reveal up to t-1 levels of secrets, (4) all secrets in S can be disclosed when all of the shares are available, (5) all of the regions containing not-revealed-yet secrets have same contrast with the background on the stacked shares, and (6) the decoding process is done by inspecting the well-stacked shares with unaided eye without computer computation.
摘要 i
Abstract ii
Chapter 1 Introduction 1
1.1 Background 1
1.2 Motivation 3
1.3 Thesis organization 4
Chapter 2 Related Work 5
2.1 Naor and Shamir’s visual cryptography scheme 5
2.2 Kafri and Keren’s scheme of Image Encryption by Random Grids 9
2.3 Multilevel visual cryptography 13
Chapter 3 The Proposed Method 16
3.1 The proposed n-level IVCRG 16
3.2 Construction of the 2-level IVCRG 19
3.3 Construction of the 3-level IVCRG 23
Chapter 4 Experimental results 29
Chapter 5 Conclusion and future work 39
Reference 40
1.M. Naor and A. Shamir, “Visual cryptography,” Advances in Cryptography: Eurocrypt’94, Springer, Berlin, pp. 1–12, 1995.
2.G. Ateniese, C. Blundo, A. De Santis, and D.R. Stinson, “Visual cryptography for general access structures,” Information and Computation, vol. 129, no. 2, pp. 86–106, 1996.
3.C. Blundo and A. De Santis and D.R. Stinson, “On the contrast in visual cryptography schemes,” Journal of Cryptology, vol. 12, pp. 261–289, 1999.
4.T. Hofmeister, M. Krause and H.U. Simon, “Contrast-optimal k out of n secret sharing schemes in visual cryptography,” Theoretical Computer Science, vol. 240, pp. 471–485, 2000.
5.C. Blundo, P.D. Arco, A. De Santis and D.R. Stinson, “Contrast optimal threshold visual cryptography schemes,” SIAM Journal on Discrete Mathematics, vol. 16, pp. 224–261, 2003.
6.D.Q. Viet and K. Kurosawa, “Almost ideal contrast visual cryptography with reversing,” Lecture Notes in Computer Science, vol. 2964, pp. 353–365, 2004.
7.S. Cimato, A. De Santis, A.L. Ferrara and B. Masucci, “Ideal contrast visual cryptography schemes with reversing,” Information Processing Letters, vol. 93, no. 4, pp. 199–206, 2005.
8.R. Ito, H. Kuwakado and H. Tanaka, “Image size invariant visual cryptography,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E82-A, no.10, pp. 2172–2177, 1999.
9.C.N. Yang, “New visual secret sharing schemes using probabilistic method,” Pattern Recognition Letters, vol. 25, no. 4, pp. 481–494, 2004.
10.C.N. Yang and T.S. Chen, “Aspect ratio invariant visual secret sharing schemes with minimum pixel expansion,” Pattern Recognition Letters, vol. 26, pp. 193–206, 2005.
11.Y.F. Chen, Y.K. Chan, C.C. Huang, M.H. Tsai and Y.P. Chu, “A multiple-level visual secret-sharing scheme without image size expansion,” Information Sciences, vol. 177, no. 21, pp. 4696–4710, 2007.
12.C.N. Yang and C.S. Laih, “New colored visual secret sharing schemes,” Designs, Codes and Cryptography, vol. 20, No. 3, pp. 325–335, 2000.
13.Y.C. Hou, “Visual cryptography for color images,” Pattern Recognition, vol. 36, no. 7, pp. 1619–1629, 2003.
14.C.C. Lin and W.H. Tsai, “Visual cryptography for gray-level images by dithering techniques,” Pattern Recognition Letters, vol. 24, pp. 349–358, 2003.
15.S.J. Shyu, “Efficient visual secret sharing scheme for color images,” Pattern Recognition, vol. 39, no. 5, pp. 866–880, 2006.
16.C.N. Yang and T.S. Chen, “Colored visual cryptography scheme based on additive color mixing,” Pattern Recognition, vol. 41, no. 10, pp. 3114–3129, 2008.
17.H.C. Wu and C.C. Chang, “Sharing visual multi-secrets using circle shares,” Computer standards and Interfaces, vol. 28, no. 1, pp. 123–135, 2005.
18.S.J. Shyu, S.Y. Huang, Y.K. Lee, R.Z. Wang and K. Chen, “Sharing multiple secrets in visual cryptography,” Pattern Recognition, vol. 40, pp. 3633–3651, 2007.
19.J.B. Feng, H.C. Wu, C.S. Tsai, Y.F. Chang and Y.P. Chu, “Visual secret sharing for multiple secrets,” Pattern Recognition, vol. 41, no. 12, pp. 3572–3581, 2008.
20.R. Lukac and K. N. Plataniotis, “Bit-level based secret sharing for image encryption,” Pattern Recognition, vol. 38, no. 5, pp. 767–772, 2005.
21.M. Naor and B. Pinkas, “Visual Authentication and Identification,” Lecture Notes in Computer Science, vol. 1294, pp. 322–336, 1997.
22.D.C. Lou, H. K. Tso and J. L. Liu, “A copyright protection scheme for digital images using visual cryptography technique,” Computer Standards and Interfaces, vol. 29, no. 1, pp. 125–131, 2007.
23.O. Kafri and E. Keren, “Encryption of pictures and shapes by random grids,” Optics Letters, vol. 12, no. 6, pp. 377–379, 1987.
24.S.J. Shyu, “Image encryption by random grids,” Pattern Recognition, vol. 40, no. 3, pp. 1014–1031, 2007.
25.S.J. Shyu, “Image encryption by multiple random grids,” Pattern Recognition, vol. 42, no. 7, pp. 1582–1596, 2009.
26.T.H. Chen, and K.H. Tsao, “Visual secret sharing by random grids revisited,” Pattern Recognition, vol. 42, no. 9, pp. 2203–2217, 2009.
27.R.Z. Wang, Y.K. Lee, S.Y. Huang and T.L. Chia, “Multilevel Visual Secret sharing,” The Second International Conference on Innovaive Computing, Information and Control, Kumamoto Japan, Sep. 2007.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊