Published in

Springer Verlag, Lecture Notes in Computer Science, p. 114-127

DOI: 10.1007/3-540-45325-3_11

Links

Tools

Export citation

Search in Google Scholar

Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (Or: The Importance of the Order of Decryption and Validation) (Published in B. Honary, Ed., Cryptography and Coding, vol. 2260 of Lecture Notes in Computer Science, pp. 114{127, Springer-Verlag, 2001.)

Journal article published in 2004 by Seungjoo Kim, Jung Hee Cheon, Marc Joye, Seongan Lim, Masahiro Mambo, Dongho Won, Yuliang Zheng
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

This paper presents a new type of powerful cryptanalytic at- tacks on public-key cryptosystems, extending the more commonly stud- ied adaptive chosen-ciphertext attacks. In the new attacks, an adversary is not only allowed to submit to a decryption oracle (valid or invalid) ciphertexts of her choice, but also to emit a \dump query" prior to the completion of a decryption operation. The dump query returns interme- diate results that have not been erased in the course of the decryption operation, whereby allowing the adversary to gain vital advantages in breaking the cryptosystem. We believe that the new attack model approximates more closely existing security systems. We examine its power by demonstrating that most existing public-key cryptosystems, including OAEP-RSA, are vulnerable to our extended attacks.