LinL: lost in n-best list

  • Authors:
  • Peng Meng;Yun-Qing Shi;Liusheng Huang;Zhili Chen;Wei Yang;Abdelrahman Desoky

  • Affiliations:
  • NHPCC, Depart. of CS. & Tech., USTC, Hefei, China and New Jersey Institute of Technology, Newark, New Jersey;New Jersey Institute of Technology, Newark, New Jersey;NHPCC, Depart. of CS. & Tech., USTC, Hefei, China and Suzhou Institute for Advanced Study, USTC, Suzhou, China;NHPCC, Depart. of CS. & Tech., USTC, Hefei, China and Suzhou Institute for Advanced Study, USTC, Suzhou, China;NHPCC, Depart. of CS. & Tech., USTC, Hefei, China and Suzhou Institute for Advanced Study, USTC, Suzhou, China;CSEE, University of Maryland, Baltimore County, MD

  • Venue:
  • IH'11 Proceedings of the 13th international conference on Information hiding
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Translation-based steganography (TBS) is a new kind of text steganographic scheme. However, contemporary TBS methods are vulnerable to statistical attacks. Differently, this paper presents a novel TBS, namely Lost in n-best List, abbreviated as LinL, that is resilient against the current statistical attacks. LinL employs only one Statistical Machine Translator (SMT) in the encoding process which selects one of the n-best list of each cover text sentence in order to camouflage messages in stegotext. The presented theoretical analysis demonstrates that there is a classification accuracy upper bound between normal translated text and the stegotext. When the text size is 1000 sentences, the theoretical maximum classification accuracy is about 60%. The experiment results also show current steganalysis methods cannot detect LinL.