Computational forensic techniques for intellectual property protection

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 23, Issue 6, 2004, Pages 987-994

  Wong, Jennifer L ^a   Kirovski, Darko ^b   Potkonjak, Miodrag ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Boolean functions; Design automation; Intellectual property protection

Indexed keywords

ALGORITHMS; AUTOMATION; BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN; HEURISTIC PROGRAMMING; MAXIMUM LIKELIHOOD ESTIMATION; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SCHEDULING; WATERMARKING;

COMPUTATIONAL FORENSIC ENGINEERING (CFE); DESIGN AUTOMATION; GRAP COLORING; INTELLECTUAL PROPERTY PROTECTION;

INTELLECTUAL PROPERTY;

EID: 2942609255     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2004.828122     Document Type: Article

References (34)

1. N. Rudin, K. Inman, G. Stolvitzky, and I. Rigoutsos, DNA Based Identification: Kluwer, 1998.
2. D. McGahn, "Copyright infringement of protected computer software: An analytical method to determine substantial similarity," Rutgers Comput. Technol. Law J., vol. 21, no. 1, pp. 88-142, 1995.
3. D. Grover, "Forensic copyright protection," Comput. Law Secur. Rep., vol. 14, no. 2, pp. 121-122, 1998.
4. B. Baker and U. Manber, "Deducing similarities in Java sources from bytecodes," in Proc. USENIX Tech. Conf., 1998, pp. 179-190.
5. S. Brin, J. Davis, and H. Garcia-Molina, "Copy detection mechanisms for digital documents," in Proc. ACM SIGMOD Annu. Conf., 1995, pp. 398-409.
6. E. Charbon and I. Torunoglu, "Watermarking layout topologies," in Proc. Asia South Pacific Design Automation Conf., 1989, pp. 213-216.
7. A. B. Kahng, J. Lach, W. H. Mangione-Smith, S. Mantik, I. L. Markov, M. Potkonjak, P. Tucker, H. Wang, and G. Wolfe, "Watermarking techniques for intellectual property protection," in Proc. IEEE/ACM Design Automation Conf., 1998, pp. 776-781.
8. G. Wolfe, J. L. Wong, and M. Potkonjak, "Watermarking graph partitioning solutions," IEEE Trans. Computer-Aided Design, vol. 21, pp. 486-489, Oct. 2002.
9. G. Qu and M. Potkonjak, "Analysis of watermarking techniques for graph coloring problem," in Proc. ICCAD, 1998, pp. 190-193.
10. C. Collberg and C. Thomborson, "Software watermarking: Models and dynamic embeddings," in Proc. Symp. Principles Program. Lang., 1999, pp. 311-324.
11. F. Leighton, "A graph coloring algorithm for large scheduling algorithms," J. Res. Nat. Bureau Stds., vol. 84, pp. 489-506, 1979.
12. I. Jolliffe, Principal Component Analysis. Berlin, Germany. Springer-Verlag, 1986.
13. B. Efron and R. Tibshirani, An Introduction to the Bootstrap. London, U.K.: Chapman & Hall, 1993.
14. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: W. H. Freeman, 1979.
15. D. Welsh and M. Powell, "An upper bound for the chromatic number of a graph and its applications to timetabling problems," Comput. J., vol. 10, no. 85-86, 1967.
16. D. Brelaz, "New methods to color the vertices of a graph," Commun. ACM, vol. 22, no. 4, pp. 251-256, 1979.
17. B. Bollobas, Random Graphs. Norwell, MA: Academic, 1985.
18. A. Hertz and D. de Werra, "Using tabu search techniques for graph coloring," J. Comput., vol. 39, no. 4, pp. 345-351, 1987.
19. J. L. Wong, D. Kirovski, and M. Potkonjak, "Computational forensic techniques for intellectual property protection," Univ. of California, Los Angeles, Tech. Rep. TR030 048, 2003.
20. Joseph culberson's graph coloring resources page Available: http://web.cs.ualberta.ca/~joe/Coloring/index.html [Online]
21. D. Kirovski, Y.-Y. Hwang, M. Potkonjak, and J. Cong, "Intellectual property protection by watermarking combinational logic synthesis solutions," in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, 1998, pp. 194-198.
22. M. DeGroot, Probability and Statistics. Reading, MA: Addison-Wesley, 1989.
23. P. Stephan, R. K. Brayton, and A. S. Vincentelli, "Combinational test generation using satisfiability," IEEE Trans. Computer-Aided Design, vol. 15, pp. 1167-1176, Sept. 1996.
24. H. Konuk and T. Larrabee, "Explorations of sequential ATPG using Boolean satisfiability," in Proc. IEEE VLSI Test Symp., 1993, pp. 85-90.
25. S. Devadas, "Optimal layout via Boolean satisfiability," in Proc. Int. Conf. Computer-Aided Design, 1989, pp. 294-297.
26. J. Marques-Silva and K. Sakallah, "GRASP: A search algorithm for prepositional satisfiability," IEEE Trans. Comput., vol. 48, pp. 506-521, May 1999.
27. B. Selman, "Stochastic search and phase transitions: Al meets physics," in IJCAI, vol. 1, 1995, pp. 998-1002.
28. M. Goemans and D. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming," J. ACM, vol. 42, no. 6, pp. 1115-1145, 1995.
29. R. Bryant, "Binary decision diagrams and beyond: Enabling technologies for formal verification," in Proc. Int. Conf. Computer-Aided Design, 1995, pp. 236-243.
30. B. Selman, H. Kautz, and B. Cohen, "Local search strategies for satisfiability testing," in Proc. Cliques, Coloring, Satisfiability: 2nd DIMACS Implementation Challenge, 1993, pp. 521-532.
31. J. Crawford, "Solving satisfiability problems using a combination of systematic and local search," in Proc. 2nd DIMACS Challenge, 1993, pp. 1-7.
32. R. Bayardo and R. Schrag, "Using CSP look-back techniques to solve exceptionally hard SAT instances," in Principles and Practice of Constraint Programming. New York: Springer, 1996, pp. 46-60.
33. A. P. Kamath, N. K. Karmarkar, K. G. Ramakrishnan, and M. G. C. Resende, "An interior point approach to Boolean vector function synthesis," in Proc. Midwest Symp. Circuits Syst., 1993, pp. 185-189.
34. Y. Tsuji and A. V. Gelder, "Incomplete thoughts about incomplete satisfiability procedures," in Proc. 2nd DIMACS Challenge, 1993, pp. 559-586.