Fingerprinting Intellectual Property Using Constraint-Addition
Fingerprinting Intellectual Property Using Constraint-Addition
Files
Publication or External Link
Date
2000-06
Authors
Qu, Gang
Potkonjak, Miodrag
Advisor
Citation
G. Qu and M. Potkonjak. "Fingerprinting Intellectual Property Using Constraint-Additio," 37th ACM/IEEE Design Automation Conference Proceedings, pp. 587-592, June 2000.
DRUM DOI
Abstract
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.