作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (13): 135-138. doi: 10.3969/j.issn.1000-3428.2011.13.043

• 安全技术 • 上一篇    下一篇

基于扩展门限的软件水印研究与实现

欧阳康,张汗灵   

  1. (湖南大学计算机与通信学院,长沙 410082)
  • 收稿日期:2010-12-23 出版日期:2011-07-05 发布日期:2011-07-05
  • 作者简介:欧阳康(1986-),男,硕士研究生,主研方向:网络与信息安全;张汗灵,副教授
  • 基金资助:
    长沙市科技计划产学研合作基金资助项目(K0803106-11)

Research and Implementation of Software Watermark Based on Expanded Threshold

OUYANG Kang, ZHANG Han-ling   

  1. (College of Computer and Communication, Hunan University, Changsha 410082, China)
  • Received:2010-12-23 Online:2011-07-05 Published:2011-07-05

摘要: AB算法的门限方案原本用于密钥分存,不限制子密钥的强度,从而导致水印数据扩张,而扩展门限定义可限制子密钥的数据位宽。为此,提出基于扩展门限的水印算法,采用动态图方法在Java平台实现水印系统。实验结果证明,该水印算法能有效控制水印数据扩张,加快水印恢复速度,适于构建方便实用的软件水印系统。

关键词: 软件水印, 动态图水印, 防篡改, 密钥分存, 鲁棒性

Abstract: Asmuth-Bloom(AB) algorithm is a robust software watermark algorithm based on threshold scheme, which is originally used to secret sharing, so there is no restriction on sub-key’s length. With an expanded threshold scheme, sub-key’s length can be reduced. A new algorithm based on expanded threshold is proposed. Moreover, a new watermarking system is implemented on the Java platform by using dynamic graph. Experimental results show that the proposed method can reduce the data expansion, and make the recovery process easier. The conditions above mentioned are suitable for practicalized watermark system.

Key words: software watermark, Dynamic Graph Watermark(DGW), tamperproofing, secret sharing, robustness

中图分类号: