Watermarking techniques for intellectual property protection
DAC '98 Proceedings of the 35th annual Design Automation Conference
Zero Knowledge Watermark Detection
IH '99 Proceedings of the Third International Workshop on Information Hiding
Proving Ownership of Digital Content
IH '99 Proceedings of the Third International Workshop on Information Hiding
Fast public-key watermarking of compressed video
ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 1 - Volume 1
Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Information hiding in finite state machine
IH'04 Proceedings of the 6th international conference on Information Hiding
Secure public verification of IP marks in FPGA design through a zero-knowledge protocol
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
A constraint-based watermarking technique has been introduced for the protection of intellectual properties such as hardware, software, algorithms, and solutions to hard problems. It provides desirable proof of authorship without rendering the intellectual properties useless. However, it makes the watermark detection, which is as important as watermarking, a NP-hard problem. We propose a keyless public watermarking method that enables the watermark to be publicly detectable. The basic idea is to create a cryptographically strong pseudo-random watermark, embed it into the original problem as a special (mutual exclusive) constraint, and make it public. No key is required to detect such watermark. We combine data integrity technique and the unique characteristics in the design of intellectual property such that adversaries can get almost no advantage for forgery from the public watermarking. This new technique is also compatible with the existing constraint-based watermarking techniques to enhance the strength of the watermark. We build the mathematical framework for the this approach based on the concept of mutual exclusive constraints. We use several well-known problems to explain our approach, demonstrate its robustness against attacks, and show that there is little degradation in performance.