ACM Home Page
Please provide us with feedback. Feedback
Fingerprinting intellectual property using constraint-addition
Full text PdfPdf (124 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 37th Annual Design Automation Conference table of contents
Los Angeles, California, United States
Pages: 587 - 592  
Year of Publication: 2000
ISBN:1-58113-187-9
Authors
Gang Qu  Computer Science Department, University of California, Los Angeles, CA
Miodrag Potkonjak  Computer Science Department, University of California, Los Angeles, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 44,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/337292.337586
What is a 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
L. Boney, A.H. Tewfik, and K.N. Hamdy. Digital watermark for audio signals. International Conference on Multimedia Computing and Systems, pp. 473-480, 1996.
 
4
E. Charbon. Hierarchical Watermarking in IC Design. IEEE 1998 Custom Integrated Circuits Conference, pp. 295-298, 1998.
5
 
6
 
7
 
8
I.J. Cox, J. Kilian, T. Leighton, and T. Shamoon. A secure, imperceptible yet perceptually salient, spread spectrum watermark for multimedia. Southcon, pp. 192-197, 1996.
9
 
10
J.Lach, W.H.Mangione-Smith, and M.Potkonjak. FPGA Fingerprinting Techniques for Protecting Intellectual Property. Proceedings of CICC, 1998.
11
 
12
B. Pfitzmann, and M. Schunter. Asymmetric Fingerprinting. Advances in Cryptology - EUROCRYPT'96, Proceedings of International Conference on the Theory and Application of Cryptographic Techniques. Maurer (Ed.), Springer-Verlag, pp. 84-95, 1996.
13
 
14
 
15
VSI Alliance. System Chip Letter. Issue 2, Summer 1998.


Collaborative Colleagues:
Gang Qu: colleagues
Miodrag Potkonjak: colleagues