Probabilistic analysis of two heuristics for the 3-satisfiability problem
SIAM Journal on Computing
Watermarking techniques for intellectual property protection
DAC '98 Proceedings of the 35th annual Design Automation Conference
Analysis of watermarking techniques for graph coloring problem
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Robust techniques for watermarking sequential circuit designs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Effective iterative techniques for fingerprinting design IP
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended Abstract)
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
SP '83 Proceedings of the 1983 IEEE Symposium on Security and Privacy
Digital Watermarks for Audio Signals
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Watermarking of SAT using combinatorial isolation lemmas
Proceedings of the 38th annual Design Automation Conference
Zero overhead watermarking technique for FPGA designs
Proceedings of the 13th ACM Great Lakes symposium on VLSI
Soft IP protection: watermarking HDL codes
IH'04 Proceedings of the 6th international conference on Information Hiding
Algorithms to watermark software through register allocation
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
Hi-index | 0.00 |
Recently, intellectual property protection (IPP) techniques attracted a great deal of attention from semiconductor, system integration and software companies. A number of watermarking-based techniques have been proposed for IPP. One of the key limitations of watermarking is that it does not facilitate tracing of illegally resold intellectual property (IP). Fingerprinting resolves this problem by providing each customer with a unique instance of functionally identical IP. We propose a general technique which enables fingerprinting at all level of design process and is applicable to an arbitrary optimization step. In particular, we address the following fingerprinting problem: How to generate a large number of high quality solution for a given optimization problem by solving the initial problem only once. In addition we also discuss how to select a subset of k solutions from the pool of n solutions so that the solutions are maximally different.In order to make our discussion concrete we focus on a single NP-complete problem -- graph coloring. We test the new fingerprinting on a number of standard benchmarks. Interestingly, while on random graphs it is relatively difficult to produce a large number of solutions without nontrivial quality degradation, on all real-life compilation graphs we are able to generate millions of solution which are all optimal.