RSA-OAEP Is Secure under the RSA Assumption

By Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, Jacques Stern. Journal of Cryptology, 2001

431 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/84725c4ceed5a8f7cbbbffc5d7210d1f88ef361f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Networks and Communications

Citations in the corpus

Introduction to Modern Cryptography, Second Edition (2014, critical): “The original proof of OAEP was later found to be flawed; the interested reader is referred to [39, 158, 68].”
Modern Cryptography: Theory and Practice (2003, background): “[114] made a further observation and found a way to invert the RSA function for the general case of the encryption exponent.”
Dissent: accountable anonymous group messaging (2010, methodology): “A software implementation of RSA-OAEP [19] using a pseudorandom number generator meets these requirements, for example.”
Deterministic and Efficiently Searchable Encryption (2007, methodology): “Our construction is based on RSA-OAEP [12, 30].”
Formal certification of code-based cryptographic proofs (2009, methodology): “It is possible to recover IND-CCA2 security by choosing a suitable encryption scheme, as it is the case for RSAO EP [19].”
Sequences of games: a tool for taming complexity in security proofs (2004, neutral): “have also been using very similar proof styles recently [AFP04, BK04, BCP02a, BCP02b, BCP03, CPP04, DF03, DFKY03, DFJW04, Den03, FOPS04 , GaPMV03, KD04, PP03, SWP04].”
The Two Faces of Lattices in Cryptology (2001, methodology): “This was used to attack certain RSA padding signature schemes in which the messages have a (cid:12)xed pattern (see [104,57]), and it was also used to complete the proof of security of the RSA{OAEP encryption scheme (see [53]).”
Lecture Notes on Cryptography (2001, methodology): “It is shown in [89] (building on [194]) that it also achieves a notion called “plaintext-aware encryption” defined in [25, 21].”
Advances in Cryptology — CRYPTO 2002 (2002, methodology): “The first International Workshop on Information Hiding occurred in 1996, with five subsequent workshops, and even books have been published about the subject [9].”
OAEP Reconsidered (2001, methodology): “We remark, however, that the reduction in [FOPS01] is significantly less efficient than our general reduction for OAEP+.”
A Survey of Provably Secure Searchable Encryption (2014, neutral): “RSA-OAEP has been proven to be secure under the RSA assumption [Fujisaki et al. 2001].”
A Review on the State-of-the-Art Privacy-Preserving Approaches in the e-Health Clouds (2014, methodology): “For instance, the RSA-OAEP [64] and ECIES [65] are based on the RSA and ECC, respectively.”
Provably authenticated group Diffie-Hellman key exchange (2001, result): “Previous security analyses in the ideal-hash model, the so-called random-oracle model [7, 14] wherein the cryptographic hash functions (like SHA or MD5) are viewed as random functions, provide satisfactorily convincing guarantees of security for numerous cryptographic schemes [8, 16, 27] although no”
Public Key Cryptography (2014, neutral): “RSA-OAEP is IND-CCA2 under the RSA assumption and the random oracle assumption [10].”