.png){kind=icon}
返回
More on graph theoretic software watermarks: Implementation, analysis, and attacks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.infsof.2008.09.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents an implementation of the watermarking method proposed by Venkatesan et al. in their paper [R. Venkatesan, V. Vazirani. S. Sinha, A graph theoretic approach to software watermarking, in: Fourth International Information Hiding Workshop, Pittsburgh, PA, 2001]. An executable program is marked by the addition of code for which the topology of the control-flow graph encodes a watermark. We discuss issues that were identified during construction of an actual implementation that operates on Java bytecode. We present two algorithms for splitting a watermark number into a redundant set of pieces and an algorithm for turning a watermark number into a control-now graph. We measure the size and time overhead of watermarking, and evaluate the algorithm against a variety of attacks. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Software watermarking
Software protection
Surreptitious software
Software piracy protection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
3.8K
被引数:
7.7K
机构
查看更多机构
引用论文
.png){kind=icon}
Emerging role of noncanonical polycomb repressive complexes in normal and malignant hematopoiesis
OAAI
OAAI分享收藏
Magnetic and Structural Properties of Nanocrystalline Cobalt-Substituted Magnesium–Manganese Ferrite
PREAI
分享收藏 没有更多内容