Skip to main content

A Novel Watermark Algorithm for Document Protection Based on XML

  • Conference paper
Information and Automation (ISIA 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 86))

Included in the following conference series:

  • 802 Accesses

Abstract

Since networks progressed remarkably, XML documents created as digital contents or used for the data exchange between companies are becoming general. Resolving copyright problem and realization of communication privacy become more important in the scene using XML documents. This paper presented a novel watermark algorithm for document protection based on XML. The display effectiveness and the length of document are not changed by the algorithm, but watermarking can’t easily be detected and attacked. Experimental results show that the proposed scheme is robust against various forms of attacks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Swanson, M.D., Kobayashi, M.K., Tewfika, H.: Multimedia data-embedding and watermarking technologies. Proc. of the IEEE 86(6), 1064–1087 (1998)

    Article  Google Scholar 

  2. Johnson, N.F., Jajodia, S.: Exploring steganography seeing the unseen. IEEE Computer 31(2), 26–34 (1998)

    Article  Google Scholar 

  3. Moulin, P., Sullivan, J.A.: Information theoretic analysis of information hidding. IEEE Transaction on Information Theory 49(3), 563–593 (2003)

    Article  Google Scholar 

  4. Chapman, M., Davida, D.: Hiding the Hidden: A Software System for Concealing Ciphertext as Innocuous Text. In: Luby, M., Rolim, J.D.P., Serna, M. (eds.) FC 1997. LNCS, vol. 1318, pp. 335–345. Springer, Heidelberg (1997)

    Google Scholar 

  5. Shibuya, R., Kaji, Y., Kasami, T.: Digital watermarking for PostScript and PDF documents. In: Symposium on Cryptography and Information Security, SCIS 1998, 9.2.E (January 1998) (in Japanese)

    Google Scholar 

  6. Spammimic - hide a message in spam, http://www.spammimic.com/index.shtml

  7. Kuribayashi, M., Tanaka, H.: Video Watermarking of Which Embedded Information Depends on the Distance between Two Signal Positions. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences E86-A(12), 3267–3275 (2003)

    Google Scholar 

  8. Dick, K.: XML: A Manager’s Guide, 2nd edn. Pearson Education, Inc., London (2003)

    Google Scholar 

  9. Damiani, E., di Vimercati, S.D.C., Samarati, P.: Towards securing XML Web services. In: Proceedings of the 2002 ACM Workshop on XML Security, pp. 90–96 (November 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cao, Z., Yu, D. (2011). A Novel Watermark Algorithm for Document Protection Based on XML. In: Qi, L. (eds) Information and Automation. ISIA 2010. Communications in Computer and Information Science, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19853-3_91

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19853-3_91

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19852-6

  • Online ISBN: 978-3-642-19853-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics