Hiding Functions and Computational Security of Image Watermarking Systems

Authors:
Nicholas Tran
Affiliations:
-
Venue:
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Year:
2002

Citing 11
Cited 3

The cortex transform: rapid computation of simulated neural images

Computer Vision, Graphics, and Image Processing
A survey of two-dimensional automata theory

Information Sciences: an International Journal
Techniques for data hiding

IBM Systems Journal
Picture Languages: Formal Models for Picture Recognition

Picture Languages: Formal Models for Picture Recognition
Information Hiding Techniques for Steganography and Digital Watermarking

Information Hiding Techniques for Steganography and Digital Watermarking
A Secure, Robust Watermark for Multimedia

Proceedings of the First International Workshop on Information Hiding
An Information-Theoretic Approach to Steganography and Watermarking

IH '99 Proceedings of the Third International Workshop on Information Hiding
Evaluation of Copyright Marking Systems

ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Automata on a 2-dimensional tape

FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Resolving rightful ownerships with invisible watermarking techniques: limitations, attacks, and implications

IEEE Journal on Selected Areas in Communications
Electronic marking and identification techniques to discourage document copying

IEEE Journal on Selected Areas in Communications

Asymptotic Analyses of Visual Distortions: A New Approach to Defining Transparency

PCM '02 Proceedings of the Third IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Constructing a virtual primary key for fingerprinting relational data

Proceedings of the 3rd ACM workshop on Digital rights management
A computational model for watermark robustness

IH'06 Proceedings of the 8th international conference on Information hiding

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a complexity-theoretic model for studying computational security of binary image watermarking systems. Our model restricts algorithms used by the sender and the attacker to the class H of hiding functions. These are efficiently computable functions that preserve visual fidelity of the input image. Security of watermarking systems is to be established with complexity results about hiding functions. We also survey current theories of vision and propose an automata-theoretic model for visual fidelity called c-similarity. Finally we propose a candidate for H based on c-similarity and show that it is robust and contains infinitely many functions computable in polynomial time.