A robust software watermarking for copyright protection
A robust software watermarking for copyright protection
复制标题
DOI：
10.1016/j.cose.2009.01.007
复制
发表时间：
2009-09-01
影响因子：
5.6
通讯作者：
Albluwi, Qutaiba
中科院分区：
文献类型：
--
作者：
Kamel, Ibrahim;Albluwi, Qutaiba
本文主张通过在代码使用的各种数据结构中隐藏水印来保护软件版权，B+-树、R-树、链表等。先前的建议将水印隐藏在伪数据结构中，例如，仅出于此原因，在主机软件执行期间创建的链接列表和图形。这使得它们容易受到减法攻击，因为攻击者可以在不改变软件程序的功能或语义的情况下删除虚拟数据结构。我们认为，隐藏水印在一个或多个数据结构中使用的程序将使水印更强大，因为干扰水印会影响语义和底层软件的功能。本文提出了一种新的R-树数据结构及其变体的水印嵌入方法。所提出的水印技术不改变存储的数据对象的值。它利用了R树节点内条目顺序的冗余性。排序是相对于一个“秘密”的初始顺序来安排的，只有软件所有者知道，使用的是一种基于编号系统的技术，该编号系统使用可变基数和阶乘基数。在R树数据结构中添加水印不会影响性能，也不会增加R树的大小。本文提供了详细的安全性分析和性能评估，表明嵌入的水印是鲁棒的，可以抵御各种类型的攻击。(C)2009爱思唯尔有限公司保留所有权利。
This paper advocates protecting software copyright through hiding watermarks in various data structures used by the code, e.g., B+-trees, R-trees, linked lists, etc. Prior proposals hide the watermarks in dummy data structures, e.g., linked lists and graphs that are created, solely for this reason, during the execution of the hosting software. This makes them vulnerable to subtractive attacks, because the attacker can remove the dummy data structures without altering the functionality or the semantic of the software program. We argue that hiding watermarks in one or more data structures that are used by the program would make the watermark more robust because disturbing the watermark would affect the semantic and the functionality of the underlying software. The challenge is that the insertion of the watermark should have a minimal effect on the operations and performance of the data structure.This paper proposes a novel method for watermarking R-tree data structure and its variants. The proposed watermarking technique does not change the values of the stored data objects. It takes advantage of the redundancy in the order of entries inside the R-tree nodes. Entries are arranged relative to a "secret" initial order, known only to the software owner, using a technique based on a numbering system that uses variable radix with factorial base. The addition of the watermark in the R-tree data structure does not affect the performance nor does it increase the size of the R-tree. The paper provides a detailed security analysis and performance evaluation to show that the embedded watermarks are robust and can withstand various types of attacks. (C) 2009 Elsevier Ltd. All rights reserved.