Towards Near-imperceptible Steganographic Text
2019
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.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
13
References
10
Citations
NaN
KQI