Geodesic
On steganographic system selection rule
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 39-41 
E. V. Razinkov; R. Kh. Latypov. On steganographic system selection rule. Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 39-41. http://geodesic.mathdoc.fr/item/PDM_2010_12_a18/
@article{PDM_2010_12_a18,
     author = {E. V. Razinkov and R. Kh. Latypov},
     title = {On steganographic system selection rule},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {39--41},
     year = {2010},
     number = {12},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2010_12_a18/}
}
TY  - JOUR
AU  - E. V. Razinkov
AU  - R. Kh. Latypov
TI  - On steganographic system selection rule
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2010
SP  - 39
EP  - 41
IS  - 12
UR  - http://geodesic.mathdoc.fr/item/PDM_2010_12_a18/
LA  - ru
ID  - PDM_2010_12_a18
ER  - 
%0 Journal Article
%A E. V. Razinkov
%A R. Kh. Latypov
%T On steganographic system selection rule
%J Prikladnaâ diskretnaâ matematika
%D 2010
%P 39-41
%N 12
%U http://geodesic.mathdoc.fr/item/PDM_2010_12_a18/
%G ru
%F PDM_2010_12_a18

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper we propose an approach to steganographic system optimization. Corresponding cover message model is explained. Our method is aimed at steganographic security and capacity maximization and can be adapted to different types of digital cover messages.

[1] Simmons G. J., “The Prisoners' Problem and the Subliminal Channel”, CRYPTO' 83 – Advances in Cryptology (August 22–24, 1984), 51–67 | MR

[2] Wayner P., Disappearing Cryptography, Information Hiding: Steganography and Watermarking, Second Edition, Elsevier, 2002, 413 pp.

[3] Cox I., Miller M., Bloom J., et al., Digital Watermarking and Steganography, Elsevier, 2008, 593 pp.

[4] Cachin C., “An Information-Theoretic Model for Steganography”, LNCS, 1525, 1998, 306–318