#### DMCA

## To cite this version: (2011)

### Citations

401 | On the limits of Steganography
- Anderson
(Show Context)
Citation Context ...anographic algorithm F5 [36]. For all these reasons, this approach is of interest. The process which states which components of the cover-data can actually be modified is called the selection channel =-=[1]-=-. Since the message embedding should introduce as little distortion as possible, the selection channel is of utmost importance. The selection channel may be arbitrary, but a more efficient approach is... |

318 |
Tilborg - On the Inherent Intractability of Certain Coding Problems
- Berlekamp, IEEE, et al.
- 1978
(Show Context)
Citation Context ...→ C ∪ {?}, such that for all y ∈ F n q , either fC(y) =?, or d(y, fC(y)) ≤ Tf . The Hamming distance between vectors x and y is then less than or equal to Tf . Since decoding general codes is NP-Hard =-=[2]-=-, finding such a mapping D is not tractable if C does not belong to a family of codes we can efficiently decode. Moreover, to be sure that the Problem 2 always has a solution, it is necessary and suff... |

275 |
The Prisoners’ Problem and the Subliminal Channel
- Simmons
- 1983
(Show Context)
Citation Context ...the pixels or the values of some transform (DCT or wavelet) coefficients. For a given transmitted document, only the sender and receiver have to be able to tell if it carries an hidden message or not =-=[33]-=-. This means that the stego-media, which carry the messages, have to be statistically indistinguishable from original media [6,7]. But statistical detectability of most steganographic schemes increase... |

267 | An information-theoretic model for steganography,” in Information Hiding
- Cachin
- 1998
(Show Context)
Citation Context ...receiver have to be able to tell if it carries an hidden message or not [33]. This means that the stego-media, which carry the messages, have to be statistically indistinguishable from original media =-=[6,7]-=-. But statistical detectability of most steganographic schemes increases with embedding distortion [24], which is often measured with the number of embedding changes. Hence it is of importance for the... |

103 |
The intractability of computing the minimum distance of a code
- Vardy
- 1997
(Show Context)
Citation Context ...esting for their asymptotic behavior, their use leads to solve really hard problems: syndrome decoding and covering radius computation, which are proved to be NP-complete and Π2-complete respectively =-=[34,25]-=-. Moreover, no efficient decoding algorithm is known, for generic, or random, codes. Hence, attention has been given on structured codes to design Wet Paper Codes: Hamming codes [9,21], Simplex codes ... |

87 | How to achieve a McEliece-based digital signature scheme
- Courtois, Finiasz, et al.
- 2001
(Show Context)
Citation Context ... the system. The traditional approach can then be applied to find y|Ī and consequently y. Using some random symbols in the syndrome was used in the signature scheme of Courtois, Finiasz and Sendrier =-=[8]-=-. While this reformulation allows to solve the bounded syndrome coding problem in the wet paper context without failure, we obviously lose some efficiency compared to the traditional approach. We now ... |

58 | Statistically undetectable jpeg steganography: dead end challenges, and opportunities. Paper presented at the 9th workshop on multimedia & security (MM&Sec
- Fridrich, Pevný, et al.
- 2007
(Show Context)
Citation Context ...media, which carry the messages, have to be statistically indistinguishable from original media [6,7]. But statistical detectability of most steganographic schemes increases with embedding distortion =-=[24]-=-, which is often measured with the number of embedding changes. Hence it is of importance for the sender to embed the message while modifying as less components of the cover-data as possible. In 1998,... |

42 |
Matrix embedding for large payloads
- Fridrich, Soukal
- 2006
(Show Context)
Citation Context .... Moreover, no efficient decoding algorithm is known, for generic, or random, codes. Hence, attention has been given on structured codes to design Wet Paper Codes: Hamming codes [9,21], Simplex codes =-=[20]-=-, BCH codes [31,32,37,30,27], ReedSolomon codes [14,15], perfect product codes [29,28], low density generator matrix codes [17,39,38,10], and convolutional codes [13,11,12]. Embedding techniques effic... |

42 |
F5—a steganographic algorithm
- Westfeld
- 2001
(Show Context)
Citation Context ...Moreover, it has been shown to be really helpful and efficient to minimize the embedding distortion [3,22,23,4]. It has also been made popular due to its use in the famous steganographic algorithm F5 =-=[36]-=-. For all these reasons, this approach is of interest. The process which states which components of the cover-data can actually be modified is called the selection channel [1]. Since the message embed... |

41 | Writing on wet paper
- Fridrich, Goljan, et al.
- 2005
(Show Context)
Citation Context ...the selection channel is only known to the sender, and not to the recipient. Wet Paper Codes were introduced to tackle this non-shared selection channel, through the notions of dry and wet components =-=[18]-=-. By analogy with a sheet of paper that has been exposed to rain, we can still write easily on dry spots whereas we cannot write on wet spots. The idea is, adaptively to the message and the cover-medi... |

36 | Minimizing additive distortion in steganography using syndrome-trellis codes
- Filler, Judas, et al.
- 2011
(Show Context)
Citation Context ...mming codes [9,21], Simplex codes [20], BCH codes [31,32,37,30,27], ReedSolomon codes [14,15], perfect product codes [29,28], low density generator matrix codes [17,39,38,10], and convolutional codes =-=[13,11,12]-=-. Embedding techniques efficiency is usually evaluated through their relative payload (number of message symbols per cover-data (modifiable) symbol) and average embedding efficiency (average number of... |

34 | Wet paper codes with improved embedding efficiency
- Fridrich, Soukal
- 2006
(Show Context)
Citation Context .... Of course, solving Problem 3 is harder and even perfect codes may fail here. More precisely, to deal with locked components, we usually decompose the parity check matrix H of C in the following way =-=[18,19]-=-: yHt =m, y|ĪH t |Ī + y|IH t |I =m, y|ĪH t |Ī =m− y|IH t |I , where Ī = {1, . . . , n} \ I. The previous equation can only be solved if rank(HĪ) = n− k. Since the potential structure of H does n... |

29 |
Algebraic - Geometric Codes
- Tsfasman, Vlǎduţ
- 1991
(Show Context)
Citation Context ...h g = 0, and we can always embed n − ℓ symbols when there are ℓ wet symbols. Coding theory bounds tells us that the higher q, the smallest g can be achieved, eventually using Algebraic-Geometry codes =-=[35]-=-. 3 Randomized (wet paper) syndrome coding Since embedding a message has a non-zero probability to fail, we propose to relax the constraints in the following way: Problem 5 (Randomized bounded syndrom... |

25 | Minimizing Embedding Impact in Steganography using Trellis-Coded Quantization
- Filler, Judas, et al.
- 2010
(Show Context)
Citation Context ...mming codes [9,21], Simplex codes [20], BCH codes [31,32,37,30,27], ReedSolomon codes [14,15], perfect product codes [29,28], low density generator matrix codes [17,39,38,10], and convolutional codes =-=[13,11,12]-=-. Embedding techniques efficiency is usually evaluated through their relative payload (number of message symbols per cover-data (modifiable) symbol) and average embedding efficiency (average number of... |

23 | Practical methods for minimizing embedding impact in steganography
- Fridrich, Filler
(Show Context)
Citation Context ...red codes to design Wet Paper Codes: Hamming codes [9,21], Simplex codes [20], BCH codes [31,32,37,30,27], ReedSolomon codes [14,15], perfect product codes [29,28], low density generator matrix codes =-=[17,39,38,10]-=-, and convolutional codes [13,11,12]. Embedding techniques efficiency is usually evaluated through their relative payload (number of message symbols per cover-data (modifiable) symbol) and average emb... |

22 |
Less detectable JPEG steganography method based on heuristic optimization and BCH syndrome coding
- Sachnev, Kim, et al.
- 2009
(Show Context)
Citation Context ...fficient decoding algorithm is known, for generic, or random, codes. Hence, attention has been given on structured codes to design Wet Paper Codes: Hamming codes [9,21], Simplex codes [20], BCH codes =-=[31,32,37,30,27]-=-, ReedSolomon codes [14,15], perfect product codes [29,28], low density generator matrix codes [17,39,38,10], and convolutional codes [13,11,12]. Embedding techniques efficiency is usually evaluated t... |

21 | Information hiding by coverings
- Galand, Kabatiansky
(Show Context)
Citation Context ...ht coset of the code, its syndrome being precisely equal to the message to hide. Later on, it has been showed that designing steganographic schemes is precisely equivalent to designing covering codes =-=[3,22,23]-=-, meaning that this covering codes approach is not restrictive. Moreover, it has been shown to be really helpful and efficient to minimize the embedding distortion [3,22,23,4]. It has also been made p... |

19 | A.G.B.: Random Krylov spaces over finite fields
- Brent, Gao, et al.
- 2001
(Show Context)
Citation Context ...me coding problem consists in finding y ∈ Fnq such that yHt =m, and xi = yi, for all i ∈ I. In a random case setting, this problem can be discussed using a lower bound on random matrices, provided by =-=[5]-=-. Theorem 1. Let M be a random ncol × nrow matrix defined over Fq, such that ncol ≥ nrow. We have: P (rank(M) = nrow) ≥ { 0.288, if ncol = nrow and q = 2, 1− 1 qncol−nrow(q−1) , otherwise. In a worst-... |

19 |
The complexity of computing the covering radius of a code
- McLoughlin
- 1984
(Show Context)
Citation Context ...esting for their asymptotic behavior, their use leads to solve really hard problems: syndrome decoding and covering radius computation, which are proved to be NP-complete and Π2-complete respectively =-=[34,25]-=-. Moreover, no efficient decoding algorithm is known, for generic, or random, codes. Hence, attention has been given on structured codes to design Wet Paper Codes: Hamming codes [9,21], Simplex codes ... |

18 | Constructing good covering codes for applications in steganography, in Transactions on data hiding and multimedia security III, Springer-Verlag
- Bierbrauer, Fridich
- 2008
(Show Context)
Citation Context ...o designing covering codes [3,22,23], meaning that this covering codes approach is not restrictive. Moreover, it has been shown to be really helpful and efficient to minimize the embedding distortion =-=[3,22,23,4]-=-. It has also been made popular due to its use in the famous steganographic algorithm F5 [36]. For all these reasons, this approach is of interest. The process which states which components of the cov... |

17 |
Efficient wet paper codes
- Fridrich, Goljan, et al.
(Show Context)
Citation Context ...e respectively [34,25]. Moreover, no efficient decoding algorithm is known, for generic, or random, codes. Hence, attention has been given on structured codes to design Wet Paper Codes: Hamming codes =-=[9,21]-=-, Simplex codes [20], BCH codes [31,32,37,30,27], ReedSolomon codes [14,15], perfect product codes [29,28], low density generator matrix codes [17,39,38,10], and convolutional codes [13,11,12]. Embedd... |

16 |
How reed-solomon codes can improve steganographic schemes
- Fontaine, Galand
(Show Context)
Citation Context ..., for generic, or random, codes. Hence, attention has been given on structured codes to design Wet Paper Codes: Hamming codes [9,21], Simplex codes [20], BCH codes [31,32,37,30,27], ReedSolomon codes =-=[14,15]-=-, perfect product codes [29,28], low density generator matrix codes [17,39,38,10], and convolutional codes [13,11,12]. Embedding techniques efficiency is usually evaluated through their relative paylo... |

13 |
Some Notes on Steganography
- Crandall
- 1998
(Show Context)
Citation Context ...er-data as possible. In 1998, Crandall proposed to model the embedding and extraction process with the use of linear error correcting codes. He proposed to use Hamming codes, which are covering codes =-=[9]-=-. The key idea of this approach, called syndrome coding, or matrix embedding, is to modify the cover-data to obtain a stego-data lying in the right coset of the code, its syndrome being precisely equa... |

12 |
A Embedding with syndrome coding based on BCH codes
- Schönfeld, Winkler
- 2006
(Show Context)
Citation Context ...fficient decoding algorithm is known, for generic, or random, codes. Hence, attention has been given on structured codes to design Wet Paper Codes: Hamming codes [9,21], Simplex codes [20], BCH codes =-=[31,32,37,30,27]-=-, ReedSolomon codes [14,15], perfect product codes [29,28], low density generator matrix codes [17,39,38,10], and convolutional codes [13,11,12]. Embedding techniques efficiency is usually evaluated t... |

10 | Asymptotic behavior of the ZZW embedding construction
- Fridrich
- 2009
(Show Context)
Citation Context ...age embedding efficiency (average number of message symbols per cover-data modification). Today, we can find in the literature quasi-optimal codes in terms of average embedding efficiency and payload =-=[17,39,38,16,10]-=-. Nevertheless, we are interested here in another criterion, which is usually not discussed: the probability for the embedding to fail. In fact, the only case for which it never fails is when using pe... |

9 |
Maximizing steganographic embedding efficiency by combining Hamming codes and wet paper codes
- Zhang, Zhang, et al.
- 2008
(Show Context)
Citation Context ...red codes to design Wet Paper Codes: Hamming codes [9,21], Simplex codes [20], BCH codes [31,32,37,30,27], ReedSolomon codes [14,15], perfect product codes [29,28], low density generator matrix codes =-=[17,39,38,10]-=-, and convolutional codes [13,11,12]. Embedding techniques efficiency is usually evaluated through their relative payload (number of message symbols per cover-data (modifiable) symbol) and average emb... |

8 | On Crandall’s problem
- Bierbrauer
- 2001
(Show Context)
Citation Context ...ht coset of the code, its syndrome being precisely equal to the message to hide. Later on, it has been showed that designing steganographic schemes is precisely equivalent to designing covering codes =-=[3,22,23]-=-, meaning that this covering codes approach is not restrictive. Moreover, it has been shown to be really helpful and efficient to minimize the embedding distortion [3,22,23,4]. It has also been made p... |

7 |
Reducing the complexity of syndrome coding for embedding
- Schönfeld, Winkler
- 2007
(Show Context)
Citation Context ...fficient decoding algorithm is known, for generic, or random, codes. Hence, attention has been given on structured codes to design Wet Paper Codes: Hamming codes [9,21], Simplex codes [20], BCH codes =-=[31,32,37,30,27]-=-, ReedSolomon codes [14,15], perfect product codes [29,28], low density generator matrix codes [17,39,38,10], and convolutional codes [13,11,12]. Embedding techniques efficiency is usually evaluated t... |

7 |
Fast BCH syndrome coding for steganography
- Zhang, Sachnev, et al.
(Show Context)
Citation Context |

5 | Wet ZZW construction for steganography
- Filler, Fridrich
- 2009
(Show Context)
Citation Context ...red codes to design Wet Paper Codes: Hamming codes [9,21], Simplex codes [20], BCH codes [31,32,37,30,27], ReedSolomon codes [14,15], perfect product codes [29,28], low density generator matrix codes =-=[17,39,38,10]-=-, and convolutional codes [13,11,12]. Embedding techniques efficiency is usually evaluated through their relative payload (number of message symbols per cover-data (modifiable) symbol) and average emb... |

5 | Minimizing additive distortion functions with non-binary embedding operation in steganography
- Filler, Fridrich
- 2010
(Show Context)
Citation Context ...mming codes [9,21], Simplex codes [20], BCH codes [31,32,37,30,27], ReedSolomon codes [14,15], perfect product codes [29,28], low density generator matrix codes [17,39,38,10], and convolutional codes =-=[13,11,12]-=-. Embedding techniques efficiency is usually evaluated through their relative payload (number of message symbols per cover-data (modifiable) symbol) and average embedding efficiency (average number of... |

5 |
Product perfect codes and steganography
- Rifà-Pous, Rifà
- 2009
(Show Context)
Citation Context .... Hence, attention has been given on structured codes to design Wet Paper Codes: Hamming codes [9,21], Simplex codes [20], BCH codes [31,32,37,30,27], ReedSolomon codes [14,15], perfect product codes =-=[29,28]-=-, low density generator matrix codes [17,39,38,10], and convolutional codes [13,11,12]. Embedding techniques efficiency is usually evaluated through their relative payload (number of message symbols p... |

3 |
G.: Coverings, centered codes, and combinatorial steganography
- Galand, Kabatiansky
- 2009
(Show Context)
Citation Context ...ht coset of the code, its syndrome being precisely equal to the message to hide. Later on, it has been showed that designing steganographic schemes is precisely equivalent to designing covering codes =-=[3,22,23]-=-, meaning that this covering codes approach is not restrictive. Moreover, it has been shown to be really helpful and efficient to minimize the embedding distortion [3,22,23,4]. It has also been made p... |

3 | M.: Wet paper codes and the dual distance in steganography - Munuera, Barbier |

3 |
A steganography schema and error-correcting codes
- Medeni, Souidi, et al.
- 2010
(Show Context)
Citation Context |

3 | L.: Product perfect Z2Z4-linear codes in steganography
- Rifà, Ronquillo
- 2010
(Show Context)
Citation Context .... Hence, attention has been given on structured codes to design Wet Paper Codes: Hamming codes [9,21], Simplex codes [20], BCH codes [31,32,37,30,27], ReedSolomon codes [14,15], perfect product codes =-=[29,28]-=-, low density generator matrix codes [17,39,38,10], and convolutional codes [13,11,12]. Embedding techniques efficiency is usually evaluated through their relative payload (number of message symbols p... |

2 |
S.: Near-optimal codes for information embedding in gray-scale signals
- Zhang, Zhang, et al.
- 2010
(Show Context)
Citation Context |