Efficient Identity-Based Encryption with Tight Security Reduction
Efficient Identity-Based Encryption with Tight Security Reduction
复制标题
DOI:
10.1007/11935070_2
复制
发表时间:
2006-12
期刊:
影响因子:
--
通讯作者:
Nuttapong Attrapadung;Jun Furukawa;Takeshi Gomi;Goichiro Hanaoka;H. Imai;Rui Zhang
中科院分区:
文献类型:
--
作者:
Nuttapong Attrapadung;Jun Furukawa;Takeshi Gomi;Goichiro Hanaoka;H. Imai;Rui Zhang
In a famous paper atCrypto’01, Boneh and Franklin proposed the first fully functional identity-based encryption scheme (IBE), around fifteen years after the concept was introduced by Shamir. Their scheme achieves chosen-ciphertext security (i.e.,secure in the sense ofIND-ID-CCA); however, the security reduction is far from being tight.In this paper, we present an efficient variant of the Boneh-Franklin scheme that achieves a tight security reduction. Our scheme is basically an IBE scheme under two keys, one of which is randomly chosen and given to the user. It can be viewed as a continuation of an idea introduced by Katz and Wang; however, unlike the Katz-Wang variant, our scheme is quite efficient, as its ciphertext size is roughly comparable to that of the original full Boneh-Franklin scheme. The security of our scheme can be based on either the gap bilinear Diffie-Hellman (GBDH) or the decisional bilinear Diffie-Hellman (DBDH) assumptions.