Proceedings Article10.1145/513918.513923
Watermarking integer linear programming solutions
Seapahn Megerian,Milenko Drinic,Miodrag Potkonjak +2 more
- 10 Jun 2002
- pp 8-13
TL;DR: It is shown how ILP formulations provide more degrees of freedom for embedding signatures than other existing approaches and how the proof of authorship by watermarking is achieved by introducing additional constraints to limit the solution space.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Survey on IP Watermarking Techniques
TL;DR: This paper survey and classify different techniques used for watermarking IP designs, and defined several evaluation criteria, which can be used as a benchmark for new IPWatermarking developments.
IP watermarking techniques: survey and comparison
Amr T. Abdel-Hamid,Sofiène Tahar,El Mostapha Aboulhamid +2 more
- 22 Jul 2003
TL;DR: This paper outlines IP watermarking and survey the current state-of- the-art of different schemes and algorithms, and highlights the main technical problems that should be solved in order to let IPWatermarking be used widely in industry.
Scheduling of iterative algorithms on FPGA with pipelined arithmetic unit
P. Sucha,Z. Pohl,Zdenek Hanzalek +2 more
- 25 May 2004
TL;DR: It is proved that the problem to find an optimal periodic cyclic schedule satisfying the timing constraints is NP-hard and a solution based on integer linear programming that allows to minimize completion time is suggested.
23
Satisfiability Don't Care condition based circuit fingerprinting techniques
Carson Dunbar,Gang Qu +1 more
- 12 Mar 2015
TL;DR: This paper proposes a novel gate replacement approach to encode fingerprints based on the inherent Satisfiability Don't Care conditions in the circuit and develops a practical method to implement this SDC-based circuit fingerprint.
21
A practical circuit fingerprinting method utilizing observability don't care conditions
Carson Dunbar,Gang Qu +1 more
- 07 Jun 2015
TL;DR: This paper explores the Observability Don't Care (ODC) conditions to create multiple fingerprinting copies of a design IP with minute changes and proposes a fingerprinting heuristics under delay constraints to help reduce area and power overhead.
18
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Synchronous data flow
Edward A. Lee,David G. Messerschmitt +1 more
- 01 Sep 1987
TL;DR: A preliminary SDF software system for automatically generating assembly language code for DSP microcomputers is described, and two new efficiency techniques are introduced, static buffering and an extension to SDF to efficiently implement conditionals.
2K
Implications of classical scheduling results for real-time systems
TL;DR: In this paper, the authors divide the scheduling problem between uniprocessor and multi-processor results, and divide the work between static and dynamic algorithms, and propose a taxonomy of the complexity, fundamental limits and performance bounds.