Abstract
Watermarking is a frequently used tool for digital rights management. An example of this is using watermarks to place ownership information into an object. There are many instances where placing multiple watermarks into the same object is desired. One mechanism that has been proposed for doing this is segmenting the data into a grid and placing watermarks into different regions of the grid. This is particularly suited for images and geographic information systems (GIS) databases as they already consist of a fine granularity grid (of pixels, geographic regions, etc.); a grid cell for watermarking is an aggregation of the original fine granularity cells. An attacker may be interested in only a subset of the watermarked data, and it is crucial that the watermarks survive in the subset selected by the attacker. In the kind of data mentioned above (images, GIS, etc.) such an attack typically consists of cropping, e.g. selecting a geographic region between two latitudes and longitudes (in the GIS case) or a rectangular region of pixels (in an image). The contribution of this paper is a set of schemes and their analysis for multiple watermark placement that maximizes resilience to the above mentioned cropping attack. This involves the definition of various performance metrics and their use in evaluating and comparing various placement schemes.
Portions of this work were supported by Grants EIA-9903545 and ISS-0219560 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, by Purdue Discovery Park’s e-enterprise Center, and by the GAANN fellowship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdel-Ghaffar, K.A.S., El Abbadi, A.: Optimal allocation of two-dimension data. In: Int. Conf. on Database Theory, Delphi, Greece, pp. 409–418 (January 1997)
Atallah, M.J., Prabhakar, S.: (Almost) optimal parallel block access for range queries. In: Proc. of the 19th ACM Symposium on Principles of Database Systems (PODS), Dallas, Texas (May 2000)
Bhatia, R., Sinha, R.K., Chen, C.-M.: Declustering using golden ratio sequences. In: Proc. of Int’l. Conference On Data Engineering (ICDE), San Diego, California (March 2000)
Brisbane, G., Safavi-Naini, R., Ogunbona, P.: Region-based Watermarking for Images. In: Zheng, Y., Mambo, M. (eds.) ISW 1999. LNCS, vol. 1729, pp. 154–166. Springer, Heidelberg (1999)
Chen, C., Cheng, C.: From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries. In: ACM Symposium On Principles of Database Systems (PODS), pp. 29–38 (2002)
Du, H.C., Sobolewski, J.S.: Disk allocation for cartesian product files on multiple-disk Systems. ACM Trans. of Database Systems 7(1), 82–101 (1982)
Faloutsos, C., Bhagwat, P.: Declustering using fractals. In: Proc. of the 2nd Int. Conf. On Parallel und Distributed Information Systems, San Diego, CA, pp. 18–25 (January 1993)
Frikken, K., Atallah, M., Prabhakar, S., Safavi-Naini, R.: Optimal Parallel 1/0 for Range Queries through Replication. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds.) DEXA 2002. LNCS, vol. 2453, pp. 669–678. Springer, Heidelberg (2002)
Gray, J., Horst, B., Walker, M.: Parity striping of disc arrays: Low-cost reliable Storage with acceptable throughput. In: Proceedings of the Int. Conf. On Very Large Data Bases, Washington DC, pp. 148–161 (August 1990)
Itai, A., Rosberg, Z.: A golden ratio control policy for a multiple-access channel. IEEE Transactions On Automatic Control AC-29, 712–718 (1984)
Kim, M.H., Pramanik, S.: Optimal file distribution for partial match retrieval. In: Proc. ACM SIGMOD Int. Conf. On Management of Data, Chicago, pp. 173–182 (1988)
Li, J., Srivastava, J., Rotem, D.: CMD: a multidimensional declustering method for parallel database Systems. In: Proceedings of the Int. Conf. On Very Large Data Bases, Vancouver, Canada, pp. 3–14 (August 1992)
Mintzer, F., Braudaway, G.: If one watermark is good, are more better? In: Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, Phoenix, Arizona, vol. 4 (May 1999)
Mintzer, F., Braudaway, G., Yeung, M.: Effective and Ineffective Digital Watermarks. In: IEEE ICIP, Santa-Barbara, Cal, vol. 111, pp. 9–12 (October 1997)
Prabhakar, S., Abdel-Ghaffar, K., Agrawal, D., El Abbadi, A.: Cyclic allocation of two-dimensional data. In: Proc. of the International Conference On Data Engineering (ICDE 1998), Orlando, Florida, pp. 94–101 (February 1998)
Sinha, R.K., Bhatia, R., Chen, C.-M.: Asymptotically optimal declustering schemes for range queries. In: Proc. of 8th International Conference On Database Theory (ICDT), London, UK, pp. 144–158 (January 2001)
Sanders, P., Egner, S., Korst, J.: Fast concurrent access to parallel disks. In: 11th ACM-SIAM Symposium On Discrete Algorithms (2000)
Sheppard, N., Safavi-Naini, R., Ogunbona, P.: On multiple watermarking. In: ACM Multimedia Conference, ACM Multimedia, pp. 3–6 (2001)
Tosun, A., Ferhatosmanoglu, H.: Optimal Parallel 1/0 Using Replication. OSU Technical Report OSU-CISRC-ll/Ol-TR26 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frikken, K., Atallah, M. (2003). Cropping-Resilient Segmented Multiple Watermarking. In: Dehne, F., Sack, JR., Smid, M. (eds) Algorithms and Data Structures. WADS 2003. Lecture Notes in Computer Science, vol 2748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45078-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-45078-8_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40545-0
Online ISBN: 978-3-540-45078-8
eBook Packages: Springer Book Archive