Watermarking graph partitioning solutions

The authors introduce an Intellectual Property Protection (IPP) technique for graph partitioning which watermarks solutions to the graph partitioning problems so that they carry an author's signature. This technique is completely transparent to the actual computer-aided design tool which does the partitioning and is implemented by preprocessing and postprocessing alone. The authors propose five different schemes for the watermarking of partitioning solutions. The goal is to construct a partitioning solution which not only has a small edge cut, but also encodes the signature of the author. The key idea of all of our schemes is to map the signature into a set of constraints and then satisfy a disproportionate number of these constraints. Four of our schemes are based upon the idea of encouraging groups of vertices to be in the same partition. The fifth is based upon the encouragement of certain edges to be cut by the partitioning. The fifth scheme shows superior performances on all of the cases which we tested, including both two-way and multiway partitioning. The watermarking scheme produces solutions that have very low-quality degradation levels, yet carry signatures that are convincingly unambiguous, extremely unlikely to be present by coincidence and difficult to detect or remove without completely resolving the partitioning problem.

[1]  V. Rao,et al.  New heuristics and lower bounds for graph partitioning , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[2]  Sushil Jajodia,et al.  Information Hiding: Steganography and Watermarking-Attacks and Countermeasures: Steganography and Watermarking - Attacks and Countermeasures , 2000, IH 2012.

[3]  Rupak Majumdar,et al.  Watermarking of SAT using combinatorial isolation lemmas , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[4]  Rafail Ostrovsky,et al.  Minimum resource zero knowledge proofs , 1989, 30th Annual Symposium on Foundations of Computer Science.

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

[6]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[7]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[8]  Bruce Schneier,et al.  Applied cryptography : protocols, algorithms, and source codein C , 1996 .

[9]  Melvin A. Breuer,et al.  A partitioning method for achieving maximal test concurrency in pseudo-exhaustive testing , 1991, Digest of Papers 1991 VLSI Test Symposium 'Chip-to-System Test Concerns for the 90's.

[10]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..

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

[12]  Edward J. Delp,et al.  A watermark for digital images , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[13]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[14]  Steven H. Low,et al.  Copyright protection for the electronic distribution of text documents , 1999, Proc. IEEE.

[15]  Edward A. Lee,et al.  The Extended Partitioning Problem: Hardware/Software Mapping, Scheduling, and Implementation-bin Selection , 1997, Des. Autom. Embed. Syst..

[16]  F. Brglez,et al.  Circuit partitioning for logic synthesis , 1991 .

[17]  Walter Bender,et al.  Techniques for Data Hiding , 1996, IBM Syst. J..

[18]  Miodrag Potkonjak,et al.  Effective iterative techniques for fingerprinting design IP , 1999, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[19]  Dan Boneh,et al.  Collusion-Secure Fingerprinting for Digital Data , 1998, IEEE Trans. Inf. Theory.

[20]  Béla Bollobás,et al.  Random Graphs , 1985 .

[21]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[22]  Jason Cong,et al.  Acyclic Multi-Way Partitioning of Boolean Networks , 1994, 31st Design Automation Conference.

[23]  Miodrag Potkonjak,et al.  Fingerprinting techniques for field-programmable gate arrayintellectual property protection , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[24]  Miodrag Potkonjak,et al.  Robust FPGA intellectual property protection through multiple small watermarks , 1999, DAC '99.

[25]  Shashi Shekhar,et al.  CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations , 1997, IEEE Trans. Knowl. Data Eng..

[26]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[27]  Fred Piper,et al.  Stream Ciphers , 1982, EUROCRYPT.

[28]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[29]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[30]  Michael Randolph Garey,et al.  Johnson: "computers and intractability , 1979 .

[31]  Miodrag Potkonjak,et al.  Optimization-intensive watermarking techniques for decision problems , 1999, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[32]  Ahmed H. Tewfik,et al.  Data hiding for multimedia personalization, interaction, and protection , 1997 .

[33]  Bernard P. Zajac.  Applied cryptography: Protocols, algorithms, and source code in C , 1994 .

[34]  Miodrag Potkonjak,et al.  Intellectual Property Metering , 2001, Information Hiding.

[35]  Giovanni De Micheli,et al.  Partitioning of functional models of synchronous digital systems , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[36]  Miodrag Potkonjak,et al.  Techniques for intellectual property protection of DSP designs , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[37]  David Chaum,et al.  Group Signatures , 1991, EUROCRYPT.

[38]  Resve Saleh,et al.  Automatic Partitioning And Dynamic Mixed-mode Simulation , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.

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

[40]  Hugo De Man,et al.  Partitioning-Based Allocation of Dedicated Data-Paths in the Architectural Synthesis for High Throughput Applications , 1991, Conference on Advanced Research in VLSI.

[41]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[42]  Miodrag Potkonjak,et al.  Watermarking while preserving the critical path , 2000, Proceedings 37th Design Automation Conference.

[43]  Miodrag Potkonjak,et al.  Robust IP watermarking methodologies for physical design , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[44]  Jason Cong,et al.  Intellectual property protection by watermarking combinational logic synthesis solutions , 1998, ICCAD '98.

[45]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[46]  Miodrag Potkonjak,et al.  Forensic engineering techniques for VLSI CAD tools , 2000, Proceedings 37th Design Automation Conference.

[47]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[48]  Christian S. Collberg,et al.  Software watermarking: models and dynamic embeddings , 1999, POPL '99.

[49]  Frank Vahid,et al.  Incremental hardware estimation during hardware/software functional partitioning , 1995, IEEE Trans. Very Large Scale Integr. Syst..

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

[51]  Miodrag Potkonjak,et al.  Effective iterative techniques for fingerprinting design IP [VLSI CAD] , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).

[52]  David Chaum,et al.  Zero-Knowledge Undeniable Signatures , 1991, EUROCRYPT.

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

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

[55]  Philip R. Zimmermann,et al.  The official PGP user's guide , 1996 .

[56]  C.-C. Jay Kuo,et al.  Blind digital watermarking for cartoon and map images , 1999, Electronic Imaging.

[57]  Darko Kirovski,et al.  Robust Covert Communication over a Public Audio Channel Using Spread Spectrum , 2001, Information Hiding.

[58]  Richard J. Lipton,et al.  A Revocable Backup System , 1996, USENIX Security Symposium.

[59]  David Chaum,et al.  Undeniable Signatures , 1989, CRYPTO.

[60]  Andrew B. Kahng,et al.  Multilevel circuit partitioning , 1997, DAC.

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

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

[63]  Miodrag Potkonjak,et al.  Constraint-based watermarking techniques for design IP protection , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[64]  Alberto L. Sangiovanni-Vincentelli,et al.  Communication based logic partitioning , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.