Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/24300
標題: 具可調視覺品質的新型門檻式視覺機密分享機制之研究
A Study of Novel Threshold Visual Secret Sharing with Adaptive Visual Quality
作者: 鄭子豪
Cheng, Tzu-hao
關鍵字: 視覺機密分享;Visual secret sharing;視覺密碼;可調解密對比度;門檻式視覺機密分享;Visual cryptography;Contrast adaptive;Threshold secret sharing
出版社: 資訊管理學系所
引用: 參考文獻 [1] M. Naor, A. Shamir, “Visual cryptography,” Advances in Cryptology — EUROCRYPT''94.Lecture Notes in Computer Science, pp. 1-12, 1995. [2] O. Kafri, E. Keren, “Encryption of pictures and shapes by random grids,” Optics Letters, pp. 377–379, 1987. [3] C.N. Yang, “New Visual Secret Sharing Schemes with Non-Expansible Shadow Size Using Non-binary Sub Pixel,” National Computer Symposium on Information Security, pp. F074-F085, 2001. [4] Y.C. Hou, Z.Y. Quan, “Progressive Visual Cryptography with Unexpanded Shares,” IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, pp. 1760-1764, 2011. [5] G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson,, “Visual cryptography for general access structures,” Inf. Comput, pp. 86–106, 1996. [6] Y.C. Hou, “Visual cryptography for color images,” Pattern Recognition, pp. 1619-1629, 2003. [7] D.C. Lou, H.H. Chen, H.C. Wu, C.S. Tsai, “A novel authenticatable color visual secret sharing scheme using non-expanded meaningful shares,” Displays, pp. 118-134, July 2011. [8] J.B. Feng, H.C. Wu, C.S. Tsai, Y.F. Chang, Y.P. Chu, “Visual secret sharing for multiple secrets,” Pattern Recognition, pp. 3572-3581, 2008. [9] S.J. Shyu, K. Chen, “Visual multiple secret sharing based upon turning and flipping,” Information Sciences, pp. 3246-3266, 2011. [10] S.J. Shyu, S.Y. Huang, Y.K. Lee, R.Z. Wang and K. Chen, “Sharing multiple secrets in visual cryptography,” Pattern Recognition, pp. 3633-3651, 2007. [11] T.L. Lin, S.J. Horng, K.H. Lee, P.L. Chiu, T.W. Kao, Y.H. Chen,R.S. Run, J.L. Lai, R.J. Chen, “A novel secret sharing scheme for multiple secrets without pixel expansion,” Expert System with Applications, pp. 7858–7869, 2010. [12] C.C. Chang, Y.H. Chen, H.C. Wang, “Meaningful secret sharing technique with authentication and remedy abilities,” Information Sciences, pp. 3073-3084, 2011. [13] T.H. Chen, K.H. Tsao,Y.T. Yang, “Friendly Color Visual Secret Sharing by Random Grids,” Fundamenta Informaticae, pp. 61-70, 2010. [14] R.Z. Wang, Y.F. Chien, Y.Y. Lin, “Scalable user-friendly image sharing,” Visual Communication and Image Representation, pp. 751-761, 2010. [15] Z Wang, G.R. Arce, G. D. Crescenzo, “Halftone visual cryptography via error diffusion,” IEEE Transactions on Information Forensics and Security, pp. 109 - 112, 2009. [16] W.K. Chen, “Image sharing method for gray-level images,” The Journal of Systems and Software, pp. 581–585, 2012. [17] H.C. Lin, C.N. Yang, C.S. Laih, H.T. Lin, “Natural language letter based visual cryptography scheme,” Journal of Visual Communication and Image Representation, pp. 318-331, 2013. [18] S. Rawat, B. Raman, “blind watermarking algorithm based on fractional Fourier transform and visual cryptography,” Signal Processing, pp. 1480-1491, 2012. [19] T.H. Chen, K.H. Tsao, “User-friendly random-grid-based visual secret sharing,” IEEE Transactions on Circuits and Systems for Video Technology, pp. 1693-1703, 2011. [20] K.H. Lee, P.L. Chiu, “An Extended Visual Cryptography Algorithm for General Access Structures,” IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, pp. 219-229, 2012. [21] L. Bandamneni, V. Venkata Rao, “Color Extended Visual Cryptography Using Error Diffusion,” International Journal of Electronics and Computer Science Engineering, pp. 1176-1182, 2011. [22] C.S. Hsu, S.F. Tu, “Digital Watermarking Scheme with Visual Cryptography,” International MultiConference of Engineers and Computer Scientists, pp. 659, 2008. [23] R.Z. Wang, Y.C. Lan, Y.K. Lee, S.Y. Huang, S.J. Shyu, T.L. Chia, “Incrementing visual cryptography using random grids,” Optics Communications, pp. 4242-4249, 2010. [24] H.C. Wu, C.C. Chang, “Sharing visual multi-secrets using circle shares,” Computer Standards & Interfaces 28, pp. 123–135, 2005.. [25] S.K. Chen, S.J. Lin, “Optimal (2,n) and (2,infinity) visual secret sharing by generalized random grids,” Journal of Visual Communication and Image Representation, pp. 677–684, 2013. [26] K.H. Lee, P.L. Chiu, "A high contrast and capacity efficient visual cryptography scheme for the encryption," Optics Communications, pp. 2730–2741, November 2011. [27] T.H. Chen, K.H. Tsao, Y.S. Lee, “Yet another multiple-image encryption by rotating random grids,” Signal Processing, pp. 2229–2237, 2012. [28] Y.J. Huang, C.C. Lee, H.C. Wu, J. D. Chang, C.S. Tsai and Y.T. Tsao, “Novel Non-expanded Visual Cryptography Scheme with Block Encoding,” Journal of computers, pp. 61-71, 2011. [29] T.H. Chen, K.H. Tsao, “Threshold visual secret sharing by random grids,” The Journal of Systems and Software, pp. 1197-1208, 2011. [30] T.H. Chen, Y.S. Lee, "Quality-adaptive visual secret sharing by random grids," The Journal of Systems and Software, pp. 1267–1274, 2013. [31] T.H. Cheng, J.D. Chang, “Non-expended and Authority Identifiable Visual Secret Sharing Scheme,” 2nd. International Conference on Applied and Theoretical Information Systems Research, 2012.
摘要: 
在各種不同的加密機制中,視覺機密分享機制(Visual Secret Sharing; VSS)有別於一般密碼學,能在不需任何計算的前提下,利用人類視覺將機密進行解碼。視覺機密分享機制將機密訊息編碼成數張分享影像(share, shadow),在解碼時僅需將不同的分享影像進行疊合,利用兩種不同顏色的性質控影響通過分享影像之光線,使人類視覺直接解讀機密影像。然而傳統視覺機密分享機制在新應用上常存在著像素擴展、分享影像數量較少以及解密時無法控制調整解密門檻數等問題。
為解決新應用領域上的問題,本文提出了具可調視覺品質的新型門檻式視覺機密分享機制,此方法仍具有傳統視覺機密分享機制的優點,並能產生多張分享影像,於不同的分享影像數量需求下,亦可調整被重建機密的較佳的對比度,當解密對比度可調整較高時,在疊合任兩張分享影像時顯示清晰的重建影像,並附帶漸進式的解密特性,使分享影像疊合越多時,機密重建結果的影像品質越高;當解密對比度需求較低時,可提供如門檻的分享影像解密機制,解密時需要湊足一定數量門檻的分享影像才能解密,增加管理彈性。
對於本論文的研究方法,經過實際操作並與相似方法比較,證實本研究能在可調整解密對比度與解密門檻的情況下安全地將機密影像編碼成多張分享影像。一般門檻式視覺機密分享機制Threshold-(k,n)理論上可提供在n張分享影像中須取得k張分享影像才能解密的視覺機密分享機制,實際應用能提供編碼四張分享影像以上的(k,n)門檻式機密分享機制,同時在各種分享影像張數的設定下,能夠調整重建的對比度,並具良好的視覺可讀性,相對於Chen與Tsao等學者之研究均有較高的效益。

In the variety of encoding methods, visual secret sharing differ from the other cryptography methods which decodes by the human visual system rather than complex computing during the decoding process. Visual secret sharing schemes encode the secret information into the noise-like binary share images. For reconstructing the secret images, stack the different share images together and use the different nature of two colors to control the transparency of the white and black area of the reconstructed secret image to reconstruct the secret image, then the stacking result can show the decoded secret image which can read by human eyes. Therefore, the traditional visual secret sharing scheme has the problem of pixel expansion, less share images and can’t provide the decoding threshold.
In view of these disadvantages, we proposed a novel threshold visual secret sharing scheme with adaptive visual quality, which can encode the secret into more share images and set different reconstructing contrasts for different number of share images, the higher contrast brings the clearer reconstructed secret image; on the other hand, the lower contrast brings the higher decoding threshold.
After the experiment and compared with similar methods, the results show that the proposed method is superior to the other scheme which can satisfy the basic demand of the visual secret sharing scheme, set the contrast, provide more share image and increase the performance at the same time.
URI: http://hdl.handle.net/11455/24300
其他識別: U0005-1607201323304400
Appears in Collections:資訊管理學系

Show full item record
 

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.