A practical method for watermarking Java programs

Monden, Akito; Iida, Hajimu; Matsumoto, Ken; Inoue, K.; Torii, Koji

doi:10.1109/cmpsac.2000.884716

Cited by 69 publications

(44 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the structure of the leaf nodes is similar to the structure of the non-leaf node 2 . The proposed watermarking algorithms do not differentiate between leaf and non-leaf nodes and treat them similarly.…”

Section: Location Of the Watermarkmentioning

confidence: 96%

Watermarking Essential Data Structures for Copyright Protection

Albluwi

Kamel

2006

Cryptology and Network Security

View full text Add to dashboard Cite

Abstract. Software watermarking is a new research area that aims at providing copyright protection for commercial software. It minimizes software piracy by hiding copyright signatures inside the program code or its runtime state. Prior proposals hide the watermarks in dummy data structures, e.g., linked lists and graphs that are created during the execution of the hosting software for this reason. This makes it vulnerable to subtractive attacks, because the attacker can remove the data structure without altering the operation or the semantic of the software program. In this regard, we argue that hiding watermarks in one or more data structures that are used by the program would make the watermark more robust because removing the watermark would alter the semantic and the operations of the underlying software. However, 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 scheme takes advantage of the redundancy in the way the entries within R-tree nodes are ordered. R-trees do not require ordering the entries in a specific way. Node entries are re-ordered in a way to map the watermark. The new order is calculated relative to a "secret" initial order, known only to the software owner, using a technique based on a numbering system that uses variable radix and factorial base. The addition of the watermark in the R-tree data structure neither affects the performance nor increases the size of the R-tree. The paper provides a threat model and analysis to show that the watermarked R-trees are robust and can withstand various types of attacks.

show abstract

Section: Location Of the Watermarkmentioning

confidence: 96%

Watermarking Essential Data Structures for Copyright Protection

Albluwi

Kamel

2006

Cryptology and Network Security

View full text Add to dashboard Cite

show abstract

“…However, existing hard/firm IP protection techniques cannot be directly used to prevent designers from losing control of their IPs once HDL source codes are released. On the other hand, HDL code is different from other programming languages like C/C++ and Java [1,13,18]. Current software protection is not applicable for HDL code protection due to the following two reasons: 1) design reuse methodology requires HDL code to be developed and documented following industrial standards; 2) there are no executables associated with HDL programs.…”

Section: Software Watermarking and Obfuscatingmentioning

confidence: 99%

Soft IP Protection: Watermarking HDL Codes

Lin

Pari

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Intellectual property (IP) reuse based design is one of the most promising techniques to close the so-called design productivity gap. To facilitate better IP reuse, it is desirable to have IPs exchanged in the soft form such as hardware description language (HDL) source codes. However, soft IPs have higher protection requirements than hard IPs and most existing IP protection techniques are not applicable to soft IPs. In this paper, we describe the basic requirements, make the necessary assumptions, and propose several practical schemes for HDL code protection. We protect the HDL codes by hiding author's signature also called as watermarking, similar to the idea for hard IP and multimedia data protection. But the new challenge is how to embed watermark into HDL source codes, which must be properly documented and synthesizable for reuse. We leverage the unique feature of Verilog HDL design to develop several watermarking techniques. These techniques can protect both new and existing Verilog designs. We watermark SCU-RTL & ISCAS benchmark Verilog circuits, as well as a MP3 decoder. Both original and watermarked designs are implemented on ASICs & FPGAs. The results show that the proposed techniques survive the commercial synthesis tools and cause little design overhead in terms of area/resources, delay and power.

show abstract

“…Therefore, it may be used for our objective. Watermarking is basically used to embed stealthy information in a piece of software, such as a software developer's copyright notation or a unique identifier of software, in a static manner [22]- [24], or in a dynamic manner [25]- [27]. Unfortunately, watermarking is not always feasible because it requires software developers to embed a watermark before releasing the software.…”

Section: Related Workmentioning

confidence: 99%

Java Birthmarks --Detecting the Software Theft--

Tamada¹

2005

IEICE Transactions on Information and Systems

View full text Add to dashboard Cite

and Ken-ichi MATSUMOTO † , Members SUMMARY To detect the theft of Java class files efficiently, we propose a concept of Java birthmarks, which are unique and native characteristics of every class file. For a pair of class files p and q, if q has the same birthmark as p's, q is suspected as a copy of p. Ideally, the birthmarks should satisfy the following properties: (a) preservation -the birthmarks should be preserved even if the original class file is tampered with, and (b) distinction -independent class files must be distinguished by completely different birthmarks. Taking (a) and (b) into account, we propose four types of birthmarks for Java class files. To show the effectiveness of the proposed birthmarks, we conduct three experiments. In the first experiment, we demonstrate that the proposed birthmarks are sufficiently robust against automatic program transformation (93.3876% of the birthmarks were preserved). The second experiment shows that the proposed birthmarks successfully distinguish non-copied files in a practical Java application (97.8005% of given class files were distinguished). In the third experiment, we exploit different Java compilers to confirm that the proposed Java birthmarks are core characteristics independent of compiler-specific issues.

show abstract

A practical method for watermarking Java programs

Cited by 69 publications

References 4 publications

Watermarking Essential Data Structures for Copyright Protection

Watermarking Essential Data Structures for Copyright Protection

Soft IP Protection: Watermarking HDL Codes

Java Birthmarks --Detecting the Software Theft--

Contact Info

Product

Resources

About