English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 50122/85141 (59%)
造訪人次 : 7885838      線上人數 : 82
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/90434

    題名: An Optimization Model for Visual Cryptography Schemes with Unexpanded Shares
    作者: Hsu, Ching-Sheng;Tu, Shu-Fen;Hou, Young-chang
    貢獻者: 淡江大學資訊管理學系
    日期: 2006-09
    上傳時間: 2013-06-19 16:24:25 (UTC+8)
    出版者: Berlin: Springer-Verlag
    摘要: The method of visual cryptography is to encrypt a secret image into N shares so that any qualified set of participants can recover the hidden secret
    by their eyes; whereas any forbidden set of participants cannot obtain any secret information. In the study of visual cryptography, pixel expansion and contrast are two important issues. Most visual cryptographic methods are based on the
    technique of pixel expansion, and the result is that the size of each share is larger than that of the secret image. Pixel expansion not only results in distortion of the shares, but also consumes more storage space. In this paper, we proposed a new method to cope with the problems of pixel expansion. We used the concept of probability and considered the security issue on the forbidden set
    and the contrast issue on the qualified set to construct an optimization model for general access structures. Finally, we analyzed the contrast and blackness of black pixels of our experimental result, and we found that our method is better
    than Ateniese et al.’s.
    關聯: Proceedings of the 16th international conference on Foundations of Intelligent Systems, pp.58-67
    DOI: 10.1007/11875604_8
    顯示於類別:[資訊管理學系暨研究所] 專書之單篇





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