Watermarking of SAT using combinatorial isolation lemmas

Watermarking of hardware and software designs is an effective mechanism for intellectual property protection (IPP). Two important criteria for watermarking schemes are credibility and fairness. In this paper, we present the unique solution-based watermarking technique which provides, in a sense, the ultimate answer to both credibility and fairness requirements. Leveraging on a combinatorial theorem of Valiant and Vazirani, we demonstrate how ultimate credibility and complete fairness can almost always be achieved with high probability during the watermarking of the solution of the satisfiability (SAT) problem. The effectiveness of the technique is demonstrated on both specially created examples where the number of solutions is known, as well as on common CAD and operation research SAT instances.

[1]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2]  J. P. Marques,et al.  GRASP : A Search Algorithm for Propositional Satisfiability , 1999 .

[3]  Miodrag Potkonjak,et al.  Watermarking techniques for intellectual property protection , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[4]  Gang Qu,et al.  Fair watermarking techniques , 2000, Proceedings 2000. Design Automation Conference. (IEEE Cat. No.00CH37106).

[5]  I. Torunoglu,et al.  Watermarking-based copyright protection of sequential functions , 2000, IEEE Journal of Solid-State Circuits.

[6]  Frank Hartung,et al.  Multimedia watermarking techniques , 1999, Proc. IEEE.

[7]  Hantao Zhang,et al.  SATO: An Efficient Propositional Prover , 1997, CADE.

[8]  Peixin Zhong,et al.  FPGA-based SAT solver architecture with near-zero synthesis and layout overhead , 2000 .

[9]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[10]  Daniel G. Saab,et al.  Parallel and scalable architecture for solving SATisfiability on reconfigurable FPGA , 2000, Proceedings of the IEEE 2000 Custom Integrated Circuits Conference (Cat. No.00CH37044).

[11]  Arlindo L. Oliveira.  Robust techniques for watermarking sequential circuit designs , 1999, DAC '99.

[12]  Edoardo Charbon,et al.  Watermarking-based copyright protection of sequential functions , 1999 .

[13]  Bart Selman,et al.  Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .

[14]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances , 1996, CP.

[15]  Miodrag Potkonjak,et al.  Fingerprinting intellectual property using constraint-addition , 2000, DAC.

[16]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[17]  I. Pitas,et al.  The use of watermarks in the protection of digital multimedia products , 1999, Proc. IEEE.

[18]  Joao Marques-Silva,et al.  Boolean satisfiability in electronic design automation , 2000, Proceedings 37th Design Automation Conference.

[19]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[20]  Miodrag Potkonjak,et al.  Behavioral synthesis techniques for intellectual property protection , 2005, TODE.

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .