Watermarking attack

In cryptography, a watermarking attack is an attack on disk encryption methods where the presence of a specially crafted piece of data can be detected by an attacker without knowing the encryption key.

Disk encryption suites generally operate on data in 512-byte sectors which are individually encrypted and decrypted. These 512-byte sectors alone can use any block cipher mode of operation (typically CBC), but since arbitrary sectors in the middle of the disk need to be accessible individually, they cannot depend on the contents of their preceding/succeeding sectors. Thus, with CBC, each sector has to have its own initialization vector (IV). If these IVs are predictable by an attacker (and the filesystem reliably starts file content at the same offset to the start of each sector, and files are likely to be largely contiguous), then there is a chosen plaintext attack which can reveal the existence of encrypted data.

The problem is analogous to that of using block ciphers in the electronic codebook (ECB) mode, but instead of whole blocks, only the first block in different sectors are identical. The problem can be relatively easily eliminated by making the IVs unpredictable with, for example, ESSIV.^[1]

Alternatively, one can use modes of operation specifically designed for disk encryption (see disk encryption theory). This weakness affected many disk encryption programs, including older versions of BestCrypt^[2] as well as the now-deprecated cryptoloop.^[3]

To carry out the attack, a specially crafted plaintext file is created for encryption in the system under attack, to "NOP-out" the IV^[4] such that the first ciphertext block in two or more sectors is identical. This requires that the input to the cipher (plaintext, P {\displaystyle \scriptstyle P} , XOR initialisation vector, I V {\displaystyle \scriptstyle IV} ) for each block must be the same; i.e., P 1 ⊕ I V 1 = P 2 ⊕ I V 2 {\displaystyle \scriptstyle P_{1}\,\oplus \,IV_{1}\;=\;P_{2}\,\oplus \,IV_{2}} . Thus, we must choose plaintexts, P 1 , P 2 {\displaystyle \scriptstyle P_{1},\,P_{2}} such that P 1 ⊕ P 2 = I V 1 ⊕ I V 2 {\displaystyle \scriptstyle P_{1}\,\oplus \,P_{2}\;=\;IV_{1}\,\oplus \,IV_{2}} .

The ciphertext block patterns generated in this way give away the existence of the file, without any need for the disk to be decrypted first.

• Disk encryption theory
• Initialization vector
• Block cipher modes of operation
• Watermark