k out of n Region Incrementing Scheme in Visual Cryptography
碩士 === 國立東華大學 === 資訊工程學系 === 100 === In a (k, n) visual cryptography scheme (VCS), a secret image is encoded into n shadow images that distributed to n participants. Any k participants can reveal the secret image by stacking their shadow images to visually decode the secret image without the hel...
Main Authors: | Hsiang-Wen Shih, 石翔文 |
---|---|
Other Authors: | Ching-Nung Yang |
Format: | Others |
Language: | en_US |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/41060302569445021151 |
Similar Items
-
On the Cheating Prevention Schemes in the k-out-of-n Visual Cryptography
by: Du-Shiau Tsai, et al.
Published: (2007) -
Extended Region Incrementing Visual Cryptography
by: Shi-Kai Chueh, et al.
Published: (2012) -
Incrementing Visual Cryptography Using Random Grids
by: Yung-Ching Lan, et al.
Published: (2009) -
Incremental cryptography
by: Yerushalmi, Yoav
Published: (2008) -
3-out-of-n Cheating Prevention Visual Cryptography
by: Chih-Han Wu, et al.
Published: (2016)