A Generic Construction for Token-Controlled Public Key Encryption

2006 ◽  
pp. 177-190 ◽  
Author(s):  
David Galindo ◽  
Javier Herranz
Keyword(s):  
Public Key ◽  
Public Key Encryption ◽  
Generic Construction

scholarly journals Private Predicate Encryption for Inner Product from Key-Homomorphic Pseudorandom Function

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Yi-Fan Tseng ◽  
Zi-Yuan Liu ◽  
Jen-Chieh Hsu ◽  
Raylin Tso
Keyword(s):  
Discrete Logarithm ◽  
Public Key ◽  
Inner Product ◽  
Sensitive Information ◽  
Public Key Encryption ◽  
Secret Key ◽  
New Paradigm ◽  
Generic Construction ◽  
Predicate Encryption ◽  
Pseudorandom Function

Predicate encryption (PE), formalized by Katz et al., is a new paradigm of public-key encryption that conceptually captures the public-key encryption that supports fine-grained access control policy. Because of the nature of PE, it is used for cloud storage so that users can retrieve encrypted data without revealing any information about the data to cloud servers and other users. Although lots of PE schemes have been studied, the predicate-hiding security is seldom considered; that is, the user’s secret key may leak sensitive information of the predicate. Additionally, the security of the current predicate-hiding PE schemes relies on the discrete logarithm assumption which cannot resist the quantum attacks in the future. In this paper, we propose a generic PE for inner product under symmetric-key setting, called private IPE, from specific key-homomorphic pseudorandom function (PRF). The rigorous proofs are provided to show that the construction is payload-hiding, attribute-hiding, and predicate-hiding secure. With the advantage of the generic construction, if the underlying PRF can resist quantum attacks, then, through our proposed generic construction, a quantum-resistant private IPE can be obtained.

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

2017 ◽  
Vol 2017 ◽  
pp. 1-27 ◽  
Author(s):  
Shuai Han ◽  
Shengli Liu ◽  
Lin Lyu
Keyword(s):  
Public Key ◽  
Authenticated Encryption ◽  
Public Key Encryption ◽  
Secret Key ◽  
Diffie Hellman ◽  
Affine Functions ◽  
Generic Construction ◽  
Hash Proof System ◽  
Auxiliary Input ◽  
Ddh Assumption

KDM[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.

scholarly journals Generic Construction of Dual-Server Public Key Encryption With Keyword Search on Cloud Computing

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 152551-152564
Author(s):  
Raylin Tso ◽  
Kaibin Huang ◽  
Yu-Chi Chen ◽  
Sk Md Mizanur Rahman ◽  
Tsu-Yang Wu
Keyword(s):  
Cloud Computing ◽  
Keyword Search ◽  
Public Key ◽  
Public Key Encryption ◽  
Generic Construction
Sign in / Sign up

Export Citation Format

Share Document