### Abstract

We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash (i.e., round) functions are modeled as random oracles, meets indistinguishability under chosen-plaintext attack (IND-CPA) in the standard model based on simple, non-interactive, and non-interdependent assumptions on RSA and the hash functions. To prove this, we first give a result on a more general notion called “padding-based” encryption, saying that such a scheme is IND-CPA if (1) its underlying padding transform satisfies a “fooling" condition against small-range distinguishers on a class of high-entropy input distributions, and (2) its trapdoor permutation is sufficiently lossy as defined by Peikert and Waters (STOC 2008). We then show that the first round of OAEP satisfies condition (1) if its hash function is t-wise independent for t roughly proportional to the allowed message length. We clarify that this result requires the hash function to be keyed, and for its key to be included in the public key of RSA-OAEP. We also show that RSA satisfies condition (2) under the Φ -Hiding Assumption of Cachin et al. (Eurocrypt 1999). This is the first positive result about the instantiability of RSA-OAEP. In particular, it increases confidence that chosen-plaintext attacks are unlikely to be found against the scheme. In contrast, RSA-OAEP’s predecessor in PKCS #1 v1.5 was shown to be vulnerable to such attacks by Coron et al. (Eurocrypt 2000).

Original language | English (US) |
---|---|

Pages (from-to) | 889-919 |

Number of pages | 31 |

Journal | Journal of Cryptology |

Volume | 30 |

Issue number | 3 |

DOIs | |

State | Published - Jul 1 2017 |

### All Science Journal Classification (ASJC) codes

- Software
- Computer Science Applications
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Instantiability of RSA-OAEP Under Chosen-Plaintext Attack'. Together they form a unique fingerprint.

## Cite this

*Journal of Cryptology*,

*30*(3), 889-919. https://doi.org/10.1007/s00145-016-9238-4