By Topic

New Approaches for Software Watermarking by Register Allocation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hakun Lee ; Grad. Sch. of Eng., Tokyo Univ. of Agric. & Technol., Koganei ; Kaneko, K.

QP and QPS algorithms for software watermarking add extra edges to an interference graph of a program and then color the graph to embed a message by allocation of registers to variables. QP algorithm has a drawback that the embedded message is not always retrievable. QPS algorithm has a drawback that it can embed the shorter messages only. In this study, we present two new algorithms color change (CC) and color permutation (CP) that embed a message by changing the colors for the interference graph without changing its structure. CC algorithm is effective when the number of the variables in the program is large enough while CP algorithm is effective when the number of colors used in the interference graph is large enough. Both algorithms can retrieve any embedded messages and they can embed the longer messages into software.

Published in:

Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008. SNPD '08. Ninth ACIS International Conference on

Date of Conference:

6-8 Aug. 2008