抗恶意攻击的可约置换图数字水印特征
Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks
摘要:
在软件水印领域,我们已经提出了几个图论水印编解码器系统编码水印数字$w$作为可约置换流图$F[π^*]$通过使用自反置换$π^*$。后续我们提出的方法,我们从理论上研究了最古老的,我们称之为W-RPG,以调查和证明其弹性的边缘修改攻击的流图$F[π^*]$。特别地,我们通过对整数$w\equivπ^*$进行编码的自反置排列$π^*$的结构将其特征化为强或弱水印。为此,对于任何整数水印$w \in R_n=[2^{n-1}, 2^n-1]$,其中$n$是$w$的二进制表示形式$b(w)$的长度,我们计算01的最小值- 需要对$b(w)$进行修改,以使得到的$b(w')$表示有效水印号$w'$ ;注意,如果$w'$可以由W-RPG编解码器系统产生,则数字$w'$被称为有效的(或真-不正确的水印数字),并且因此它包含了$π^* \equiv w$的所有结构属性。
英文摘要:
In the domain of software watermarking, we have proposed several graph theoretic watermarking codec systems for encoding watermark numbers $w$ as reducible permutation flow-graphs $F[π^*]$ through the use of self-inverting permutations $π^*$. Following up on our proposed methods, we theoretically study the oldest one, which we call W-RPG, in order to investigate and prove its resilience to edge-modification attacks on the flow-graphs $F[π^*]$. In particular, we characterize the integer $w\equivπ^*$ as strong or weak watermark through the structure of self-inverting permutations $π^*$ which encodes it. To this end, for any integer watermark $w \in R_n=[2^{n-1}, 2^n-1]$, where $n$ is the length of the binary representation $b(w)$ of $w$, we compute the minimum number of 01-modifications needed to be applied on $b(w)$ so that the resulting $b(w')$ represents the valid watermark number $w'$; note that a number $w'$ is called valid (or, true-incorrect watermark number) if $w'$ can be produced by the W-RPG codec system and, thus, it incorporates all the structural properties of $π^* \equiv w$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。