loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
New Approaches for Software Watermarking by Register Allocation
August 06-August 08
ISBN: 978-0-7695-3263-9
ASCII Text
x 
 
Hakun Lee, Keiichi Kaneko, "New Approaches for Software Watermarking by Register Allocation," Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on, pp. 63-68, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008.
 
 
BibTex
x
 
@article{ 10.1109/SNPD.2008.137,
author = {Hakun Lee and Keiichi Kaneko},
title = {New Approaches for Software Watermarking by Register Allocation},
journal ={Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3263-9},
pages = {63-68},
doi = {http://doi.ieeecomputersociety.org/10.1109/SNPD.2008.137},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
TI - New Approaches for Software Watermarking by Register Allocation
SN - 978-0-7695-3263-9
SP63
EP68
A1 - Hakun Lee,
A1 - Keiichi Kaneko,
PY - 2008
KW - Software Watermarking
VL - 0
JA - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
ER -
 
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.
Index Terms:
Software Watermarking
Citation:
Hakun Lee, Keiichi Kaneko, "New Approaches for Software Watermarking by Register Allocation," snpd, pp.63-68, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008
Usage of this product signifies your acceptance of the Terms of Use.