一种可证明弹性的基于图的水印方案
Towards a provably resilient scheme for graph-based watermarking
摘要：
数字水印被认为是一种很有前途的对抗软件盗版的方法。基于图的水印方案将作者/所有权数据编码为虚拟代码的控制流图。2012年，Chroni和Nikolopoulos开发了一个巧妙的方案，声称可以抵御单一边缘删除形式的攻击。我们在各个方面扩展了这些作者的工作。首先，我们给出了一类由编码函数生成的图的形式刻画。然后，我们制定了一个线性时间算法，恢复从恶意删除的$k \leq 2$边缘，从而证明他们的要求。此外，我们提供了一个更简单的解码功能和算法来恢复水印与任意数量的丢失边缘时，在所有可能的。通过披露和改进Chroni和Nikolopoulos的水印的弹性，我们的研究结果加强了将其视为众多应用的可能解决方案的兴趣。
英文摘要：
Digital watermarks have been considered a promising way to fight software piracy. Graph-based watermarking schemes encode authorship/ownership data as control-flow graph of dummy code. In 2012, Chroni and Nikolopoulos developed an ingenious such scheme which was claimed to withstand attacks in the form of a single edge removal. We extend the work of those authors in various aspects. First, we give a formal characterization of the class of graphs generated by their encoding function. Then, we formulate a linear-time algorithm which recovers from ill-intentioned removals of $k \leq 2$ edges, therefore proving their claim. Furthermore, we provide a simpler decoding function and an algorithm to restore watermarks with an arbitrary number of missing edges whenever at all possible. By disclosing and improving upon the resilience of Chroni and Nikolopoulos's watermark, our results reinforce the interest in regarding it as a possible solution to numerous applications.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
