English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90074/105197 (86%)
Visitors : 7156228      Online Users : 30
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
    ASIA unversity > 資訊學院 > 資訊傳播學系 > 會議論文 >  Item 310904400/6935


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/6935


    Title: Secret multimedia information sharing with data hiding capacity by simple logic operations
    Authors: C. C. Lin;W. H. Tsai
    Contributors: Department of Information Communication
    Date: 2001-07
    Issue Date: 2009-12-23 19:35:21 (UTC+8)
    Publisher: Asia University
    Abstract: An effective scheme for secret multimedia nformation sharing with data hiding capacity is proposed. A set of secret data is shared into an arbitrary number of sets of pre-designed camouflage data and a corresponding set of meaningless data. Utilizing the characteristic of visualization, we can employ the scheme to share, e.g., a landscape image into several portraits and a meaningless image. The scheme can as well be applied to other multimedia data, like voice, video, and so on. So we can share a paragraph of words into several pleasant melodies and share a ection of a cartoon movie into several sections of science-fiction movies.
    When a set of secret data is shared, the effect of data hiding is achieved in the mean time from another point of view because the shares can be other meaningful camouflage data sets. For cases of small numbers of shares, a revised version of the scheme is proposed to improve the data hiding effect. An advantage of the proposed scheme is that only simple logic operations are used in creating the shares and  To whom all correspondences should be sent.
    recovering the secret data. Simple logic operations inherit the properties of fast computation and easy implementation, which make the scheme more practical for real applications. Security is also ensured. The secret key is distributed instead of being centralized. If not all shares are collected, no information about the original secret data can be gained.
    Relation: Proceedings of 5th World Multiconference on Systemics, Cybernetics, and Informatics, Volume I: Information Systems Development, Orlando, Florida, U. S. A
    Appears in Collections:[資訊傳播學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML66View/Open


    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