The search functionality is under construction.

The search functionality is under construction.

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.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.5 pp.1241-1252

- Publication Date
- 2008/05/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1093/ietfec/e91-a.5.1241

- Type of Manuscript
- PAPER

- Category
- Cryptography and Information Security

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Mototsugu NISHIOKA, "Identity-Based Encryptions with Tight Security Reductions to the BDH Problem" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 5, pp. 1241-1252, May 2008, doi: 10.1093/ietfec/e91-a.5.1241.

Abstract: 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.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.5.1241/_p

Copy

@ARTICLE{e91-a_5_1241,

author={Mototsugu NISHIOKA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={Identity-Based Encryptions with Tight Security Reductions to the BDH Problem},

year={2008},

volume={E91-A},

number={5},

pages={1241-1252},

abstract={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.},

keywords={},

doi={10.1093/ietfec/e91-a.5.1241},

ISSN={1745-1337},

month={May},}

Copy

TY - JOUR

TI - Identity-Based Encryptions with Tight Security Reductions to the BDH Problem

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 1241

EP - 1252

AU - Mototsugu NISHIOKA

PY - 2008

DO - 10.1093/ietfec/e91-a.5.1241

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E91-A

IS - 5

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - May 2008

AB - 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.

ER -