Abstract
This paper presents an information hiding method that can be used for proving copyright ownership of a digital object. In contrast with other methods, the identity of the owner of the object is proved by the owner’s ability to demonstrate knowledge of a certain property of the signature. The method utilizes Zero Knowledge Interactive Proof (ZKIP) protocols for computationally intractable, or NP-complete, problems and in particular for the 3-coloring problem. This problem requires an assignment of a color out of three available colors to the vertices of a graph so that no two adjacent vertices have the same color. The method prescribes the construction of signatures that represent adjacency matrices of graphs while proof of ownership is effected by knowledge of a 3-coloring by an individual. The computational intractability of the 3-coloring problem implies that knowledge of a coloring of the graph/signature presents sufficient evidence of ownership of any digital file containing this signature. The method has the additional advantage that the disclosure of the signature is of no consequence, since it is essentially the knowledge of the property of the signature (the 3-coloring of the graph it represents) that enables one to use it as proof of ownership of the cover data. The paper focuses on the design of the method and presents experiments from its application on high quality color images. From the experiments it is derived that it is feasible to add the 3-colored graph into color images without affecting image quality (PSNR measurements and HVS examples are presented). More importantly, experiments prove the signature tolerance against various attacks even against attacks that significantly reduce image quality.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Achlioptas, C. Gomez, H. Kautz and B. Selman: “Generating Satisfiable Problem Instances”, Proceedings AAAI’2000 Conference, 2000. 267
M. Ajtai: “Generating Hard Instances of Lattice Problems”, Electronic Colloquium on Computational Complexity, ECCC Report TR96-007, 1996. 268
S. Armeni, D. Christodoulakis, I. Kostopoulos, Y. C. Stamatiou and M. Xenos: “Proving Copyright Ownership Using Hard Instances of Combinatorial Intractable Problems”, Proceedings 8th Panhellenic Conference in Informatics, pp.137–145, Nicosia, 2002. 265
W. Bender, D. Grul, N. Morimoto and A. Lu: “Techniques for Data Hiding”, IBM Systems Journal, Vol.35, No.3–4, 1996. 263
J. J. Chae, D. Mukherjee and B. S. Manjunath: “Color Image Embedding Using Multidimensional Lattice Structures”, Proceedings IEEE International Conference on Image Processing (ICIP’98), Vol.1, pp.460–464, Chicago, IL, October 1998. 271
P. Cheeseman, B. Kanefsky and W. M. Taylor: “Where the Really Hard Problems Are”, Proceedings IJCAI’91 Conference, Vol.1, pp.331–337, 1991. 266
S. Cook and D. Mitchel: “Finding Hard Instances of the Satisfiability Problem: a Survey”, Satisfiability Problem: Theory and Applications, DIMACS series in Discrete Mathematics and Theoretical Computer Science, Vol.25, pp.1–17, 1997.
R.M. Corless, G. H. Gonnet, D.E.G. Hare, D. J. Jeffrey and D.E. Knuth: “On the Lambert W function”, manuscript, Department of Computer Science, University of Waterloo. 268
S. Craver, N. Memon, B.-L. Yeo and M. Yeung: “Can Invisible Watermarks Resolve Rightful Ownerships?”, IBM Research Report, RC 20509, 1996.
S. Craver: “Zero Knowledge Watermark Detection”, Proceedings 3rd International Workshop on Information Hiding (IHW’99), 1999. 264
E.R. Dougherty: “Random Processes for Images and Signal Processing”, SPIE/IEEE Series on Imaging Science amp; Engineering, 1999.
A. Fabien, P. Peticolas, R. J. Anderson and M.G. Kuhn: “Information Hiding-a Survey, IEEE special issue on Protection of Multimedia Content, Vol.87, No.7, pp.1062–1078, July 1999. 263
M. R. Garey and D. S. Johnson: “Computers and Intractability-a Guide to the Theory of NP-Completeness”, W.H. Freeman, 1979. 263, 266
R. Gonzalez and R. Woods: “Digital Image Processing”, Addison Wesley, 1992.
B. Hayes: “Computing Science: Can’t Get no Satisfaction”, American Scientist, March-April, 1997.
K. Hirotsugu: “An Image Digital Signature System with ZKIP for the Graph Isomorphism”, Proceedings ICIP’96 Conference, 1996. 265
A. C. Kaporis, L. M. Kirousis and Y.C. Stamatiou: “A Note on the Noncolorability Threshold of a Random Graph”, Electronic Journal of Combinatorics, Vol.7, R29, 2000. 268
S. Katzenbeisser, A. Fabien and P. Petitcolas: “Information Hiding Techniques for Steganography and Digital Watermarking”, Artech House Books, 1999.
S. Kirkpatrick and B. Selman: “Critical Behavior in the Satisfiability of Random Boolean Expressions”, Science, Vol.264, pp.1297–1301, 1994.
C.-Y. Lin: “Watermarking and Digital Signature Techniques for Multimedia Authentication and Copyright Protection”, PhD Thesis, Columbia University, 2000. 270
S. Mallat: “A Wavelet Tour of Signal Processing, 2nd Edition, Academic Press, 1999. 264
F. Massacci and L. Marraro: “Logical Cryptanalysis as a SATp roblem: the Encoding of the Data Encryption Standard”, manuscript, 1999.
M. Motoki and R. Uehara: “Unique Solution Instance Generation for the 3-Satisfiability (3SAT) Problem”, Technical Report C-129, Department of Mathematics and Computer Sciences, Tokyo Institute of Technology, 1999. 267
C. H. Papadimitriou: “Computational Complexity”, Addison-Wesley, 1994. 263, 266, 269
R. Polikar: “The Wavelet Tutorial”. Available at: http:// www.polikar.iastate.edu/ rpolikar/WAVELETS/Wttutorial.html 271
K. Solanski, N. Jacobsen, S. Chandrasekaran, U. Madhow and B. S. Manjunath: “Introducing Perceptual Criteria into Quantization Based Embedding”, Proceedings ASSP’2002 Conference, 2002. 263
R. B. Wolfgang and E. J. Delp: “Overview of Image Security Techniques with Applications in Multimedia Systems”, Proceedings SPIE Conference on Multimedia Networks: Security, Displays, Terminals, and Gateways, Vol.3228, pp.297–308, Dallas TX, 1997.
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
Armeni, S.M., Christodoulakis, D.N., Kostopoulos, I., Kountrias, P.D., Stamatiou, Y.C., Xenos, M. (2003). An Information Hiding Method Based on Computational Intractable Problems. In: Manolopoulos, Y., Evripidou, S., Kakas, A.C. (eds) Advances in Informatics. PCI 2001. Lecture Notes in Computer Science, vol 2563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38076-0_18
Download citation
DOI: https://doi.org/10.1007/3-540-38076-0_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07544-8
Online ISBN: 978-3-540-38076-4
eBook Packages: Springer Book Archive