ASIA unversity:Item 310904400/65350
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90120/105263 (86%)
Visitors : 7260052      Online Users : 232
RC Version 6.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:

    Title: 基於布林運算的多秘密分享機制
    AMulti-secret Sharing Schemebased on Boolean Operation
    Authors: 黃教智;詹啟祥;陳宜惠;Huang, Chiao-Chih
    Contributors: 資訊多媒體應用學系
    Keywords: 視覺密碼學;影像分享;多機密分享;Visual cryptography, Image sharing, Multiple secret sharing
    Date: 2013-12
    Issue Date: 2013-12-18 10:46:41 (UTC+8)
    Abstract: 在2011年Chen與Wu提出了基於布林運算的影像分享,此方法可對n個秘密影像進行分享並產生n+1個分享影像,透過此方法可以讓取出的秘密影像,達到無失真的目的。為了減少分享影像的個數,本文提出一個方法可對n個秘密影像進行分享並且只產生n個分享影像。從實驗結果得知本文提出的方式不僅能夠重建秘密影像,達到無失真的目的,還可以提高分享影像的品質。

    In 2011, Chen and Wu proposed their method of sharing n secret images to n+1 shadow images using the concept of a Boolean-based Visual Secret Sharing (VSS) method. Through their method, the secret image can be recovered without loss. In order to further reduce the number of shadow images, this paper proposed a method to produce only n shadow images from n secret images. Experimental results show that the proposed method not only can reconstruct the secret image without loss but also can increase the quantityof secret images for sharing.
    Relation: 2013全國計算機會議
    Appears in Collections:[Department of Applied Informatics and Multimedia] Proceedings

    Files in This Item:

    File SizeFormat

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

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