Skip to main content

A Persistent Public Watermarking of Relational Databases

  • Conference paper
Information Systems Security (ICISS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6503))

Included in the following conference series:

Abstract

In this paper, we propose a novel fragile and robust persistent watermarking scheme for relational databases that embeds both private and public watermarks where the former allows the owner to prove his ownership, while the latter allows any end-user to verify the correctness and originality of the data in the database without loss of strength and security. The public watermarking is based on a part of the database state which remains invariant under processing of the queries associated with the database, whereas the private watermarking is based on an appropriate form of the original database state, called abstract database, and the semantics-based properties of the data which remain invariant under processing of the associated queries.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Agrawal, R., Haas, P.J., Kiernan, J.: Watermarking relational data: framework, algorithms and analysis. The VLDB Journal 12(2), 157–169 (2003)

    Article  Google Scholar 

  2. Bhattacharya, S., Cortesi, A.: A generic distortion free watermarking technique for relational databases. In: Prakash, A., Sen Gupta, I. (eds.) ICISS 2009. LNCS, vol. 5905, pp. 252–264. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Chen, L., Miné, A., Cousot, P.: A sound floating-point polyhedra abstract domain. In: Ramalingam, G. (ed.) APLAS 2008. LNCS, vol. 5356, pp. 3–18. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Guo, H., Li, Y., Liua, A., Jajodia, S.: A fragile watermarking scheme for detecting malicious modifications of database relations. Information Sciences 176, 1350–1378 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Halder, R., Cortesi, A.: Abstract interpretation for sound approximation of database query languages. In: Proceedings of the IEEE 7th International Conference on INFOrmatics and Systems (INFOS 2010), Advances in Data Engineering and Management Track, Cairo, Egypt, March 28-30, pp. 53–59. IEEE Catalog Number: IEEE CFP1006J-CDR (2010)

    Google Scholar 

  6. Halder, R., Cortesi, A.: Persistent watermarking of relational databases. In: Proceedings of the IEEE International Conference on Advances in Communication, Network, and Computing (CNC 2010), October 4-5. IEEE CS, Calicut (2010)

    Google Scholar 

  7. Halder, R., Dasgupta, P., Naskar, S., Sarma, S.S.: An internet-based ip protection scheme for circuit designs using linear feedback shift register (lfsr)-based locking. In: Proceedings of the 22nd ACM/IEEE Annual Symposium on Integrated Circuits and System Design (SBCCI 2009), August 31-September 3. ACM Press, Natal (2009)

    Google Scholar 

  8. Halder, R., Cortesi, A.: Observation-based fine grained access control for relational databases. In: Proceedings of the 5th International Conference on Software and Data Technologies (ICSOFT 2010), July 22-24, vol. 24, pp. 254–265. INSTICC, Athens (2010)

    Google Scholar 

  9. Li, Y., Deng, R.H.: Publicly verifiable ownership protection for relational databases. In: Proceedings of the ACM Symposium on Information, Computer and Communications Security (ASIACCS 2006), pp. 78–89. ACM, Taiwan (2006)

    Chapter  Google Scholar 

  10. Li, Y., Guo, H., Jajodia, S.: Tamper detection and localization for categorical data using fragile watermarks. In: Proceedings of the 4th ACM Workshop on Digital Rights Management (DRM 2004), pp. 73–82. ACM, Washington (2004)

    Chapter  Google Scholar 

  11. Lin, E., Delp, E.: A review of fragile image watermarks. In: Proceedings of the Multimedia and Security Workshop (ACM Multimedia 1999), Orlando, pp. 25–29 (1999)

    Google Scholar 

  12. Menezes, A.J., Vanstone, S.A., Oorschot, P.C.V.: Handbook of Applied Cryptography. CRC Press, Inc., Boca Raton (1996)

    Book  MATH  Google Scholar 

  13. Miné, A.: The octagon abstract domain. Higher Order Symbol. Comput. 19(1), 31–100 (2006)

    Article  MATH  Google Scholar 

  14. Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169–180. Academic Press, New York (1978)

    Google Scholar 

  15. Tsai, M.H., Tseng, H.Y., Lai, C.Y.: A database watermarking technique for temper detection. In: Proceedings of the 2006 Joint Conference on Information Sciences (JCIS 2006), October 8-11. Atlantis Press, Kaohsiung (2006)

    Google Scholar 

  16. Zhang, Y., Niu, X., Zhao, D., Li, J., Liu, S.: Relational databases watermark technique based on content characteristic. In: First International Conference on Innovative Computing, Information and Control (ICICIC 2006), October 16, pp. 677–680. IEEE CS, Beijing (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Halder, R., Cortesi, A. (2010). A Persistent Public Watermarking of Relational Databases. In: Jha, S., Mathuria, A. (eds) Information Systems Security. ICISS 2010. Lecture Notes in Computer Science, vol 6503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17714-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17714-9_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17713-2

  • Online ISBN: 978-3-642-17714-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics