mlsanityData to 14 Oct 2026

HiTMS: A High-Throughput Multi-Stream Linguistic Steganography Framework

arXiv 2607.23597 ↗First posted 26 Jul 2026cs.CR cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

Generative linguistic steganography conceals secret bits within the sampling randomness of large language models. Existing schemes are single-stream, conveying an entire secret through a single response to a single prompt. This convention incurs limitations: it provides no protocol-level support for batched multi-stream inference, and naive co-batching does not conceal slot occupancy or payload completion. We propose the High-Throughput Multi-Stream (HiTMS) framework, which distributes a secret across multiple responses produced jointly over successive rounds of interaction. Each round embeds and extracts several streams within a single batched call, thereby amortizing the cost of model invocation and substantially improving throughput. To ensure recoverability, HiTMS wraps each response in a self-describing frame and employs a key-derived schedule that binds streams to slots and fills unused slots with decoys, guaranteeing exact recovery while concealing the number of active streams. The framework is agnostic to both the language model and the steganographic coder. Across eight dataset-model-coder settings, eight-stream HiTMS achieves up to 4.3 times higher embedding and extraction speeds than single-stream baselines, while reducing the average area under the receiver operating characteristic curve (AUROC) of steganalyzers from 0.681 to 0.601. Experiments with 4 to 64 streams demonstrate sustained throughput gains as concurrency increases. GitHub repository for this work is https://github.com/ryehr/HiTMS_steganography.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 18 of its 36 references that are in the map. First posted on arXiv 26 Jul 2026.

Builds on

18 of 36 references.

References · 18

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  3. 2019BERTScore: Evaluating Text Generation with BERTcited by 5,512
  4. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
  5. 2024A Survey on LLM-as-a-Judgecited by 1,423
  6. 2023Batch Prompting: Efficient Inference with Large Language Model APIscited by 85
  7. 2019Neural Linguistic Steganographycited by 78
  8. 2021Provably Secure Generative Linguistic Steganographycited by 34
  9. 2021Frustratingly Easy Edit-based Linguistic Steganography with a Masked Language Modelcited by 30
  10. 2025SparSamp: Efficient Provably Secure Steganography Based on Sparse Samplingcited by 14
  11. 2022Addressing Segmentation Ambiguity in Neural Linguistic Steganographycited by 7
  12. 2022Autoregressive Linguistic Steganography Based on BERT and Consistency Codingcited by 6
6 more
  1. 2024Provably Secure Disambiguating Neural Linguistic Steganographycited by 5
  2. 2025Addressing Tokenization Inconsistency in Steganography and Watermarking Based on Large Language Modelscited by 4
  3. 2026Efficient Provably Secure Linguistic Steganography via Range Codingcited by 3
  4. 2026STEAD: Robust Provably Secure Linguistic Steganography with Diffusion Language Modelcited by 2
  5. 2026Anchored Sliding Window: Toward Robust and Imperceptible Linguistic Steganographycited by 2
  6. 2025GTSD: Generative Text Steganography Based on Diffusion Modelcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.