Watermarking graph partitioning solutions

Authors:
Greg Wolfe;Jennifer L. Wong;Miodrag Potkonjak
Affiliations:
Computer Science Department, University of California, Los Angeles, CA;Computer Science Department, University of California, Los Angeles, CA;Computer Science Department, University of California, Los Angeles, CA
Venue:
Proceedings of the 38th annual Design Automation Conference
Year:
2001

Citing 9
Cited 4

Undeniable signatures

CRYPTO '89 Proceedings on Advances in cryptology
Recent directions in netlist partitioning: a survey

Integration, the VLSI Journal
Techniques for data hiding

IBM Systems Journal
Multilevel circuit partitioning

DAC '97 Proceedings of the 34th annual Design Automation Conference
Watermarking techniques for intellectual property protection

DAC '98 Proceedings of the 35th annual Design Automation Conference
Robust techniques for watermarking sequential circuit designs

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Forensic engineering techniques for VLSI CAD tools

Proceedings of the 37th Annual Design Automation Conference
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Query-preserving watermarking of relational databases and XML documents

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A watermarking system for IP protection by a post layout incremental router

Proceedings of the 42nd annual Design Automation Conference
An Efficient and Reliable Watermarking System for IP Protection

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Query-preserving watermarking of relational databases and Xml documents

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Trends in the semiconductor industry towards extensive design and code reuse motivate a need for adequate Intellectual Property Protection (IPP) schemes. We offer a new general IPP scheme called constraint-based watermarking and analyize it in the context of the graph partitioning problem. Graph partitioning is a critical optimization problem that has many applications, particularly in the semiconductor design process. Our IPP technique for graph partitioning watermarks solutions to graph partitioning problems so that they carry an author's signature. Our technique is transparent to the actual CAD tool which does the partitioning. Our technique produces solutions that have very low quality degradation levels, yet carry signatures that are convincingly unambiguous, extremely unlikely to be present by coincidence, and difficult to detect or remove without completely resolving the partitioning problem.