Random Krylov Spaces over Finite Fields
SIAM Journal on Discrete Mathematics
How to Achieve a McEliece-Based Digital Signature Scheme
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
An information-theoretic model for steganography
Information and Computation
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Statistically undetectable jpeg steganography: dead ends challenges, and opportunities
Proceedings of the 9th workshop on Multimedia & security
Product perfect codes and steganography
Digital Signal Processing
Algebraic Geometric Codes: Basic Notions
Algebraic Geometric Codes: Basic Notions
How Reed-Solomon codes can improve steganographic schemes
EURASIP Journal on Information Security - Special issue on secure steganography in multimedia content
Less detectable JPEG steganography method based on heuristic optimization and BCH syndrome coding
Proceedings of the 11th ACM workshop on Multimedia and security
Fast BCH Syndrome Coding for Steganography
Information Hiding
Coverings, centered codes, and combinatorial steganography
Problems of Information Transmission
Asymptotic behavior of the ZZW embedding construction
IEEE Transactions on Information Forensics and Security
How can reed-Solomon codes improve steganographic schemes?
IH'07 Proceedings of the 9th international conference on Information hiding
Reducing the complexity of syndrome coding for embedding
IH'07 Proceedings of the 9th international conference on Information hiding
Constructing good covering codes for applications in steganography
Transactions on data hiding and multimedia security III
Near-optimal codes for information embedding in gray-scale signals
IEEE Transactions on Information Theory
IH'05 Proceedings of the 7th international conference on Information Hiding
IEEE Transactions on Signal Processing - Part II
Wet paper codes with improved embedding efficiency
IEEE Transactions on Information Forensics and Security
Matrix embedding for large payloads
IEEE Transactions on Information Forensics and Security
The intractability of computing the minimum distance of a code
IEEE Transactions on Information Theory
On the limits of steganography
IEEE Journal on Selected Areas in Communications
Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes
IEEE Transactions on Information Forensics and Security - Part 2
| Hi-index | 0.00 |
Syndrome coding has been proposed by Crandall in 1998 as a method to stealthily embed a message in a cover-medium through the use of bounded decoding. In 2005, Fridrich et al. introduced wet paper codes to improve the undetectability of the embedding by enabling the sender to lock some components of the cover-data, according to the nature of the cover-medium and the message. Unfortunately, almost all existing methods solving the bounded decoding syndrome problem with or without locked components have a non-zero probability to fail. In this paper, we introduce a randomized syndrome coding, which guarantees the embedding success with probability one. We analyze the parameters of this new scheme in the case of perfect codes.