The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Apresentamos esquemas de criptografia segura baseada em identidade (IBE) IND-ID-CPA com fortes reduções ao problema bilinear Diffie-Hellman (BDH). Como os métodos para obter esquemas seguros IND-ID-CCA a partir de esquemas seguros IND-ID-CPA com reduções rigorosas já são conhecidos, podemos, consequentemente, obter esquemas seguros IND-ID-CCA com reduções rigorosas para o problema BDH. Nossas construções são baseadas em esquemas IBE com reduções rigorosas ao problema de lista bilinear Diffie-Hellman (LBDH), e os esquemas são convertidos para aqueles com reduções rigorosas ao problema BDH. Curiosamente, pode ser demonstrado que existe uma construção de caixa negra, na qual os antigos esquemas IBE são apresentados como caixas negras. Nossas construções são muito simples e razoavelmente eficientes.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -