<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

Filters

2001 - 20043

Settings

🏛️國立陽明交通大學機構典藏

Author: search.filters.author.Lin, CCSubject: search.filters.subject.data hiding

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item type:Item,
    Secret image sharing with capability of share data reduction
    (2003-08-01)
    Lin, CC
    ;
    Tsai, WH
    ;
    資訊工程學系
    ;
    Department of Computer Science
    A novel approach to secret image sharing based on a (k,n)-threshold scheme with the additional capability of share data reduction is proposed. A secret image is first transformed into the frequency domain using the discrete cosine transform (DCT), which is applied in most compression schemes. Then all the DCT coefficients except the first 10 lower frequency ones are discarded. And the values of the 2nd through the 10th coefficients are disarranged in such a way that they cannot be recovered without the first coefficient and that the inverse DCT of them cannot reveal the details of the original image. Finally, the first coefficient is encoded into a number of shares for a group of secret-sharing participants and the remaining nine manipulated coefficients are allowed to be accessible to the public. The overall effect of this scheme is achievement of effective secret sharing with good reduction of share data. The scheme is thus suitable for certain application environments, such as the uses of mobile or handheld devices, where only a small amount of network traffic for shared transmission and a small amount of space for data storage are allowed. Good experimental results proving the feasibility of the proposed approach are also included. (C) 2003 Society of Photo-Optical Instrumentation Engineers.
  • Thumbnail Image
    Item type:Item,
    Secret image sharing with steganography and authentication
    (2004-11-01)
    Lin, CC
    ;
    Tsai, WH
    ;
    資訊工程學系
    ;
    Department of Computer Science
    A novel approach to secret image sharing based on a (k, n)-threshold scheme with the additional capabilities of steganography and authentication is proposed. A secret image is first processed into n shares which are then hidden in n user-selected camouflage images. It is suggested to select these camouflage images to contain well-known contents, like famous character images, well-known scene pictures, etc., to increase the steganographic effect for the security protection purpose. Furthermore, an image watermarking technique is employed to embed fragile watermark signals into the camouflage images by the use of parity-bit checking, thus providing the capability of authenticating the fidelity of each processed camouflage image, called a stego-image. During the secret image recovery process, each stego-image brought by a participant is first verified for its fidelity by checking the consistency of the parity conditions found in the image pixels. This helps to prevent the participant from incidental or intentional provision of a false or tampered stego-image. The recovery process is stopped if any abnormal stego-image is found. Otherwise, the secret image is recovered from k or more authenticated stego-images. Some effective techniques for handling large images as well as for enhancing security protection are employed, including pixelwise processing of the secret image in secret sharing, use of parts of camouflage images as share components, adoption of prime-number modular arithmetic, truncation of large image pixel values, randomization of parity check policies, etc. Consequently, the proposed scheme as a whole offers a high secure and effective mechanism for secret image sharing that is not found in existing secret image sharing methods. Good experimental results proving the feasibility of the proposed approach are also included. (C) 2003 Elsevier Inc. All rights reserved.
  • Thumbnail Image
    Item type:Item,
    Secret multimedia information sharing with data hiding capacity by simple logic operations
    (2001)
    Lin, CC
    ;
    Tsai, WH
    ;
    資訊工程學系
    ;
    Department of Computer Science
    An effective scheme for secret multimedia information 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 section 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 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.