Watermarking integer linear programming solutions

Authors:
Seapahn Megerian;Milenko Drinic;Miodrag Potkonjak
Affiliations:
University of California Los Angeles;University of California Los Angeles;University of California Los Angeles
Venue:
Proceedings of the 39th annual Design Automation Conference
Year:
2002

Citing 11
Cited 1

Simultaneous scheduling and allocation for cost constrained optimal architectural synthesis

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Watermarking techniques for intellectual property protection

DAC '98 Proceedings of the 35th annual Design Automation Conference
Optimization-intensive watermarking techniques for decision problems

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Behavioral synthesis techniques for intellectual property protection

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Watermarking while preserving the critical path

Proceedings of the 37th Annual Design Automation Conference
Boolean satisfiability in electronic design automation

Proceedings of the 37th Annual Design Automation Conference
Localized watermarking: methodology and application to operation scheduling

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Fair watermarking techniques

ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Implications of Classical Scheduling Results for Real-Time Systems

Computer
Fast Prototyping of Datapath-Intensive Architectures

IEEE Design & Test

Confidentiality preserving integer programming for global routing

Proceedings of the 49th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear programming (LP) in its many forms has proven to be an indispensable tool for expressing and solving optimization problems in numerous domains. We propose the first set of generic watermarking techniques for integer-LP (ILP). The proof of authorship by watermarking is achieved by introducing additional constraints to limit the solution space and can be used as effective means of intellectual property protection (IPP) and authentication. We classify and analyze the types of constraints in the ILP watermarking domain and show how ILP formulations provide more degrees of freedom for embedding signatures than other existing approaches. To demonstrate the effectiveness of the proposed ILP watermarking techniques, the generic discussion is further concretized using two examples, namely Satisfiability and Scheduling.