- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes canonical paraphrasing as a defense against hidden communication in language-model outputs. The idea is to map texts with the same meaning to a unique representation, preventing information from being encoded through different word choices. The paper provides theoretical results about steganographic schemes and proposes a practical pipeline using embeddings, geometric center estimation, and discrete diffusion.
Critical strengths
- Preventing covert communication between LLM agents is an important problem. The idea of removing hidden information through canonicalization, rather than detecting it, is interesting.
- The proposed defense substantially reduces message recovery in the evaluated steganography experiments.
Critical weaknesses
1. Serious concerns about the theoretical results.
I am not convinced that the Simplex Theorem (Theorem A.1) is correct. The paper claims a bijection between perfectly secure steganographic schemes and the entire probability simplex. However, under uniform messages and deterministic decoding, the paper's own proof requires every decoding region to have probability . Therefore, all such schemes map to the same uniform point, not arbitrary points of the simplex. The reverse construction also assumes that arbitrary probability masses can be obtained by partitioning a discrete distribution. When this is impossible, the proof splits probability mass across messages, which appears inconsistent with the assumed deterministic decoding. These issues undermine the claimed simplex characterization and its interpretation of minimum entropy coupling.
2. The practical method does not achieve canonicalization.
The theoretical guarantee assumes that semantically equivalent texts are mapped to exactly the same output. However, Appendix F.2 reports that repeated runs of the practical pipeline produce identical outputs for only 14 of 80 inputs. High similarity between embedding centers does not establish that the final texts are canonical. Furthermore, the paper does not demonstrate that the evaluated steganographic encoders satisfy the transparency assumption required by the theorem. Consequently, the theoretical guarantee does not directly establish the security of the proposed implementation.
3. The security experiments are not convincing enough.
The main defense experiment uses only 50 chess games and evaluates recovery using a fixed decoder. The authors do not compare against standard paraphrasing defenses on the same attack. It is therefore unclear whether the complicated canonicalization pipeline performs better than simply asking an LLM to rewrite the text. Moreover, a bit-error rate close to 50% does not prove that the hidden communication channel has been eliminated. An adaptive attacker could potentially use a different encoding or decoder. The utility evaluation is also limited to 60 GSM8K examples, where only 24 answers are correct. This does not sufficiently establish that the defense preserves semantic meaning across tasks.
Questions for authors
-
Can the authors clarify the Simplex Theorem? How can perfectly secure schemes with uniform messages correspond to arbitrary points in the simplex? How is splitting probability mass compatible with deterministic decoding?
-
Does the implemented defense actually produce canonical outputs? Why are only 14/80 repeated rewrites identical? Can the authors measure residual information rather than only embedding similarity?
-
Can the authors compare against standard paraphrasing? How does the proposed method compare with a single LLM paraphrase or repeated stochastic paraphrasing on exactly the same chess payloads?
-
Can the authors evaluate adaptive attacks and semantic preservation? Can an attacker trained against the defense recover information? How well does the method preserve meaning on tasks beyond GSM8K?