By Topic

A Dynamic Graph Software Watermarking Algorithm Based on Chaotic Theory

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)
Zhang Shao-bo ; Sch. of Comput. Sci. & Eng., Hunan Univ. of Sci. & Technol., Xiangtan, China ; Zhu Bin

In this study we proposed a robust watermarking algorithm to improve the watermark hidden. The watermark information is separated with the Chinese Remainder Theorem at first and then use Planted Plane Cubic Tree enumeration encoding topology structure. At last the sub-watermarking is hashed to the entire program code by chaotic system to protect the entire program code. In the extracting procedure the user inputs secret key to restore the graph structure into a watermark information to prove his copyright. The experiments indicate its robustness and stealthiness is stronger and more practicable.

Published in:

Industrial Control and Electronics Engineering (ICICEE), 2012 International Conference on

Date of Conference:

23-25 Aug. 2012