A New Minimum Connected Graph for Enlarging Verification Image in Visual Cryptography
碩士 === 國立東華大學 === 資訊工程學系 === 104 === A (k, n) visual cryptography scheme (VCS) shares a secret image into n shadow images (referred to as shadows). The secret image can be revealed if the number of shadow achieves the threshold k. On the other hand, (k1) or fewer shadows cannot get any information...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/72627710435752365075 |