What Is Synonym-Choice Steganography?

Direct answer

Synonym-choice steganography is a linguistic hidden-information technique that encodes symbols through deliberate lexical alternatives. A shared codebook can assign one context-appropriate word to 0 and another to 1, allowing ordinary-looking prose to carry a secondary binary message.

How a lexical codebook works

The sender and decoder first agree on eligible carrier positions and the alternatives permitted at each position. In a binary codebook, one word is state 0 and the paired alternative is state 1. The visible sentence is then written using the choice required by the hidden bitstream, while the decoder later maps those same choices back to bits.

Worked benign example

Suppose one carrier position allows the pair quiet/calm and the codebook defines quiet = 0 and calm = 1. A second position might use route/path with route = 0 and path = 1. The phrase calm route would therefore contribute the bits 10 under that specific codebook. The mapping is conventional rather than inherent in the words.

Context sensitivity matters

Dictionary synonyms are not automatically interchangeable. Alternatives can differ in grammatical behavior, tone, collocation, implied intensity, domain meaning, or the particular sense activated by nearby words. A practical lexical channel therefore needs context-aware curation and should skip positions where substitution would make the prose unnatural or change meaning.

Capacity and naturalness trade off

A binary carrier position has a nominal ceiling of one raw bit, but only positions with two genuinely acceptable alternatives are usable. Increasing payload pressure can force awkward or statistically unusual word choices, so a lower-rate scheme that skips weak positions may produce more natural cover text than one that tries to encode at every opportunity.

Why paraphrasing is destructive

Lexical-choice channels are usually fragile under active rewriting. A paraphraser may replace a carrier word with a third synonym, choose the opposite codebook member, delete a carrier, or insert new wording that changes synchronization. The visible meaning may survive while the hidden bit sequence no longer does.

Synchronization and decoder agreement

Reliable decoding requires both sides to agree on carrier order, exact codebook membership, text normalization, case handling, and how repeated or skipped positions are treated. If the sender and decoder use different eligibility rules or different word senses, a deterministic-looking scheme can still fail.

How to solve synonym-choice puzzles

Identify the shared codebook first, then scan the artifact in the stated carrier order and ignore non-carrier words. Convert each observed codebook member into its assigned symbol, group the resulting bits according to the specified encoding, and decode. If the output is incoherent, check carrier alignment before assuming the codebook itself is wrong.

Detection and defensive analysis

Once a codebook or candidate lexical classes are known, software can test carrier positions directly. Without the codebook, defenders can still look for unusual synonym distributions, repeated lexical alternation, context-inappropriate substitutions, or hidden-message robustness that disappears after controlled paraphrasing.