Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions

Han, Shuai; Liu, Shengli; Lyu, Lin

doi:10.1007/978-3-662-53890-6_11

Cited by 16 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper constitutes an extended full version of [17]. The new results in this paper are as follows.…”

Section: Methodsmentioning

confidence: 99%

“…Roughly speaking, the problem of their security reduction is that there is no efficient way for the DDH adversary to convert the forgery provided by the INT-F aff -RKA adversary to a decision bit for solving the DDH problem, since it has no trapdoor. See our conference version [17] for details. The failure of AE's INT-F aff -RKA security reduction directly affects the validity of LLJ's KDM[F aff ]-CCA security proof.…”

Section: Kdm[f]-cca Securitymentioning

confidence: 99%

See 1 more Smart Citation

Efficient KDM-CCA Secure Public-Key Encryption via Auxiliary-Input Authenticated Encryption

Han¹,

Liu²,

Lyu³

2017

Security and Communication Networks

Self Cite

View full text Add to dashboard Cite

KDM[F]-CCA security of public-key encryption (PKE) ensures the privacy of key-dependent messages (sk) which are closely related to the secret key sk, where ∈ F, even if the adversary is allowed to make decryption queries. In this paper, we study the design of KDM-CCA secure PKE. To this end, we develop a new primitive named Auxiliary-Input Authenticated Encryption (AIAE). For AIAE, we introduce two related-key attack (RKA) security notions, including IND-RKA and weak-INT-RKA. We present a generic construction of AIAE from tag-based hash proof system (HPS) and one-time secure authenticated encryption (AE) and give an instantiation of AIAE under the Decisional Diffie-Hellman (DDH) assumption. Using AIAE as an essential building block, we give two constructions of efficient KDM-CCA secure PKE based on the DDH and the Decisional Composite Residuosity (DCR) assumptions. Specifically, (i) our first PKE construction is the first one achieving KDM[F aff ]-CCA security for the set of affine functions and compactness of ciphertexts simultaneously. (ii) Our second PKE construction is the first one achieving KDM[F poly ]-CCA security for the set of polynomial functions and almost compactness of ciphertexts simultaneously. Our PKE constructions are very efficient; in particular, they are pairing-free and NIZK-free.

show abstract

“…This paper constitutes an extended full version of [17]. The new results in this paper are as follows.…”

Section: Methodsmentioning

confidence: 99%

Section: Kdm[f]-cca Securitymentioning

confidence: 99%

Efficient KDM-CCA Secure Public-Key Encryption via Auxiliary-Input Authenticated Encryption

Han¹,

Liu²,

Lyu³

2017

Security and Communication Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…A first attempt of KDM-CCA security without pairings was made by Lu et al [79]. Han et al [60] identified a bug in [79] and gave a patch using the same methodology. They obtained KDM-CCA security for bounded-degree polynomial functions under the DDH and DCR assumptions.…”

Section: Related Workmentioning

confidence: 99%