Geodesic
Steganographic capacity for one-dimensional Markov cover} \runningtitle{Steganographic capacity for one-dimensional Markov cover} \author*[1]{Valeriy A. Voloshko} \runningauthor{V.\,A. Voloshko} \affil[1]{ Belarusian State University, e-mail: valeravoloshko@yandex.ru} \abstract{For shift-invariant probability measures on the set of infinite two-sided binary sequences (one-dimensional covers) we introduce the notion of capacity as a maximum portion of embedded into the cover uniformly distributed (purely random) binary sequence (message) that admits special correction of the cover restoring its distribution up to distribution of $n$-tuples (subwords of some fixed length $n$). ``Special correction'' is carried out using the proposed new algorithm that changes some of the cover's symbols not occupied by embedded message. The features of the introduced capacity are examined for the Markov cover. In particular, we show how capacity may be significantly increased by weakening of the standard constraint that positions for message embedding have to be chosen by independent unfair coin tosses. Experimental results are presented for correction of real steganographic covers after LSB-embedding.} \keywords{binary sequence, shift-invariant measure, steganography, capacity
Diskretnaya Matematika, Tome 28 (2016) no. 1, pp. 19-43.

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

For shift-invariant probability measures on the set of infinite two-sided binary sequences (one-dimensional covers) we introduce the notion of capacity as a maximum portion of embedded into the cover uniformly distributed (purely random) binary sequence (message) that admits special correction of the cover restoring its distribution up to distribution of $n$-tuples (subwords of some fixed length $n$). “Special correction” is carried out using the proposed new algorithm that changes some of the cover's symbols not occupied by embedded message. The features of the introduced capacity are examined for the Markov cover. In particular, we show how capacity may be significantly increased by weakening of the standard constraint that positions for message embedding have to be chosen by independent unfair coin tosses. Experimental results are presented for correction of real steganographic covers after LSB-embedding.} \keywords{binary sequence, shift-invariant measure, steganography, capacity
Keywords: binary sequence, shift-invariant measure, steganography, capacity. 
@article{DM_2016_28_1_a1,
     author = {V. A. Voloshko},
     title = {Steganographic capacity for one-dimensional {Markov} cover} {\runningtitle{Steganographic} capacity for one-dimensional {Markov} cover} {\author*[1]{Valeriy} {A.} {Voloshko}} {\runningauthor{V.\,A.} {Voloshko}} \affil[1]{ {Belarusian} {State} {University,} e-mail: valeravoloshko@yandex.ru} {\abstract{For} shift-invariant probability measures on the set of infinite two-sided binary sequences (one-dimensional covers) we introduce the notion of capacity as a maximum portion of embedded into the cover uniformly distributed (purely random) binary sequence (message) that admits special correction of the cover restoring its distribution up to distribution of $n$-tuples (subwords of some fixed length $n$). {``Special} correction'' is carried out using the proposed new algorithm that changes some of the cover's symbols not occupied by embedded message. {The} features of the introduced capacity are examined for the {Markov} cover. {In} particular, we show how capacity may be significantly increased by weakening of the standard constraint that positions for message embedding have to be chosen by independent unfair coin tosses. {Experimental} results are presented for correction of real steganographic covers after {LSB-embedding.}} \keywords{binary sequence, shift-invariant measure, steganography, capacity},
     journal = {Diskretnaya Matematika},
     pages = {19--43},
     publisher = {mathdoc},
     volume = {28},
     number = {1},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2016_28_1_a1/}
}
TY  - JOUR
AU  - V. A. Voloshko
TI  - Steganographic capacity for one-dimensional Markov cover} \runningtitle{Steganographic capacity for one-dimensional Markov cover} \author*[1]{Valeriy A. Voloshko} \runningauthor{V.\,A. Voloshko} \affil[1]{ Belarusian State University, e-mail: valeravoloshko@yandex.ru} \abstract{For shift-invariant probability measures on the set of infinite two-sided binary sequences (one-dimensional covers) we introduce the notion of capacity as a maximum portion of embedded into the cover uniformly distributed (purely random) binary sequence (message) that admits special correction of the cover restoring its distribution up to distribution of $n$-tuples (subwords of some fixed length $n$). ``Special correction'' is carried out using the proposed new algorithm that changes some of the cover's symbols not occupied by embedded message. The features of the introduced capacity are examined for the Markov cover. In particular, we show how capacity may be significantly increased by weakening of the standard constraint that positions for message embedding have to be chosen by independent unfair coin tosses. Experimental results are presented for correction of real steganographic covers after LSB-embedding.} \keywords{binary sequence, shift-invariant measure, steganography, capacity
JO  - Diskretnaya Matematika
PY  - 2016
SP  - 19
EP  - 43
VL  - 28
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2016_28_1_a1/
LA  - ru
ID  - DM_2016_28_1_a1
ER  - 
%0 Journal Article
%A V. A. Voloshko
%T Steganographic capacity for one-dimensional Markov cover} \runningtitle{Steganographic capacity for one-dimensional Markov cover} \author*[1]{Valeriy A. Voloshko} \runningauthor{V.\,A. Voloshko} \affil[1]{ Belarusian State University, e-mail: valeravoloshko@yandex.ru} \abstract{For shift-invariant probability measures on the set of infinite two-sided binary sequences (one-dimensional covers) we introduce the notion of capacity as a maximum portion of embedded into the cover uniformly distributed (purely random) binary sequence (message) that admits special correction of the cover restoring its distribution up to distribution of $n$-tuples (subwords of some fixed length $n$). ``Special correction'' is carried out using the proposed new algorithm that changes some of the cover's symbols not occupied by embedded message. The features of the introduced capacity are examined for the Markov cover. In particular, we show how capacity may be significantly increased by weakening of the standard constraint that positions for message embedding have to be chosen by independent unfair coin tosses. Experimental results are presented for correction of real steganographic covers after LSB-embedding.} \keywords{binary sequence, shift-invariant measure, steganography, capacity
%J Diskretnaya Matematika
%D 2016
%P 19-43
%V 28
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2016_28_1_a1/
%G ru
%F DM_2016_28_1_a1
V. A. Voloshko. Steganographic capacity for one-dimensional Markov cover} \runningtitle{Steganographic capacity for one-dimensional Markov cover} \author*[1]{Valeriy A. Voloshko} \runningauthor{V.\,A. Voloshko} \affil[1]{ Belarusian State University, e-mail: valeravoloshko@yandex.ru} \abstract{For shift-invariant probability measures on the set of infinite two-sided binary sequences (one-dimensional covers) we introduce the notion of capacity as a maximum portion of embedded into the cover uniformly distributed (purely random) binary sequence (message) that admits special correction of the cover restoring its distribution up to distribution of $n$-tuples (subwords of some fixed length $n$). ``Special correction'' is carried out using the proposed new algorithm that changes some of the cover's symbols not occupied by embedded message. The features of the introduced capacity are examined for the Markov cover. In particular, we show how capacity may be significantly increased by weakening of the standard constraint that positions for message embedding have to be chosen by independent unfair coin tosses. Experimental results are presented for correction of real steganographic covers after LSB-embedding.} \keywords{binary sequence, shift-invariant measure, steganography, capacity. Diskretnaya Matematika, Tome 28 (2016) no. 1, pp. 19-43. http://geodesic.mathdoc.fr/item/DM_2016_28_1_a1/

[1] Wang Y., Moulin P., “Perfectly secure steganography: capacity, error exponents, and code constructions”, IEEE Trans. Inf. Forensics and Sec., 54:6 (2008), 2706–2722 | DOI | MR | Zbl

[2] Harmsen J. J., Pearlman W. A., “Capacity of steganographic channels”, IEEE Trans. Inf. Theory, 55 (2009), 1775–1792 | DOI | MR

[3] Filler T., Ker A. D., Fridrich J., “The Square root law of steganographic capacity for Markov covers”, Media Forensics and Security XI, Proc. SPIE, 7254, San Jose, 2009, 0801–0811

[4] Laskar S. A., Hemachandran K., “High capacity data hiding using LSB steganography and encryption”, Int. J. Database Management Systems, 4:6 (2012), 57–68 | DOI

[5] Kharin Yu. S., Vecherko E. V., “Statisticheskoe otsenivanie parametrov modeli vkraplenii v dvoichnuyu tsep Markova”, Diskretnaya matematika, 25:2 (2013), 135–148 | DOI | MR | Zbl

[6] Ponomarev K. I., “Parametricheskaya model vkrapleniya i ee statisticheskii analiz”, Diskretnaya matematika, 21:4 (2009), 148–157 | DOI | MR | Zbl

[7] Kaimanovich V. A., Vershik A. M., “Random walks on discrete groups: boundary and entropy”, The Annals of Probability, 11:3 (1983), 457–490 | DOI | MR | Zbl

[8] Chazottes J. R., Gambaudo J. M., Hochman M., Ugalde E., “On the finite-dimensional marginals of shift-invariant measures”, Ergodic Theory and Dynamical Systems, 32:5 (2012), 1485–1500 | DOI | MR | Zbl

[9] Prasolov V. V., Mnogochleny, MTsNMO, M., 2001, 335 pp.