Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions

@article{Wang2008PerfectlySS,
  title={Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions},
  author={Ying Wang and Pierre Moulin},
  journal={IEEE Transactions on Information Theory},
  year={2008},
  volume={54},
  pages={2706-2722}
}
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext, the resulting stegotext is required to have exactly the same probability distribution as the covertext. Then no statistical test can reliably detect the presence of the hidden message. We refer to such steganographic schemes as perfectly secure. A few such schemes have been proposed in recent literature, but they have… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 107 citations. REVIEW CITATIONS
64 Citations
38 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 64 extracted citations

107 Citations

051015'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 107 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 38 references

Steganography via cover ing codes

  • F. Galand, G. Kabatiansky
  • inProc. Int. Sym. on Inform. Theory , Yokohama…
  • 2003
Highly Influential
4 Excerpts

On the capacity game of public watermarking system s

  • ——
  • IEEE Trans. Inform. Theory , vol. 50, no. 3, pp…
  • 2004
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…