OAEP++ : A Very Simple Way to Apply OAEP to Deterministic OW-CPA Primitives

Kazukuni Kobara; Hideki Imai

Paper 2002/130

OAEP++ : A Very Simple Way to Apply OAEP to Deterministic OW-CPA Primitives

Kazukuni Kobara and Hideki Imai

Abstract

We prove in the random oracle model that OAEP++, which was proposed by us at the rump session of Asiacrypt 2000, can generate IND-CCA2 ciphers using deterministic OW-CPA cryptographic primitives. Note that OAEP++ differs from OAEP$^{++}$ proposed by Jonsson in \cite{Jon02}. While OAEP$^{++}$ requires a non-malleable block cipher, OAEP++ does not require such additional functions. The security reduction of OAEP++ is as tight as that of OAEP$^{++}$.

Metadata

Available format(s): PDF PS
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Keywords: random oracle model provable security OAEP IND-CCA2 OW-CPA
Contact author(s): kobara @ iis u-tokyo ac jp
History: 2002-08-27: received
Short URL: https://ia.cr/2002/130
License: CC BY

BibTeX

@misc{cryptoeprint:2002/130,
      author = {Kazukuni Kobara and Hideki Imai},
      title = {{OAEP}++ : A Very Simple Way to Apply {OAEP} to Deterministic {OW}-{CPA} Primitives},
      howpublished = {Cryptology {ePrint} Archive, Paper 2002/130},
      year = {2002},
      url = {https://eprint.iacr.org/2002/130}
}