ASIA unversity:Item 310904400/6345
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21696120      Online Users : 876
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: http://asiair.asia.edu.tw/ir/handle/310904400/6345


    Title: Preventing Cheating in Computational Visual Cryptography
    Authors: Chang, C. C.;Chen, T. H.;Liu, L. J.
    Keywords: Visual cryptography;secret sharing;cheating problem
    Date: 2009-03
    Issue Date: 2009-12-17 06:57:27 (UTC+0)
    Publisher: Asia University
    Abstract: Visual Cryptography (VC) has drawn much attention for providing the service of secret communication. Basically, VC is the process of encoding a secret into several meaningless shares and later decoding the secret by superimposing all or some of the shares without any computation involved. VC has been adopted to support some practical applications, such as image authentication, visual authentication, image hiding, and digital watermarking. Unfortunately, in many applications, VC has been shown to suffer from the "cheating problem" in which the disclosed secret image may be altered by malicious insiders who are called "cheaters." While ubiquitous computing has been well developed, it has recently occurred to people in both academia and industry that research could benefit more from computational VC by introducing light-weight computation costs in the decoding phase. In this paper, a simple scheme is proposed to conquer the cheating problem by facilitating the capability of share authentication. It is worthwhile to note that the proposed scheme can identify for certain whether cheating attacks have occurred or not, while other schemes that have the same objective frequently provide a vague answer. In addition, the proposed scheme effectively addresses the two main problems of VC, i.e., the inconvenience of meaningless share management and the challenge of achieving difficult alignment.
    Relation: Fundamenta Informaticae 92(1-2):27-42
    Appears in Collections:[Department of Computer Science and Information Engineering] Journal Artical

    Files in This Item:

    File Description SizeFormat
    0KbUnknown499View/Open
    310904400-6345 .doc34KbMicrosoft Word369View/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