Cryptology ePrint Archive: Report 2020/075

Memory-Tight Reductions for Practical Key Encapsulation Mechanisms

Rishiraj Bhattacharyya

Abstract: The efficiency of a black-box reduction is an important goal of modern cryptography. Traditionally, the time complexity and the success probability were considered as the main aspects of efficiency measurements. In CRYPTO 2017, Auerbach et al. introduced the notion of memory-tightness in cryptographic reductions and showed a memory-tight reduction of the existential unforgeability of the RSA-FDH signature scheme. Unfortunately, their techniques do not extend directly to the reductions involving intricate RO-programming. The problem seems to be inherent as all the other existing results on memory-tightness are lower bounds and impossibility results. In fact, Auerbach et al. conjectured that a memory-tight reduction for IND-CCA security of Hashed-ElGamal KEM is impossible.   -We refute the above conjecture. Using a simple RO simulation technique, we provide memory-tight reductions of IND-CCA  security of the Cramer-Shoup and the ECIES version of Hashed-ElGamal KEM.  

- We prove memory-tight reductions for different variants of Fujisaki-Okamoto Transformation. We analyze the modular transformations introduced by  Hofheinz,  H\"{o}vermanns and Kiltz (TCC 2017). In addition to the constructions involving implicit rejection, we present a memory-tight reduction for the IND-CCA  security of the transformation ${\mbox{QFO}_m^\perp}$. Our techniques can withstand correctness-errors, and applicable to several lattice-based KEM candidates.

Category / Keywords: public-key cryptography / Memory-tight Reduction; Hashed-ElGamal; FO transformation

Original Publication (with minor differences): IACR-PKC-2020

Date: received 24 Jan 2020, last revised 24 Jan 2020

Contact author: rishiraj bhattacharyya at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20200126:193428 (All versions of this report)

Short URL: ia.cr/2020/075


[ Cryptology ePrint archive ]