Padding oracle attack

In cryptography, a padding oracle attack is an attack which uses the padding validation of a cryptographic message to decrypt the ciphertext. In cryptography, variable-length plaintext messages often have to be padded (expanded) to be compatible with the underlying cryptographic primitive. The attack relies on having a "padding oracle" who freely responds to queries about whether a message is correctly padded or not. The information could be directly given, or leaked through a side-channel.

The earliest well-known attack that uses a padding oracle is Bleichenbacher's attack of 1998, which attacks RSA with PKCS #1 v1.5 padding.^[1] The term "padding oracle" appeared in literature in 2002,^[2] after Serge Vaudenay's attack on the CBC mode decryption used within symmetric block ciphers.^[3] Variants of both attacks continue to find success more than one decade after their original publication.^[1][4][5]

In 1998, Daniel Bleichenbacher published a seminal paper on what became known as Bleichenbacher's attack (also known as "million message attack"). The attack uses a padding oracle against RSA with PKCS #1 v1.5 padding, but it does not include the term. Later authors have classified his attack as a padding oracle attack.^[1]

Manger (2001) reports an attack on the replacement for PKCS #1 v1.5 padding, PKCS #1 v2.0 "OAEP".^[6]

In symmetric cryptography, the padding oracle attack can be applied to the CBC mode of operation. Leaked data on padding validity can allow attackers to decrypt (and sometimes encrypt) messages through the oracle using the oracle's key, without knowing the encryption key.

Compared to Bleichenbacher's attack on RSA with PKCS #1 v1.5, Vaudenay's attack on CBC is much more efficient.^[1] Both attacks target crypto systems commonly used for the time: CBC is the original mode used in Secure Sockets Layer (SSL) and had continued to be supported in TLS.^[4]

A number of mitigations have been performed to prevent the decryption software from acting as an oracle, but newer attacks based on timing have repeatedly revived this oracle. TLS 1.2 introduces a number of authenticated encryption with additional data modes that do not rely on CBC.^[4]

The standard implementation of CBC decryption in block ciphers is to decrypt all ciphertext blocks, validate the padding, remove the PKCS7 padding, and return the message's plaintext. If the server returns an "invalid padding" error instead of a generic "decryption failed" error, the attacker can use the server as a padding oracle to decrypt (and sometimes encrypt) messages.

The mathematical formula for CBC decryption is

${\displaystyle P_{i}=D_{K}(C_{i})\oplus C_{i-1},}$

${\displaystyle C_{0}=IV.}$

As depicted above, CBC decryption XORs each plaintext block with the previous block. As a result, a single-byte modification in block ${\displaystyle C_{1}}$ will make a corresponding change to a single byte in ${\displaystyle P_{2}}$.

Suppose the attacker has two ciphertext blocks ${\displaystyle C_{1},C_{2}}$ and wants to decrypt the second block to get plaintext ${\displaystyle P_{2}}$. The attacker changes the last byte of ${\displaystyle C_{1}}$ (creating ${\displaystyle C_{1}'}$) and sends ${\displaystyle (IV,C_{1}',C_{2})}$ to the server. The server then returns whether or not the padding of the last decrypted block (${\displaystyle P_{2}'}$) is correct (a valid PKCS#7 padding). If the padding is correct, the attacker now knows that the last byte of ${\displaystyle D_{K}(C_{2})\oplus C_{1}'}$ is ${\displaystyle \mathrm {0x01} }$, the last two bytes are 0x02, the last three bytes are 0x03, …, or the last eight bytes are 0x08. The attacker can modify the second-last byte (flip any bit) to ensure that the last byte is 0x01. (Alternatively, the attacker can flip earlier bytes and binary search for the position to identify the padding. For example, if modifying the third-last byte is correct, but modifying the second-last byte is incorrect, then the last two bytes are known to be 0x02, allowing both of them to be decrypted.) Therefore, the last byte of ${\displaystyle D_{K}(C_{2})}$ equals ${\displaystyle C_{1}'\oplus \mathrm {0x01} }$. If the padding is incorrect, the attacker can change the last byte of ${\displaystyle C_{1}'}$ to the next possible value. At most, the attacker will need to make 256 attempts to find the last byte of ${\displaystyle P_{2}}$, 255 attempts for every possible byte (256 possible, minus one by pigeonhole principle), plus one additional attempt to eliminate an ambiguous padding.^[7]

After determining the last byte of ${\displaystyle P_{2}}$, the attacker can use the same technique to obtain the second-to-last byte of ${\displaystyle P_{2}}$. The attacker sets the last byte of ${\displaystyle P_{2}}$ to ${\displaystyle \mathrm {0x02} }$ by setting the last byte of ${\displaystyle C_{1}}$ to ${\displaystyle D_{K}(C_{2})\oplus \mathrm {0x02} }$. The attacker then uses the same approach described above, this time modifying the second-to-last byte until the padding is correct (0x02, 0x02).

If a block consists of 128 bits (AES, for example), which is 16 bytes, the attacker will obtain plaintext ${\displaystyle P_{2}}$ in no more than 256⋅16 = 4096 attempts. This is significantly faster than the ${\displaystyle 2^{128}}$ attempts required to bruteforce a 128-bit key.

CBC-R^[8] turns a decryption oracle into an encryption oracle, and is primarily demonstrated against padding oracles.

Using padding oracle attack CBC-R can craft an initialization vector and ciphertext block for any plaintext:

• decrypt any ciphertext P_i = PODecrypt( C_i ) XOR C_i−1,
• select previous cipherblock C_x−1 freely,
• produce valid ciphertext/plaintext pair C_x-1 = P_x XOR PODecrypt( C_i ).

To generate a ciphertext that is N blocks long, attacker must perform N numbers of padding oracle attacks. These attacks are chained together so that proper plaintext is constructed in reverse order, from end of message (C_N) to beginning message (C₀, IV). In each step, padding oracle attack is used to construct the IV to the previous chosen ciphertext.

The CBC-R attack will not work against an encryption scheme that authenticates ciphertext (using a message authentication code or similar) before decrypting.

The original attack against CBC was published in 2002 by Serge Vaudenay.^[3] Concrete instantiations of the attack were later realised against SSL^[9] and IPSec.^[10][11] It was also applied to several web frameworks, including JavaServer Faces, Ruby on Rails^[12] and ASP.NET^[13][14][15] as well as other software, such as the Steam gaming client.^[16] In 2012 it was shown to be effective against PKCS 11 cryptographic tokens.^[1]

While these earlier attacks were fixed by most TLS implementors following its public announcement, a new variant, the Lucky Thirteen attack, published in 2013, used a timing side-channel to re-open the vulnerability even in implementations that had previously been fixed. As of early 2014, the attack is no longer considered a threat in real-life operation, though it is still workable in theory (see signal-to-noise ratio) against a certain class of machines. As of 2015^[update], the most active area of development for attacks upon cryptographic protocols used to secure Internet traffic are downgrade attack, such as Logjam^[17] and Export RSA/FREAK^[18] attacks, which trick clients into using less-secure cryptographic operations provided for compatibility with legacy clients when more secure ones are available. An attack called POODLE^[19] (late 2014) combines both a downgrade attack (to SSL 3.0) with a padding oracle attack on the older, insecure protocol to enable compromise of the transmitted data. In May 2016 it has been revealed in CVE-2016-2107 that the fix against Lucky Thirteen in OpenSSL introduced another timing-based padding oracle.^[20][21]