Skip to content
University of Maryland LibrariesDigital Repository at the University of Maryland
    • Login
    View Item 
    •   DRUM
    • A. James Clark School of Engineering
    • Electrical & Computer Engineering
    • Electrical & Computer Engineering Research Works
    • View Item
    •   DRUM
    • A. James Clark School of Engineering
    • Electrical & Computer Engineering
    • Electrical & Computer Engineering Research Works
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Optimization-Intensive Watermarking Techniques for Decision Problems

    Thumbnail
    View/Open
    j08.pdf (320.5Kb)
    No. of downloads: 695

    Date
    2004-01
    Author
    Wong, Jennifer L.
    Qu, Gang
    Potkonjak, Miodrag
    Citation
    J.L. Wong, G. Qu, and M. Potkonjak. "Optimization-Intensive Watermarking Techniques for Decision Problems," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol.23, No. 1, pp.119-127, January 2004.
    Metadata
    Show full item record
    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.
    URI
    http://hdl.handle.net/1903/8955
    Collections
    • Electrical & Computer Engineering Research Works
    Rights
    Copyright © 2004 IEEE. Reprinted from IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 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.

    DRUM is brought to you by the University of Maryland Libraries
    University of Maryland, College Park, MD 20742-7011 (301)314-1328.
    Please send us your comments.
    Web Accessibility
     

     

    Browse

    All of DRUMCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister
    Pages
    About DRUMAbout Download Statistics

    DRUM is brought to you by the University of Maryland Libraries
    University of Maryland, College Park, MD 20742-7011 (301)314-1328.
    Please send us your comments.
    Web Accessibility