Show simple item record

Fingerprinting Intellectual Property Using Constraint-Addition

dc.contributor.authorQu, Gang
dc.contributor.authorPotkonjak, Miodrag
dc.identifier.citationG. Qu and M. Potkonjak. "Fingerprinting Intellectual Property Using Constraint-Additio," 37th ACM/IEEE Design Automation Conference Proceedings, pp. 587-592, June 2000.en
dc.description.abstractRecently, 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.en
dc.format.extent123861 bytes
dc.subjectintellectual property protection (IPP)en
dc.subjectgraph coloringen
dc.titleFingerprinting Intellectual Property Using Constraint-Additionen
dc.relation.isAvailableAtA. James Clark School of Engineeringen_us
dc.relation.isAvailableAtElectrical & Computer Engineeringen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us
dc.rights.licenseCopyright © 2000 IEEE. Reprinted from ACM/IEEE Design Automation Conference Proceedings. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Maryland's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Files in this item


This item appears in the following Collection(s)

Show simple item record