English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49264/83797 (59%)
Visitors : 7142639      Online Users : 66
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/75955


    Title: Progressive Visual Cryptography With Unexpanded Shares
    Authors: Hou, Young-Chang;Quan, Zen-Yu
    Contributors: 淡江大學資訊管理學系
    Keywords: Progressive visual cryptography;secret sharing visual cryptography
    Date: 2011-11
    Issue Date: 2012-04-26 15:17:24 (UTC+8)
    Publisher: Piscataway: Institute of Electrical and Electronics Engineers
    Abstract: The basic (k, n)-threshold visual cryptography scheme is to share a secret image with n participants. The secret image can be recovered while stacking k or more shares obtained; but we will get nothing if there are less than k pieces of shares being overlapped. On the other hand, progressive visual cryptography can be utilized to recover the secret image gradually by superimposing more and more shares. If we only have a few pieces of shares, we could get an outline of the secret image; by increasing the number of the shares being stacked, the details of the hidden information can be revealed progressively. Previous researches, such as Jin and Fang & Lin, were all based upon pixel-expansion, which causes the waste of storage space and transmission time. Furthermore, Fang & Lin’s research had a severe security problem that will disclose the secret information on each share. In this paper we proposed a brand new sharing scheme of progressive visual cryptography to produce pixel-unexpanded shares. In our research the possibility for either black or white pixels of the secret image to appear as black pixels on the shares is the same, which approximates to 1/n. Therefore no one can obtain any hidden information from a single share, hence ensures the security. When superimposing k (sheets of share, the possibility for the white pixels being stacked into black pixels remains 1/n, while the possibility rises to k/n for the black pixels, which sharpens the contrast of the stacked image and the hidden information therefore become more and more obvious. After superimposing all of the shares, the contrast rises to (n-1)/n which is apparently better than the traditional ways that can only obtain 50% of contrast, consequently a clearer recovered image can be achieved.
    Relation: IEEE Transactions on Circuits and Systems for Video Technology 21(11), pp.1760-1764
    DOI: 10.1109/TCSVT.2011.2106291
    Appears in Collections:[資訊管理學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML178View/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