Towards Near-imperceptible Steganographic Text

07/15/2019
by   Falcon Z. Dai, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2021

The k-mappability problem revisited

The k-mappability problem has two integers parameters m and k. For every...
research
04/27/2018

Weaver: Deep Co-Encoding of Questions and Documents for Machine Reading

This paper aims at improving how machines can answer questions directly ...
research
04/13/2018

Comments on "Defeating HaTCh: Building Malicious IP Cores"

Recently, Haider et al. introduced the first rigorous hardware Trojan de...
research
09/12/2019

A comparison of some conformal quantile regression methods

We compare two recently proposed methods that combine ideas from conform...
research
11/12/2022

Addressing Segmentation Ambiguity in Neural Linguistic Steganography

Previous studies on neural linguistic steganography, except Ueoka et al....
research
03/11/2017

Language Use Matters: Analysis of the Linguistic Structure of Question Texts Can Characterize Answerability in Quora

Quora is one of the most popular community Q&A sites of recent times. Ho...
research
12/16/2019

Are the results of the groundwater model robust?

De Graaf et al. (2019) suggest that groundwater pumping will bring 42–79...

Please sign up or login with your details

Forgot password? Click here to reset