IJSRSET calls volunteers interested to contribute towards the scientific development in the field of Science, Engineering and Technology

Home > IJSRSET162291                                                     

Improving Performance of Graph Selector in Heap Graph Based Software Theft Detection


Prachi M. Tamgadge, S. A. Murab
  • Abstract
  • Authors
  • Keywords
  • References
  • Details
Various applications for web users are designed using client side scripting language such as JavaScript. This source code of JavaScript can be easily copied through browser. JavaScript was implemented as a part of web browsers, so that the user to can control the browser and alter the displayed website contents. Hence the informal cribbing of JavaScript code has become the serious threat. Software watermarking and code obfuscation are two approaches to detect software piracy. But watermarks can be defaced and code obfuscation cannot prevent the code from being copied. Hence software birthmark is introduced in the program to detect the code theft of JavaScript programs. The largest object graph is chosen to become the birthmark of a program. The software birthmark is extracted using the run-time heap. The behavioral structure of the software is extracted into heap graph which shows how the objects are linked together. The aim is the improvement of the graph selector to choose the graph extracted from the program.

Prachi M. Tamgadge, S. A. Murab

Watermarking, Obfuscation, Software Birthmark, Heap Graph, Theft Detection

  1. C. Collberg and C. Thomborson, “Software watermarking: Models and dynamic embeddings,” in Proceeding Symposium Principles of Programming Languages (POPL’99), 1999, pp. 311–324.
  2. A. Monden, H. Iida, K. I. Matsumoto, K. Inoue, and K. Torii, “Watermarking java programs,” in Proceeding International Symposium Future Software Technology, Nanjing, China, 1999.
  3. C. Collberg, E. Carter, S. Debray, A. Huntwork, J. Kececioglu, C. Linn, and M. Stepp, “Dynamic path-based software watermarking,” in Proceeding ACM SIGPLAN 2004 Conference Programming Language Design and Implementation (PLDI ’04), New York, 2004, pp. 107–118, ACM.
  4. Derrick Grover. Program identification. In Derrick Grover, editor, The Protection of Computer Software – Its Technology and Applications, pages 122–154. Cambridge University Press, 1989.
  5. G. Myles and C. Collberg, “Detecting software theft via whole program path birthmarks,” in Proceeding Inf. Security 7th International Conference (ISC 2004), Palo Alto, CA, Sep. 27–29, 2004, pp. 404–415.
  6. H. Tamada, K. Okamoto, M. Nakamura, and A. Monden, “Dynamic software birthmarks to detect the theft of windows applications,” in Proceeding International Symposium Future Software Technology Xian, China, 2004.
  7. H. Tamada, K. Okamoto, M. Nakamura, A. Monden, and K. I. Matsumoto, “Design and Evaluation of birthmarks for detecting theft of java programs”, in Proceeding IASTED International Conference Software Engineering, 2004, pp. 569-575.
  8. G. Myles and C. Collberg, “K-gram based software birthmarks,” in Proceeding 2005 ACM  Symposium Application Computing (SAC ’05), New York, 2005, pp. 314–318, ACM.
  9. H. Tamada, K. Okamoto, M. Nakamura, A. Monden, and K. I. Matsumoto, “Design and Evaluation of Dynamic Software Birthmarks based on API Calls”, Nara Institute of Science and Technology, Rep., 2007.
  10. D. Schuler, V. Dallmeier, and C. Lindig, “A dynamic birthmark for java,” in Proceeding 22nd IEEE/ACM International Conference Automated Software Engineering (ASE ’07), New York, 2007, pp. 274–283, ACM.
  11. X. Wang, Y. C. Jhi, S. Zhu, and P. Liu, “Behavior based software theft detection,” in Proceeding 16th ACM Conference Comput. and Commun. Security (CCS ’09), New York, 2009, pp. 280–290, ACM
  12. P. Chan, L. Hui, and S. Yiu, “Jsbirth: Dynamic JavaScript birthmark based on the run-time heap,” in Proceeding. 2011 IEEE 35th Annual Comput. Software and Applications Conference (COMPSAC), July 2011, pp. 407–412.
  13. P. Chan, L. Hui, and S. Yiu, “Heap graph based software theft detection” 2013 IEEE Transactions on Information Forensics and Security, 2013,v. 8 n. 1, p.101

Publication Details

Published in : Volume 2 | Issue 2 | March-April - 2016
Date of Publication Print ISSN Online ISSN
2016-04-30 2395-1990 2394-4099
Page(s) Manuscript Number   Publisher
306-310 IJSRSET162291   Technoscience Academy

Cite This Article

Prachi M. Tamgadge, S. A. Murab, "Improving Performance of Graph Selector in Heap Graph Based Software Theft Detection", International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 2, Issue 2, pp.306-310, March-April-2016.
URL : http://ijsrset.com/IJSRSET162291.php