ASIA unversity:Item 310904400/6345
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 94286/110023 (86%)
造访人次 : 21658165      在线人数 : 458
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/6345


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6345


    题名: Preventing Cheating in Computational Visual Cryptography
    作者: Chang, C. C.;Chen, T. H.;Liu, L. J.
    关键词: Visual cryptography;secret sharing;cheating problem
    日期: 2009-03
    上传时间: 2009-12-17 06:57:27 (UTC+0)
    出版者: Asia University
    摘要: 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.
    關聯: Fundamenta Informaticae 92(1-2):27-42
    显示于类别:[資訊工程學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    0KbUnknown499检视/开启
    310904400-6345 .doc34KbMicrosoft Word368检视/开启


    在ASIAIR中所有的数据项都受到原著作权保护.


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