TY - GEN
T1 - Format oracles on openPGP
AU - Maury, Florian
AU - Reinhard, Jean René
AU - Levillain, Olivier
AU - Gilbert, Henri
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
PY - 2015/1/1
Y1 - 2015/1/1
N2 - The principle of padding oracle attacks has been known in the cryptography research community since 1998. It has been generalized to exploit any property of decrypted ciphertexts, either stemming from the encryption scheme, or the application data format. However, this attack principle is being leveraged time and again against proposed standards and real-world applications. This may be attributed to several factors, e.g., the backward compatibility with standards selecting oracle-prone mechanisms, the difficulty of safely implementing decryption operations, and the misuse of libraries by non cryptography-savvy developers. In this article, we present several format oracles discovered in applications and libraries implementing the OpenPGP message format, among which the popular GnuPG application. We show that, if the oracles they implement are made available to an adversary, e.g., by a frontend application, he can, by querying repeatedly these oracles, decrypt all OpenPGP symmetrically encrypted packets. The corresponding asymptotic query complexities range from 2 to 28 oracle requests per plaintext byte to recover.
AB - The principle of padding oracle attacks has been known in the cryptography research community since 1998. It has been generalized to exploit any property of decrypted ciphertexts, either stemming from the encryption scheme, or the application data format. However, this attack principle is being leveraged time and again against proposed standards and real-world applications. This may be attributed to several factors, e.g., the backward compatibility with standards selecting oracle-prone mechanisms, the difficulty of safely implementing decryption operations, and the misuse of libraries by non cryptography-savvy developers. In this article, we present several format oracles discovered in applications and libraries implementing the OpenPGP message format, among which the popular GnuPG application. We show that, if the oracles they implement are made available to an adversary, e.g., by a frontend application, he can, by querying repeatedly these oracles, decrypt all OpenPGP symmetrically encrypted packets. The corresponding asymptotic query complexities range from 2 to 28 oracle requests per plaintext byte to recover.
KW - Authenticated encryption
KW - Chosen ciphertext attacks
KW - Format oracle
KW - GnuPG
KW - Implementation
KW - Padding oracle
U2 - 10.1007/978-3-319-16715-2_12
DO - 10.1007/978-3-319-16715-2_12
M3 - Conference contribution
AN - SCOPUS:84930446620
T3 - Lecture Notes in Computer Science
SP - 220
EP - 236
BT - Topics in Cryptology - CT-RSA 2015 - The Cryptographers’ Track at the RSA Conference 2015, Proceedings
A2 - Nyberg, Kaisa
PB - Springer Verlag
T2 - 2015 Conference on Cryptographer's Track at the RSA, CT-RSA 2015
Y2 - 21 April 2015 through 24 April 2015
ER -