English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 49433/84388 (59%)
造访人次 : 7447093      在线人数 : 60
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/97629

    题名: New Design for Friendly Visual Secret Sharing
    作者: 侯永昌;Liao, H.Y.
    贡献者: 淡江大學資訊管理學系
    关键词: Secret sharing;Visual cryptography;Friendly visual secret sharing
    日期: 2014-04
    上传时间: 2014-04-09 11:47:19 (UTC+8)
    出版者: Taipei: Kownledge Association of Taiwan
    摘要: Different from conventional cryptography, visual cryptography is an image cryptographic technique proposed by Naor and Shamir. It encodes a secret image into n pieces of noise-like shares. When k or more than k pieces of shares are gathered from participants, human visual system will disclose the secret image on the stacked image easily. Neither complicated mathematical computation nor any knowledge of cryptography is needed are the main advantages of visual secret sharing. In this paper, we propose a new design for friendly visual secret sharing. The secret will be hiding into two meaningful shares. The black-appearing ratio in each block of the shares for the corresponding black (rep. white) secret pixel is the same. Therefore, it is impossible for one to disclose any information related to the secret image on each share, which achieves the goal of improving security. When shares are superimposed, the contours of the cover image will disappear on the stacked image, which will only reveal the secret image. According to our experimental results, the contrasts of the shares or the stacked images are good which can reveal the contents of the cover images and the secret image clearly.
    關聯: Proceedings of 2014 e-CASE & e-Tech International Conference, pp. 1629-1640
    显示于类别:[資訊管理學系暨研究所] 會議論文





    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈