The ultimate steganalysis benchmark?
Proceedings of the 9th workshop on Multimedia & security
The square root law of steganographic capacity
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
How Reed-Solomon codes can improve steganographic schemes
EURASIP Journal on Information Security - Special issue on secure steganography in multimedia content
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
Generalization of the ZZW embedding construction for steganography
IEEE Transactions on Information Forensics and Security
Constructing specific matrix for efficient matrix embedding
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Improving embedding efficiency by incorporating SDCS and WPC
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
How can reed-Solomon codes improve steganographic schemes?
IH'07 Proceedings of the 9th international conference on Information hiding
Hybrid wet paper coding mechanism for steganography employing n-indicator and fuzzy edge detector
Digital Signal Processing
Improving embedding efficiency via matrix embedding: a case study
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
IEEE Transactions on Information Forensics and Security
Near-optimal codes for information embedding in gray-scale signals
IEEE Transactions on Information Theory
Generalization and analysis of the paper folding method for steganography
IEEE Transactions on Information Forensics and Security
An efficient prediction-and-shifting embedding technique for high quality reversible data hiding
EURASIP Journal on Advances in Signal Processing - Special issue on advanced image processing for defense and security applications
Minority codes with improved embedding efficiency for large payloads
Multimedia Tools and Applications
An efficient high payload ±1 data embedding scheme
Multimedia Tools and Applications
A progressive quality hiding strategy based on equivalence partitions of hiding units
Transactions on data hiding and multimedia security VI
A compact covering method to exploit embedding capacity for matrix encoding
Information Sciences: an International Journal
Ensuring message embedding in wet paper steganography
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
A hybrid embedded steganography technique: optimum pixel method and matrix embedding
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Distortion function designing for JPEG steganography with uncompressed side-image
Proceedings of the first ACM workshop on Information hiding and multimedia security
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
Interpolation of steganographic schemes
Signal Processing
Efficient reversible data hiding in encrypted images
Journal of Visual Communication and Image Representation
| Hi-index | 0.06 |
Matrix embedding is a previously introduced coding method that is used in steganography to improve the embedding efficiency (increase the number of bits embedded per embedding change). Higher embedding efficiency translates into better steganographic security. This gain is more important for long messages than for shorter ones because longer messages are, in general, easier to detect. In this paper, we present two new approaches to matrix embedding for large payloads suitable for practical steganographic schemes-one based on a family of codes constructed from simplex codes and the second one based on random linear codes of small dimension. The embedding efficiency of the proposed methods is evaluated with respect to theoretically achievable bounds