Identity-Based Encryptions with Tight Security Reductions to the BDH Problem
スポンサーリンク
概要
- 論文の詳細を見る
We present IND-ID-CPA secure identity-based encryption (IBE) schemes with tight reductions to the bilinear Diffie-Hellman (BDH) problem. Since the methods for obtaining IND-ID-CCA secure schemes from IND-ID-CPA secure schemes with tight reductions are already known, we can consequently obtain IND-ID-CCA secure schemes with tight reductions to the BDH problem. Our constructions are based on IBE schemes with tight reductions to the list bilinear Diffie-Hellman (LBDH) problem, and the schemes are converted to those with tight reductions to the BDH problem. Interestingly, it can be shown that there exists a black box construction, in which the former IBE schemes are given as black boxes. Our constructions are very simple and reasonably efficient.
- 2008-05-01
著者
関連論文
- Identity-Based Encryptions with Tight Security Reductions to the BDH Problem
- A Note on the Random Oracle Methodology
- Public-Key Encryptions with Invariant Security Reductions in the Multi-User Setting