By Topic

Managing copyright in open networks

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

3 Author(s)
Piva, A. ; Florence Univ., Italy ; Bartolini, F. ; Barni, M.

The need for an electronic copyright management system (ECMS) that protects intellectual property rights (IPR) in open network environments continues to grow. Network security issues are classically handled through cryptography; however, cryptography ensures confidentiality, authenticity, and integrity only when a message is transmitted through a public channel, such as an open network. It does not protect against unauthorized copying after the message has been successfully transmitted. Digital watermarking is an effective way to protect copyright of multimedia data even after its transmission. A watermark, embedded in the data, can uniquely identify the document's owner or authorized user. The main problem with using watermark technology, for IPR protection, however, is its reversibility. Anyone who can read or detect the watermark can also remove it by inverting the watermark process. Our open network ECMS combines watermarking with cryptography to achieve reliable copyright protection while satisfying two contrasting requirements: actors in ECMS transactions must be able to verify that the watermark granting their rights is truly embedded in the multimedia document; and actors (other than the author) must not be able to remove the watermark

Published in:

Internet Computing, IEEE  (Volume:6 ,  Issue: 3 )