SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Designs, Codes and Cryptography Year : 2021

SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions

Abstract

In a selective-opening chosen ciphertext (SO-CCA) attack on an encryption scheme, an adversary A has access to a decryption oracle, and after getting a number of ciphertexts, can then adaptively corrupt a subset of them, obtaining the plaintexts and corresponding encryption randomness. SO-CCA security requires the privacy of the remaining plaintexts being well protected. There are two flavors of SO-CCA definition: the weaker indistinguishability-based (IND) and the stronger simulation-based (SIM) ones. In this paper, we study SO-CCA secure PKE constructions from all-but-many lossy trapdoor functions (ABM-LTFs) in pairing-friendly prime order groups. Concretely, we construct two ABM-LTFs with O(n/ log λ) size tags for n bits inputs and security parameter λ, which lead to IND-SO-CCA secure PKEs with ciphertext size O(n/ log λ) to encrypt n bits messages. In addition, our second ABM-LTF enjoys tight security, so as the resulting PKE. by equipping a lattice trapdoor for opening randomness, we show our ABM-LTFs are SIM-SO-CCA compatible.
Fichier principal
Vignette du fichier
DCC21.pdf (291.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03380672 , version 1 (15-10-2021)
hal-03380672 , version 2 (07-02-2022)

Identifiers

Cite

Dingding Jia, Benoît Libert. SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions. Designs, Codes and Cryptography, 2021, 89 (5), pp.895-923. ⟨10.1007/s10623-021-00849-9⟩. ⟨hal-03380672v2⟩
100 View
106 Download

Altmetric

Share

Gmail Facebook X LinkedIn More