A Dynamic Graph Watermark Scheme of Tamper Resistance

Chen, XiaoJiang; Fang, Dingyi; Shen, JingBo; Chen, Feng; Wang, Wenbo; He, Lu

doi:10.1109/ias.2009.327

Cited by 8 publications

(4 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…by (2), (5) and (7), as can be shown by a straightforward but lengthy computation. Let d = ε 2 log n. This implies that…”

Section: Observation 13mentioning

confidence: 88%

“…In this case, the object being marked is a piece of software and the goal of a "graph watermarking" scheme is to create a graph, G, from a message, m, and then embed G into the control flow of a piece of software, S, to mark S. Examples of such work include pioneering work by Collberg and Thomborson [15], as well as subsequent work by Venkatesan, Vazirani, and Sinha [52] and Collberg et al [14]. (See also Chen et al [7] and Bento et al [4], as well as a survey by Hamilton and Danicic [22].) This work on software watermarking differs from the graph watermarking problem we study in the present paper, however, because in the graph watermarking problem we study an input graph is provided and we want to alter it to add a mark.…”

Section: Additional Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Models and Algorithms for Graph Watermarking

Eppstein

Goodrich

Lam

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We introduce models and algorithmic foundations for graph watermarking. Our frameworks include security definitions and proofs, as well as characterizations when graph watermarking is algorithmically feasible, in spite of the fact that the general problem is NP-complete by simple reductions from the subgraph isomorphism or graph edit distance problems. In the digital watermarking of many types of files, an implicit step in the recovery of a watermark is the mapping of individual pieces of data, such as image pixels or movie frames, from one object to another. In graphs, this step corresponds to approximately matching vertices of one graph to another based on graph invariants such as vertex degree. Our approach is based on characterizing the feasibility of graph watermarking in terms of keygen, marking, and identification functions defined over graph families with known distributions. We demonstrate the strength of this approach with exemplary watermarking schemes for two random graph models, the classic Erdős-Rényi model and a random power-law graph model, both of which are used to model real-world networks.

show abstract

“…by (2), (5) and (7), as can be shown by a straightforward but lengthy computation. Let d = ε 2 log n. This implies that…”

Section: Observation 13mentioning

confidence: 88%

Section: Additional Related Workmentioning

confidence: 99%

Models and Algorithms for Graph Watermarking

Eppstein

Goodrich

Lam

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Several papers [9,62,81,79,45,82] describe a technique which combines radix graphs with the errorcorrecting properties of PPCTs by converting a radix graph into a PPCT-like structure.…”

Section: Graph Watermarkingmentioning

confidence: 99%

A survey of static software watermarking

Hamilton

Danicic

2011

2011 World Congress on Internet Security (WorldCIS-2011)

View full text Add to dashboard Cite

Software watermarks, which can be used to identify the intellectual property owner of a piece software, are broadly divided into two categories: static and dynamic. Static watermarks are embedded in the code and/or data of a computer program, whereas dynamic watermarking techniques store a watermark in a program's execution state. In this paper, we present a survey of the known static software watermarking techniques, including a brief explanation of each.

show abstract

“…This allows developers of software to verify their copyright through extracting their signature from illegal copies. Researchers have developed a number of watermarking techniques over the past two decades that can be categorized into three major classes according to the extraction method, namely abstract, static and dynamic watermarking [4]. Most current watermarking methods attack a feature of the program that can assume many connections but, however, only hiding the watermark in one connection.…”

Section: Introductionmentioning

confidence: 99%

A Review of Software Watermarking

Mnkash

Abdulmunem

2020

eijs

View full text Add to dashboard Cite

The Internet is the hallmark of the age of technology and this technology is complemented by the presence of software which is one of the basic components of the operation of the network and it is used in almost all daily life aspects such as industry, commerce and others. Because the digital documents and objects can be easily replicated and distributed at an economically low cost and as the software is a type of digital object, the problem of software watermarking risen as related to how to protect data from piracy. Therefore, various techniques have been developed to protect codes from misusing and unauthorized alteration. Each of them is known as watermarking technology that protects data by inserting secret information into software, as an indicator of copyright ownership for this software. In this paper, the watermarked software will be explained in detail by defining the classification of watermarks software, models of attack, and methods used in software watermarking carried out by several researchers. It seems clearly that the method of ROP algorithm has given the highest accuracy results up to 100%

show abstract

A Dynamic Graph Watermark Scheme of Tamper Resistance

Cited by 8 publications

References 3 publications

Models and Algorithms for Graph Watermarking

Models and Algorithms for Graph Watermarking

A survey of static software watermarking

A Review of Software Watermarking

Contact Info

Product

Resources

About