中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/106433
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81545584      Online Users : 3998
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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: https://ir.lib.ncu.edu.tw/handle/987654321/106433


    Title: Block-based progressive visual secret sharing
    Authors: 蔡志豐;Hou, Young-Chang;Quan, Zen-Yu;Tsai, Chih-Fong;Tseng, A-Yu
    Contributors: 管理學院資訊管理學系
    Keywords: Progressive visual secret sharing;Secret block;Steganography;Visual secret sharing
    Date: 2013-06-01
    Issue Date: 2026-04-23 13:22:26 (UTC+8)
    Publisher: Elsevier Inc.;Elsevier Inc
    Abstract: 摘要: Block-based progressive visual secret sharing (BPVSS) is an encryption technique that utilizes the human visual system to recover a secret image. The recovery method is based on building up different image blocks step by step. In the last few years, several research projects have been devoted to the study of BPVSS. However, they have some common drawbacks. Their dispatching matrices are chaotically designed by adding some redundant 0/1s in order to maintain the size as a fixed value, which makes the methods hard to be implemented. In addition, the pixel expansion ratio grows faster when the number of participants increases and the visual quality of the restored image is quite poor. In this paper, we propose a non-expanded block-based progressive visual secret sharing scheme with noise-like and meaningful shares, respectively. Experimental results demonstrate the feasibility of this scheme. Our design has several advantages over other related methods: (1) the model is concise, easy to implement, and the number of participants need not be restricted; (2) with noise-like shares, the contrast of the restored image is 50%, which means that the hidden message can be clearly recognized by the naked eye; (3) when transparencies are transferred from noise-like patterns into a meaningful cover image, the contrast in the shares and the restored image is 25%, which is still superior to that obtained in other studies; (4) our scheme is more suitable for grayscale and color secret images; and (5) the size of the transparencies is the same as that of the secret image.
    出版者: Elsevier Inc
    出版日期: 2013-06-01
    出處: Information Sciences, 2013-06, Vol.233, p.290-304
    資源來源: Elsevier ScienceDirect Journals Complete
    版權: 2013 Elsevier Inc.
    識別號: ISSN: 0020-0255
    識別號: EISSN: 1872-6291
    識別號: DOI: 10.1016/j.ins.2013.01.006
    Appears in Collections:[Department of Information Management] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML22View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明