Skip to main content

Resilient Information Hiding for Abstract Semi-structures

  • Conference paper
Digital Watermarking (IWDW 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2939))

Included in the following conference series:

Abstract

Most work on watermarking has resulted in techniques for different types of data: image, audio, video, text/language, software, etc. In this paper we discuss the watermarking of abstract structured aggregates of multiple types of content, such as multi-type/media documents. These semi-structures can be usually represented as graphs and are characterized by value lying both in the structure and in the individual nodes. Example instances include XML documents, complex web content, workflow and planning descriptions, etc. We propose a scheme for watermarking abstract semi-structures and discuss its resilience with respect to attacks. While content specific watermarking deals with the issue of protecting the value in the structure’s nodes, protecting the value pertaining to the structure itself is a new, distinct challenge. Nodes in semi-structures are value-carrying, thus a watermarking algorithm could make use of their encoding capacity by using traditional watermarking. For example if a node contains an image then image watermarking algorithms can be deployed for that node to encode parts of the global watermark. But, given the intrinsic value attached to it, the graph that “glues” these nodes together is in itself a central element of the watermarking process we propose. We show how our approach makes use of these two value facets, structural and node-content.

Portions of this work were supported by Grants EIA-9903545, IIS-0325345, IIS-0219560, IIS-0312357, IIS-9985019, IIS-9972883 and IIS-0242421 from the National Science Foundation, Contract N00014-02-1-0364 from the Office of Naval Research, by sponsors of the Center for Education and Research in Information Assurance and Security, and by Purdue Discovery Park’s e-enterprise Center.

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. Atallah, M.J., Raskin, V., Hempelmann, C.F., Karahan, M., Sion, R., Triezenberg, K.E., Topkara, U.: Natural language watermarking and tamperproofing. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol. 2578, pp. 196–212. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Babai, L., Kucera, L.: Canonical labeling of graphs in linear average time. In: Proc. 20th IEEE Symposium on Foundations of Computer Science, pp. 39–46 (1979)

    Google Scholar 

  3. Babai, L., Luks, E.: Canonical labeling of graphs. In: Fifteenth Annual ACM Symposium on Theory of Computing, pp. 171–183. ACM, New York (1983)

    Chapter  Google Scholar 

  4. Collberg, C., Thomborson, C.: Software watermarking: Models and dynamic embeddings. In: Principles of Programming Languages, San Antonio, TX (January 1999)

    Google Scholar 

  5. Cox, I., Bloom, J., Miller, M.: Digital watermarking. In: Digital Watermarking, Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  6. Katzenbeisser, S., Petitcolas, F. (eds.) Information hiding techniques for steganography and digital watermarking, Artech House, Norwood (2001)

    Google Scholar 

  7. Faulon, J.: Automorphism partitioning and canonical labeling can be solved in polynomial time for molecular graphs. J. Chem. Inf. Comput. Sci. 38, 432–444 (1998)

    Google Scholar 

  8. Juels, A., Wattenberg, M.: A fuzzy commitment scheme. In: ACM Conference on Computer and Communications Security, pp. 28–36 (1999)

    Google Scholar 

  9. Kucera, L.: Canonical labeling of regular graphs in linear average time. In: IEEE Symposium on Foundations of Computer Science, pp. 271–279 (1987)

    Google Scholar 

  10. Palsberg, J., Krishnaswamy, S., Kwon, M., Ma, D., Shao, Q., Zhang, Y.: Experience with software watermarking. In: Proceedings of ACSAC, 16th Annual Computer Security Applications Conference, pp. 308–316 (2000)

    Google Scholar 

  11. Sion, R.: Proving ownership over categorical data. In: Proceedings of the IEEE International Conference on Data Engineering ICDE 2004 (2004)

    Google Scholar 

  12. Sion, R., Atallah, M., Prabhakar, S.: Power: Metrics for evaluating watermarking algorithms. In: Proceedings of IEEE ITCC 2002, CERIAS TR 2001- 55, IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  13. Sion, R., Atallah, M., Prabhakar, S.: Rights protection for relational data. In: CERIAS-TR 2002-28, Proceedings of ACM SIGMOD (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sion, R., Atallah, M., Prabhakar, S. (2004). Resilient Information Hiding for Abstract Semi-structures. In: Kalker, T., Cox, I., Ro, Y.M. (eds) Digital Watermarking. IWDW 2003. Lecture Notes in Computer Science, vol 2939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24624-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24624-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21061-0

  • Online ISBN: 978-3-540-24624-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics