ReTokSync: Self-Synchronizing Tokenization Disambiguation for Generative Linguistic Steganography

• URL: http://arxiv.org/abs/2604.25486v1
• Date: Tue, 28 Apr 2026 10:42:43 GMT
• Title: ReTokSync: Self-Synchronizing Tokenization Disambiguation for Generative Linguistic Steganography
• Abstract summary: Generative linguistic steganography enables covert communication by embedding secret messages into the natural language generation process.<n>The same surface text may be re-tokenized into a different token sequence at the receiver, breaking the shared decoding state.<n>We propose ReTokSync, a framework that monitors the receiver-view tokenization during generation and triggers a corrective reset only when ambiguity actually occurs.
• Score: 28.687186883782033
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generative linguistic steganography (GLS) enables covert communication by embedding secret messages into the natural language generation process. In practical deployment, however, GLS is vulnerable to tokenization ambiguity: the same surface text may be re-tokenized into a different token sequence at the receiver, breaking the shared decoding state between the communicating parties so that a single local mismatch can propagate into complete extraction failure. Existing solutions either remove ambiguous tokens -- distorting the generation distribution and compromising security -- or preserve the distribution at the cost of substantially reduced embedding capacity or prohibitive runtime overhead. To address this issue, we propose ReTokSync (Re-Tokenization Synchronization), a self-synchronizing disambiguation framework that monitors the receiver-view tokenization during generation and triggers a corrective reset only when ambiguity actually occurs. By confining the effect of tokenization ambiguity to sparse residual bit errors rather than global desynchronization, ReTokSync leaves ambiguity-free positions entirely untouched and remains compatible with the underlying steganographic algorithm. Experiments on both English and Chinese settings show that ReTokSync stays closest to the steganographic baseline in distributional security (zero KL divergence), text quality, embedding capacity, and runtime, while achieving extraction accuracy above 99.7\%. Building on this property, we further develop a two-channel covert communication mechanism in which ReTokSync serves as the primary channel and a reliable auxiliary channel corrects the remaining errors, achieving 100\% end-to-end recovery across all evaluated configurations.

Related papers

• Robust Coverless Linguistic Steganography via Sentence Embedding Space with Global Resynchronization [13.323452988976435]
  Linguistic steganography enables covert communication through natural language.<n>Existing methods rely on token-level operations and struggle to maintain reliability under word- and sentence-level perturbations.<n>We propose a robust coverless steganographic framework that operates in the sentence embedding space rather than the token space.
  arXiv  Detail & Related papers  (2026-09-04T10:22:35Z)
• Synchronized Logit Steering: Real-world Steganography [0.0]
  We introduce Synchronized Logit Steering (SLS)<n>SLS encodes payload values as token ranks within high-entropy regions of the proxy prompt distribution.<n>We extend the scheme with periodic recurrence and payload bursts to scale information density.
  arXiv  Detail & Related papers  (2026-08-09T22:49:45Z)
• C$^{2}$R: Cross-sample Consistency Regularization Mitigates Feature Splitting and Absorption in Sparse Autoencoders [56.67585330425431]
  Sparse Autoencoders (SAEs) are widely used to interpret large language models by decomposing activations into sparse, human-understandable features.<n>These issues stem from inconsistent latent assignment across samples.<n>We introduce C$2$R, which penalizes the co-activation of directionally similar latents.
  arXiv  Detail & Related papers  (2026-06-29T17:45:31Z)
• Masked Diffusion Decoding as $x$-Prediction Flow [6.887862334460162]
  Masked diffusion language models generate text by iteratively unmasking tokens, but their standard decoder reduces each step to a binary action.<n>This paper reinterprets mask prediction as clean-state prediction ($x$-prediction) and show that it can be used to induce a continuous flow in input embedding space.<n>We propose a continuous decoding framework for MDLMs where tokens can accumulate partial progress at each diffusion step and remain revisable.
  arXiv  Detail & Related papers  (2026-06-27T19:51:35Z)
• Follow the Latent Roadmap: Navigating Revocable Decoding for Diffusion LLMs with Anchor Tokens [22.687236570529844]
  We propose ASRD (Anchor Supervised Revocable Decoding), a training-free framework that operates within the embedding space.<n>We show that ASRD outperforms recent remasking baselines, achieving accuracy improvements of up to 6.4% while accelerating inference throughput by up to 7.2times$.
  arXiv  Detail & Related papers  (2026-06-15T15:23:47Z)
• PRISM: Prior Rectification and Uncertainty-Aware Structure Modeling for Diffusion-Based Text Image Super-Resolution [51.96078493242164]
  PRISM is a single-step diffusion-based Text-SR framework.<n> PRISM achieves state-of-the-art performance with millisecond-level inference.
  arXiv  Detail & Related papers  (2026-05-13T05:31:06Z)
• From Global to Local: Rethinking CLIP Feature Aggregation for Person Re-Identification [20.74226476678832]
  We propose SAGA-ReID, which reconstructs identity representations by aligning intermediate patch tokens with anchor vectors parameterized in CLIP's text embedding space.<n> Controlled experiments isolate the aggregation mechanism under two qualitatively distinct conditions.<n> Benchmark evaluations confirm consistent gains over CLIP-ReID across standard and occluded settings.
  arXiv  Detail & Related papers  (2026-04-24T03:37:21Z)
• Stability-Weighted Decoding for Diffusion Language Models [8.670026899042483]
  Existing decoding strategies rely on static confidence metrics computed at a single denoising step, ignoring temporal history and often leading to premature unmasking of unstable tokens.<n>We propose Stability-Weighted Decoding (SWD), a training-free, plug-and-play strategy that incorporates temporal stability into token scoring and acts as a universal modulator for arbitrary score-based decoding policies.
  arXiv  Detail & Related papers  (2026-04-18T17:04:10Z)
• Rejection Mixing: Fast Semantic Propagation of Mask Tokens for Efficient DLLM Inference [58.189320101488725]
  DLLMs promise fast non-autoregressive inference but suffer a severe quality-speed trade-off in parallel decoding.<n>We address this by integrating continuous representations into the discrete decoding process, as they preserve rich inter-position dependency.<n>We propose ReMix, a framework that introduces a novel Continuous Mixing State as an intermediate between the initial masked state and the final decoded token state.
  arXiv  Detail & Related papers  (2026-02-26T11:08:11Z)
• STEAD: Robust Provably Secure Linguistic Steganography with Diffusion Language Model [71.35577462669856]
  We propose a robust, provably secure linguistic steganography with diffusion language models (DLMs)<n>We introduce error correction strategies, including pseudo-random error correction and neighborhood search correction, during steganographic extraction.
  arXiv  Detail & Related papers  (2026-01-21T08:58:12Z)
• StableToken: A Noise-Robust Semantic Speech Tokenizer for Resilient SpeechLLMs [54.229363096087866]
  Speech tokenizers are not robust to meaning-irrelevant acoustic perturbations.<n>This instability stems from two flaws: a brittle single-path quantization architecture and a distant training signal.<n>We introduce StableToken, a tokenizer that achieves stability through a consensus-driven mechanism.
  arXiv  Detail & Related papers  (2025-09-26T11:32:51Z)
• Spatial Semantic Recurrent Mining for Referring Image Segmentation [63.34997546393106]
  We propose Stextsuperscript2RM to achieve high-quality cross-modality fusion. It follows a working strategy of trilogy: distributing language feature, spatial semantic recurrent coparsing, and parsed-semantic balancing. Our proposed method performs favorably against other state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2024-05-15T00:17:48Z)
• Provably Secure Disambiguating Neural Linguistic Steganography [66.30965740387047]
  The segmentation ambiguity problem, which arises when using language models based on subwords, leads to occasional decoding failures.<n>We propose a novel secure disambiguation method named SyncPool, which effectively addresses the segmentation ambiguity problem.<n> SyncPool does not change the size of the candidate pool or the distribution of tokens and thus is applicable to provably secure language steganography methods.
  arXiv  Detail & Related papers  (2024-03-26T09:25:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.