Title | ||
---|---|---|
Efficient KDM-CCA Secure Public-Key Encryption via Auxiliary-Input Authenticated Encryption |
Abstract | ||
---|---|---|
AbstractKDM[F]-CCA security of public-key encryption (PKE) ensures the privacy of key-dependent messages f(sk) which are closely related to the secret key sk, where f∈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[Faff]-CCA security for the set of affine functions and compactness of ciphertexts simultaneously. (ii) Our second PKE construction is the first one achieving KDM[Fpolyd]-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. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1155/2017/2148534 | Periodicals |
Field | DocType | Volume |
Affine transformation,Polynomial,Computer security,Computer science,Encryption,Compact space,Hash function,Adversary,Public-key cryptography,Authenticated encryption | Journal | 2017 |
Issue | ISSN | Citations |
1 | 1939-0114 | 0 |
PageRank | References | Authors |
0.34 | 13 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shuai Han | 1 | 7 | 10.28 |
Shengli Liu | 2 | 484 | 45.70 |
Lin Lyu | 3 | 3 | 2.77 |