ACM Home Page
Please provide us with feedback. Feedback
Watermarking integer linear programming solutions
Full text PdfPdf (217 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 39th annual Design Automation Conference table of contents
New Orleans, Louisiana, USA
SESSION: Web and IP based design table of contents
Pages: 8 - 13  
Year of Publication: 2002
ISBN ~ ISSN:0738-100X , 1-58113-461-4
Authors
Seapahn Megerian  University of California Los Angeles
Milenko Drinic  University of California Los Angeles
Miodrag Potkonjak  University of California Los Angeles
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 64,   Citation Count: 0
Additional Information:

abstract   references   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/513918.513923
What is a DOI?

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.


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
R.J. Bayardo and R. Schrag. Using CSP Look-Back Techniques To Solve Exceptionally Hard SAT Instances. Principles and Practice of Constraint Programming, pp.46--60, 1996.
 
2
A.G. Bors and I. Pitas. Image Watermarking Using DCT Domain Constraints. International Conference on Image Processing, Vol.3, pp.231--244, 1996.
3
 
4
5
6
 
7
 
8
E.A. Lee, D.G. Messerschmitt. Synchronous Dataflow. Procs. of the IEEE, Vol.75, (no.9), pp.1235--45, 1987.
9
10
 
11
P.G. Paulin and J.P. Knight. Force-Directed Scheduling For The Behavioral Synthesis Of ASICs. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol.8, pp.661--679, 1989.
12
13
 
14
 
15

Collaborative Colleagues:
Seapahn Megerian: colleagues
Milenko Drinic: colleagues
Miodrag Potkonjak: colleagues