Paper Info
Title
Efficient CCA-Secure PKE from identity-based techniques
Abstract
Boneh, Canetti, Halevi, and Katz showed a general method for constructing CCA-secure public key encryption (PKE) from any selective-ID CPA-secure identity-based encryption (IBE) schemes. Their approach treated IBE as a black box. Subsequently, Boyen, Mei, and Waters demonstrated how to build a direct CCA-secure PKE scheme from the Waters IBE scheme, which is adaptive-ID CPA secure. They made direct use of the underlying IBE structure, and required no cryptographic primitive other than the IBE scheme itself. However, their scheme requires long public key and the security reduction is loose. In this paper, we propose an efficient PKE scheme employing identity-based techniques. Our scheme requires short public key and is proven CCA-secure in the standard model (without random oracles) with a tight security reduction, under the Decisional Bilinear Diffie-Hellman (DBDH) assumption. In addition, we show how to use our scheme to construct an efficient threshold public key encryption scheme and a public key encryption with non-interactive opening (PKENO) scheme.
Year
DOI
Venue
2010
10.1007/978-3-642-11925-5_10
CT-RSA
Keywords
Field
DocType
identity-based technique,waters ibe scheme,efficient pke scheme,public key encryption scheme,ibe scheme,public key,underlying ibe structure,public key encryption,cca-secure public key encryption,efficient cca-secure pke,short public key,direct cca-secure pke scheme,random oracle,standard model,diffie hellman
Black box (phreaking),Computer security,Attribute-based encryption,Encryption,Theoretical computer science,Cryptographic primitive,Probabilistic encryption,Public-key cryptography,Mathematics,Bilinear interpolation
Conference
Volume
ISSN
ISBN
5985
0302-9743
3-642-11924-7
Citations 
PageRank 
References 
30
0.95
31
Authors
4
Name
Order
Citations
PageRank
Junzuo Lai141924.55
R.H Deng24423362.82
Shengli Liu348445.70
Weidong Kou434825.60