Please use this identifier to cite or link to this item:
標題: 階層式且無像素擴展之視覺多秘密分享機制
A Hierarchical Visual Multi-Secret Sharing Scheme without Pixel Expansion
作者: 方儷瑾
Fang, Li-Chin
關鍵字: visual cryptography;視覺密碼學;visual secret sharing;視覺秘密分享
出版社: 資訊科學系所
引用: [1]O. Kafri and E. Keren, “Encryption of pictures and shapes by random grids,” Optics Letters, Vol. 12, No. 6. pp. 377-379, 1987. [2]M. Naor and A. Shamir, “Visual Cryptography,” Advances in Cryptology-EUROCRYPT'94, Lecture Notes in Computer Science, Vol. 950. pp. 1-12, Springer-Verlag, 1995. [3]C.N Yang, “New visual secret sharing schemes using probabilistic method,” Pattern Recognition Letters, Vol. 25, No. 4, pp. 481-494, 2004. [4]A. Shamir, “How to share a secret,” Communications of the ACM, Vol. 22, Issue 11, pp. 612-613, NOV. 1979. [5]K.Y. Chen, W.P. Wu and C.S Laih, “On the (2,2) Visual Multi-Secret Sharing Schemes,” Proceedings of the 2000 International Computer Symposium Workshop on Cryptography and Information Security, Taiwan, pp. 73-80, DEC. 2000. [6]Pei-Fang Tsai and Ming-Shi Wang, “An (3,3)-Visual Secret Sharing Scheme for Hiding Three Secret Data,” Joint conference on information sciences, Taiwan, OCT. 2006. [7]Hsien-Chu Wu, Chin-Chen Chang, “Sharing visual multi-secrets using circle shares,” Computer Standards & Interfaces, Vol. 28, pp. 123-135, 2005. [8]Shyong-Jian Shyu, “Image encryption by random grids,” Pattern Recognition, Vol. 40, pp. 1014-1031, 2007. [9]Young-Chang Hou, “Visual cryptography for color images,” Pattern Recognition, Vol. 36, pp. 1619-1629, 2003. [10]C.S. Tsai, C.C. Chang, T.S. Chen, “Sharing multiple secrets in digital images,” Journal of Systems and Software, Vol. 64, pp. 163-170, 2002.
傳統的視覺秘密分享機制將一個秘密影像分解成數張分享影像,以提供足夠的安全性。現今的技術,已經可以將多個秘密影像藏於相同集合中的分享影像,只要將分享影像旋轉到某個角度即可看見另一個秘密影像。然而這些方法被侷限在(2, 2)或者(3, 3)-視覺秘密分享機制,而且這些分享影像的大小也被擴大。
在這篇論文中,我們提出一個改善的視覺多秘密分享機制,使用階層式的概念來管理這些分享影像。只要將某個集合中的分享影像重疊即可得到第一個秘密,第二個部份秘密的取得需要藉由某些分享影像的位移,再將其與其他的分享影像重疊,即可獲得。最後再將所有的部份秘密蒐集合併在一起,便可獲得第二個完整的秘密。我們的方法可以被延伸至(k, k)-視覺秘密分享機制,而且分享影像的大小將會與原始的秘密影像大小相同。

Traditional visual secret sharing scheme has provided sufficient security for a secret image by breaking it into share images (called shares). In current technology, multiple secret images can be hidden in the same set of shares after one of the shares is rotated at different degrees. However, these schemes are limited to (2, 2) or (3, 3)-visual secret sharing. Furthermore, the sizes of the shares will be expanded.
In this thesis, we propose an improved visual multi-secret sharing scheme that adopts a hierarchical concept to manage the shares. The first secret can be obtained by stacking some subset of shares, and the second fragmented secret can be obtained by shifting some shares in the same set and stacking them together. Then, we merge all the fragmented secrets to obtain the whole information about the second secret. Our scheme can be generalized to (k, k)-visual secret sharing, and the sizes of shares remain the same as the secret image.
其他識別: U0005-1907200718123300
Appears in Collections:資訊科學與工程學系所

Show full item record

Google ScholarTM


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