基于Logistic映射的排列图软件水印方案
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TP391

基金项目:

国家自然科学基金项目(面上项目,重点项目,重大项目,青年项目)


Logistic-Based Permutation Watermark system
Author:
Affiliation:

Fund Project:

The National Natural Science Foundation of China (General Program, Key Program, Major Research Plan)

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对排列图编码鲁棒性较差的问题,提出使用Logistic映射生成软件水印的算法。根据版权所有者信息和合法用户信息生成初始值,通过Logistic映射计算混沌序列并生成水印信息。版权所有者随机生成排列图长度后将水印信息用排列图表示并嵌入宿主程序当中。提取排列图后,根据排列图相似度,在拓扑图受到攻击的情况下仍然可以证明版权。实验仿真证实该算法能够抵抗常见攻击,提高排列图的鲁棒性

    Abstract:

    To solve the problem that the permutation graphic is too weak, a logistic-based watermark algorithm is proposed. On the basis of information about the copyright owner and legal user, initial value for logistic map is calculated and then chaotic sequences and watermark value are computed. After choosing the length of permutation graphic randomly, the copyright owner generates permutation graphic to embed into host program. According to similarity rate extracted from host program, the ownership of host program is identified even though the permutation graphic was attacked. The experimental results and theoretical analysis show that this scheme is more robust than traditional permutation graphic system and can resist common attacks.

    参考文献
    相似文献
    引证文献
引用本文

孙小雁,张茂胜,冯在文,等. 基于Logistic映射的排列图软件水印方案[J]. 科学技术与工程, 2013, 13(5): .
sun xiaoyan, zhang mao sheng, Feng zaiwen, et al. Logistic-Based Permutation Watermark system[J]. Science Technology and Engineering,2013,13(5).

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2012-09-29
  • 最后修改日期:2012-09-29
  • 录用日期:2012-10-26
  • 在线发布日期: 2013-01-10
  • 出版日期:
×
律回春渐,新元肇启|《科学技术与工程》编辑部恭祝新岁!
亟待确认版面费归属稿件,敬请作者关注