English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51258/86283 (59%)
Visitors : 8015779      Online Users : 70
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/97626


    Title: 以機率分配為基礎的有意義視覺祕密分享
    Other Titles: Probability-Based User-Friendly Visual Secret Sharing
    Authors: 侯永昌;林佳穎
    Contributors: 淡江大學資訊管理學系
    Keywords: 視覺密碼;隨機網格;秘密分享;有意義分享影像;visual cryptography;random grid;secret sharing;meaningful shares
    Date: 2014-03-01
    Issue Date: 2014-04-09 11:25:45 (UTC+8)
    Publisher: 臺北市:台灣科技大學
    Abstract: Kafri and Keren於1987年提出一個像素不擴展視覺密碼方法,稱之為隨機網格視覺密碼。隨機網格視覺密碼的相關研究大部分都是產生雜訊式(noise-like)的分享影像為主,鮮少為有意義的分享影像研究。在這些少數的有意義隨機網格的研究裡,有諸多的使用限制,且都無法讓分享影像和疊合影像上的色差達到理論上的最大值,造成影像的對比品質下降。本研究分別討論有義意式的分享方法與雜訊式的分享方法,分析了他們在分享影像與疊合影像上黑點比率的關係,找出能在疊合影像上產生最佳對比色差的黑點機率配置方法,藉此提出一個以機率為基礎的有意義視覺密碼模型。我們的方法降低了使用上的限制,且可以實作出多種對比色差的影像。最重要的是提升了影像的視覺品質,讓分享影像與疊合影像的對比色差都可以達到理論上的最大值,優於其他的相關研究。
    Visual Cryptography (VC) is a simple image encryption method, which proposed by Naor and Shimir in 1995. This method can encode the secret image into n shares. The secret will be decrypted by human eye when at least any k shares are stacked together, while any less than k shares can reveal no information about the secret . In decrypt process, people need neither computer computation nor any knowledge about VC. But the biggest drawback of VC is the pixel expansion problem, especially in dealing with the color image, or generating the meaningful shares, which will get an even larger pixel expansion ratio.
    Kafri and Keren (1987) presented a visual secret sharing method without pixel expansion, called random-grid visual secret sharing (RGVSS), which uses the concept of probability to allocate the black and white pixel in share-image. When we superimpose all shares, the ratio of black pixel in black region is greater than the white region, therefore, the secret in the stack-image can be clearly seen by our eyes. However, most of the RGVSS researches are about generating the noise-like shares rather than generating the meaningful shares. There are not only many restrictions in encoding secret but also degrading the image contract .
    This study will discuss noise-like sharing method first and then reduce to meaningful sharing method. We first analyzed the distribution of the black pixels on the share-image and the stack-image. A probability allocation method was then proposed which can produce the best contract in both of the share-image and the stack-image. Our meaningful module can not only use different cover images for disguised, but also has the ability for setting a variety of contrast as we needed. The most important result is that this study raises the visual quality for both of the share-image and the stack-image and can achieve to their theoretical maximum. To conclude, our meaningful visual secret sharing module is superior to other related researches.
    Relation: 技術學刊=Journal of Technology 29(1),頁57-68
    Appears in Collections:[Graduate Institute & Department of Information Management] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML172View/Open
    index.html0KbHTML182View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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