Forensic engineering techniques for VLSI CAD tools

Authors:
Darko Kirovski;David Liu;Jennifer Wong;Miodrag Potkonjak
Affiliations:
Computer Science Department, University of California, Los Angeles;Computer Science Department, University of California, Los Angeles;Computer Science Department, University of California, Los Angeles;Computer Science Department, University of California, Los Angeles
Venue:
Proceedings of the 37th Annual Design Automation Conference
Year:
2000

Citing 14
Cited 7

Copy detection mechanisms for digital documents

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Binary decision diagrams and beyond: enabling technologies for formal verification

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Practical legal aspects of software reverse engineering

Communications of the ACM
Efficient coloring of a large spectrum of graphs

DAC '98 Proceedings of the 35th annual Design Automation Conference
Robust IP watermarking methodologies for physical design

DAC '98 Proceedings of the 35th annual Design Automation Conference
Analysis of watermarking techniques for graph coloring problem

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Software watermarking: models and dynamic embeddings

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Robust techniques for watermarking sequential circuit designs

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
New methods to color the vertices of a graph

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

Computers and Intractability: A Guide to the Theory of NP-Completeness
Deducing similarities in Java sources from bytecodes

ATEC '98 Proceedings of the annual conference on USENIX Annual Technical Conference
Stochastic search and phase transitions: AI meets physics

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Publicly detectable techniques for the protection virtual components

Proceedings of the 38th annual Design Automation Conference
Watermarking graph partitioning solutions

Proceedings of the 38th annual Design Automation Conference
Hardware metering

Proceedings of the 38th annual Design Automation Conference
Intellectual Property Metering

IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Zero overhead watermarking technique for FPGA designs

Proceedings of the 13th ACM Great Lakes symposium on VLSI
Security in sensor networks: watermarking techniques

Wireless sensor networks
VLSI CAD tool protection by birthmarking design solutions

GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI

Quantified Score

Hi-index	0.00

Visualization

Abstract

The proliferation of the Internet has affected the business model of almost all semiconductor and VLSI CAD companies that rely on intellectual property (IP) as their main source of revenues. The fact that IP has become more accessible and easily transferable, has influenced the emergence of copyright infringement as one of the most common obstructions to e-commerce of IP.In this paper, we propose a generic forensic engineering technique that addresses a number of copyright infringement scenarios. Given a solution SP to a particular optimization problem instance P and a finite set of algorithms A applicable to P, the goal is to identify with a certain degree of confidence the algorithm Ai which has been applied to P in order to obtain SP. We have applied forensic analysis principles to two problem instances commonly encountered in VLSI CAD: graph coloring and boolean satisfiability. We have demonstrated that solutions produced by strategically different algorithms can be associated with their corresponding algorithms with high accuracy.