ACM Home Page
Please provide us with feedback. Feedback
Zero overhead watermarking technique for FPGA designs
Full text PdfPdf (328 KB)
Source Great Lakes Symposium on VLSI archive
Proceedings of the 13th ACM Great Lakes symposium on VLSI table of contents
Washington, D. C., USA
Session: VLSI design table of contents
Pages: 147 - 152  
Year of Publication: 2003
ISBN:1-58113-677-3
Authors
Adarsh K. Jain  University of Maryland, College Park, MD
Lin Yuan  University of Maryland, College Park, MD
Pushkin R. Pari  University of Maryland, College Park, MD
Gang Qu  University of Maryland, College Park, MD
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 35,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

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/764808.764847
What is a DOI?

ABSTRACT

FPGAs, because of their re-programmability, are becoming very popular for creating and exchanging VLSI intellectual properties (IPs) in the reuse-based design paradigm. Existing watermarking and fingerprinting techniques successfully embed identification information into FPGA designs to deter IP infringement. However, such methods incur timing and/or resource overhead, unpredictable at times, which causes performance degradation. In this paper, we propose a new FPGA watermarking technique that guarantees zero design overhead.Our approach consists of two phases. First we design as usual to obtain the best, possible, quality IP. Then we map the required signature to additional timing constraints on carefully selected nets and redo a small portion of the design (e.g. place and route). The FPGA configuration bitstream for the resulting watermarked design will be significantly different from the original design, which provides us with a strong proof of authorship. The watermarking technique has zero design overhead because it is developed to maintain the performance of the design from the first phase. This is demonstrated by applying the proposed technique on several real-life FPGA designs, which range in size from a few thousand to more than two million gates, on Xilinx devices.


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
 
4
A. B. Kahng, J. Lach, W. H. Mangione-Smith, S. Mantik, I. L. Markov, M. Potkonjak, et al., "Constraint-Based Watermarking Techniques for Design IP Protection", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pp. 1236--1252, October 2001.
5
6
7
8
 
9
J. Lach, W. H. Mangione-Smith, M. Potkonjak, "FPGA Fingerprinting Techniques for Protecting Intellectual Property", Proceedings of the IEEE 1998 Custom Integrated Circuits Conference, pp. 299--302, May 1998.
10
11
12
13
 
14
 
15
 
16
K. W. Yip and T. S. Ng, "Partial-Encryption Technique for Intellectual Property Protection of FPGA-Based Products", IEEE Transactions on Consumer Electronics, pp. 183--190, February 2000.
 
17
Personal Communication with Chris Mead, Xilinx Inc.
 
18
Synopsys White Paper on FPGA solutions.
 
19
Virtex™-II Platform FPGA Data Sheet.
 
20
Virtual Socket Interface Alliance. "Intellectual Property Protection White Paper: Schemes, Alternatives and Discussion Version 1.0", September 2000.
 
21
Xilinx FPGA Reuse Methodology Manual, 2nd Edition.
 
22
High Energy Group, Physics Department, University of Maryland.
 
23
Benchmark Suite for Placement, CAD/VLSI Lab, National Tsinghua University. http://nthucad.cs.nthu.edu.tw/~ycchou/benchmark.
 
24
www.opencores.org.
 
25
www.xilinx.com.


Collaborative Colleagues:
Adarsh K. Jain: colleagues
Lin Yuan: colleagues
Pushkin R. Pari: colleagues
Gang Qu: colleagues

Peer to Peer - Readers of this Article have also read: