We show that the imperceptibility of several existing linguistic steganographic systems (Fang et al., 2017; Yang et al., 2018) relies on implicit assumptions on statistical behaviors of fluent text. We formally analyze them and empirically evaluate these assumptions. Furthermore, based on these observations, we propose an encoding algorithm called patient-Huffman with improved near-imperceptible guarantees.
Towards Near-imperceptible Steganographic Text
Analysis reveals imperceptibility in existing linguistic steganographic systems relies on statistical text assumptions; a new encoding algorithm, patient-Huffman, improves these guarantees.
- Year
- 2019
- Venue
- towards-near-imperceptible-steganographic-1
- Authors
- 2
- Hosting
- Abstract onlyARXIV-DEFAULT
Cite
Notes
Only stored in your browser.
Attribution
- Abstract & full text
- arxiv.org/abs/1907.06679v2ARXIV-DEFAULT
- TL;DR
- Semantic Scholar