Optimization-Intensive Watermarking Techniques for Decision Problems
| dc.contributor.author | Wong, Jennifer L. | |
| dc.contributor.author | Qu, Gang | |
| dc.contributor.author | Potkonjak, Miodrag | |
| dc.date.accessioned | 2009-04-10T18:03:13Z | |
| dc.date.available | 2009-04-10T18:03:13Z | |
| dc.date.issued | 1999-06 | |
| dc.description.abstract | Abstract—Recently, a number of watermarking-based intellectual property protection techniques have been proposed. Although they have been applied to different stages in the design process and have a great variety of technical and theoretical features, all of them share two common properties: 1) they are applied solely to optimization problems and 2) do not involve any optimization during the watermarking process. In this paper, we propose the first set of optimization-intensive watermarking techniques for decision problems. In particular, we demonstrate, by example of the Boolean satisfiability (SAT) problem, how one can select a subset of superimposed watermarking constraints so that the uniqueness of the signature and the likelihood of satisfying the satisfiability problem are simultaneously maximized. We have developed three SAT watermarking techniques: adding clauses, deleting literals, and push-out and pull-back. Each technique targets different types of signature-induced constraint superimposition on an instance of the SAT problem. In addition to comprehensive experimental validation, we theoretically analyze the potentials and limitations of the proposed watermarking techniques. Furthermore, we analyze the three proposed optimization-intensive watermarking SAT techniques in terms of their suitability for copy detection. | en |
| dc.format.extent | 328243 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | G. Qu, J.L. Wong, and M. Potkonjak. "Optimization-Intensive Watermarking Techniques for Decision Problems," 36th ACM/IEEE Design Automation Conference Proceedings, pp. 33-36, June 1999. | en |
| dc.identifier.uri | http://hdl.handle.net/1903/9038 | |
| dc.language.iso | en_US | en |
| dc.publisher | IEEE | en |
| dc.relation.isAvailableAt | A. James Clark School of Engineering | en_us |
| dc.relation.isAvailableAt | Electrical & Computer Engineering | en_us |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_us |
| dc.relation.isAvailableAt | University of Maryland (College Park, MD) | en_us |
| dc.rights.license | Copyright © 1999 IEEE. Reprinted from ACM/IEEE Design Automation Conference Proceedings. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Maryland's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. | |
| dc.subject | Boolean functions | en |
| dc.subject | design automation | en |
| dc.subject | logic design | en |
| dc.title | Optimization-Intensive Watermarking Techniques for Decision Problems | en |
| dc.type | Article | en |