On IND-qCCA Security in the ROM and Its Applications

Abstract

Bounded IND-CCA security (IND-qCCA) is a notion similar to the traditional IND-CCA security, except the adversary is restricted to a constant number q of decryption/decapsulation queries. We show in this work that IND-qCCA is easily obtained from any passively secure PKE in the (Q)ROM. That is, simply adding a confirmation hash or computing the key as the hash of the plaintext and ciphertext holds an IND-qCCA KEM. In particular, there is no need for derandomization or re-encryption as in the Fujisaki-Okamoto (FO) transform [15]. This makes the decapsulation process of such IND-qCCA KEM much more efficient than its FO-derived counterpart. In addition, IND-qCCA KEMs could be used in the recently proposed KEMTLS protocol [29] that requires IND-1CCA ephemeral key-exchange mechanisms or in TLS 1.3. Then, using similar proof techniques, we show that CPA-secure KEMs are sufficient for the TLS 1.3 handshake to be secure, solving an open problem in the ROM. In turn, this implies that the PRF-ODH assumption used to prove the security of TLS 1.3 is not necessary and can be replaced by the CDH assumption in the ROM. We also highlight and briefly discuss several use cases of IND-1CCA KEMs in protocols and ratcheting primitives. K0 ← H(σ * ); h * ← H (σ * , ct * 0 ) K1 ←$ K ct * ← (ct * 0 , h * )

Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal

“…Note. ICDH assumption is noted as Strong DH assumption in [4,7,[15][16][17][18][19][20][21]. However, in some papers [22][23][24][25][26][27][28], the name strong DH assumption also sometimes refers to a different assumption defined over bilinear maps.…”