Principles and practice of information theory
Principles and practice of information theory
Text compression
Elements of information theory
Elements of information theory
Digital watermarking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Information Hiding Terminology - Results of an Informal Plenary Meeting and Additional Proposals
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
The method of types [information theory]
IEEE Transactions on Information Theory
Authentication theory and hypothesis testing
IEEE Transactions on Information Theory
The ultimate steganalysis benchmark?
Proceedings of the 9th workshop on Multimedia & security
Detecting covert timing channels: an entropy-based approach
Proceedings of the 14th ACM conference on Computer and communications security
Natural language watermarking via morphosyntactic alterations
Computer Speech and Language
Secure covert channels in multiplayer games
Proceedings of the 10th ACM workshop on Multimedia and security
A novel steganographic algorithm using animations as cover
Decision Support Systems
Perturbation Hiding and the Batch Steganography Problem
Information Hiding
Practical Insecurity for Effective Steganalysis
Information Hiding
The square root law requires a linear key
Proceedings of the 11th ACM workshop on Multimedia and security
A new data hiding scheme for binary image authentication with small image distortion
Information Sciences: an International Journal
Estimating the Information Theoretic Optimal Stego Noise
IWDW '09 Proceedings of the 8th International Workshop on Digital Watermarking
Capacity of steganographic channels
IEEE Transactions on Information Theory
MRF Based LSB Steganalysis: A New Measure of Steganography Capacity
PReMI '09 Proceedings of the 3rd International Conference on Pattern Recognition and Machine Intelligence
Transactions on data hiding and multimedia security III
Problems of modeling in the analysis of covert channels
MMM-ACNS'10 Proceedings of the 5th international conference on Mathematical methods, models and architectures for computer network security
The square root law in stegosystems with imperfect information
IH'10 Proceedings of the 12th international conference on Information hiding
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Public-key steganography with active attacks
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
KL-sense secure image steganography
International Journal of Security and Networks
Efficient steganography with provable security guarantees
IH'05 Proceedings of the 7th international conference on Information Hiding
Watermarking security: a survey
Transactions on Data Hiding and Multimedia Security I
Ensuring message embedding in wet paper steganography
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Steganalysis of adaptive image steganography in multiple gray code bit-planes
Multimedia Tools and Applications
Proceedings of the Fifth International Conference on Security of Information and Networks
Improving the embedding efficiency of weight matrix-based steganography for grayscale images
Computers and Electrical Engineering
A study of optimal matrix for efficient matrix embedding in F3
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
Theoretical Computer Science
| Hi-index | 0.06 |
An information-theoretic model for steganography with a passive adversary is proposed. The adversary's task of distinguishing between an innocent cover message C and a modified message S containing hidden information is interpreted as a hypothesis testing problem. The security of a steganographic system is quantified in terms of the relative entropy (or discrimination) between the distributions of C and S, which yields bounds on the detection capability of any adversary. It is shown that secure steganographic schemes exist in this model provided the covertext distribution satisfies certain conditions. A universal stegosystem is presented in this model that needs no knowledge of the covertext distribution, except that it is generated from independently repeated experiments.