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
Kami mencadangkan skim Penyulitan Berasaskan Identiti Hierarki tanpa nama (HIBE tanpa nama) dengan siferteks pendek. Sebelum kerja kami, kebanyakan skim HIBE tanpa nama mempunyai sifir teks panjang yang meningkat mengikut kedalaman hierarki penerima. Saiz teks sifir dalam skema kami tidak bergantung pada kedalaman hierarki. Selain itu, skim kami mencapai kos pengiraan terendah kerana semasa fasa penyahsulitan kos pengiraan penyahsulitan adalah malar. Keselamatan boleh dibuktikan di bawah andaian munasabah tanpa menggunakan ramalan rawak. Skim kami mencapai tanggapan keselamatan ID terpilih.
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.
Salinan
Jae Hong SEO, Tetsutaro KOBAYASHI, Miyako OHKUBO, Koutarou SUZUKI, "Anonymous Hierarchical Identity-Based Encryption with Short Ciphertexts" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 1, pp. 45-56, January 2011, doi: 10.1587/transfun.E94.A.45.
Abstract: We propose an anonymous Hierarchical Identity-Based Encryption (anonymous HIBE) scheme with short ciphertexts. Prior to our work, most anonymous HIBE schemes have long ciphertexts increased according to the hierarchical depth of recipient. The size of the ciphertext in our scheme does not depend on the depth of the hierarchy. Moreover, our scheme achieves the lowest computational cost because during the decryption phase the computational cost of decryption is constant. The security can be proven under reasonable assumptions without using random oracles. Our scheme achieves selective-ID security notion.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.45/_p
Salinan
@ARTICLE{e94-a_1_45,
author={Jae Hong SEO, Tetsutaro KOBAYASHI, Miyako OHKUBO, Koutarou SUZUKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Anonymous Hierarchical Identity-Based Encryption with Short Ciphertexts},
year={2011},
volume={E94-A},
number={1},
pages={45-56},
abstract={We propose an anonymous Hierarchical Identity-Based Encryption (anonymous HIBE) scheme with short ciphertexts. Prior to our work, most anonymous HIBE schemes have long ciphertexts increased according to the hierarchical depth of recipient. The size of the ciphertext in our scheme does not depend on the depth of the hierarchy. Moreover, our scheme achieves the lowest computational cost because during the decryption phase the computational cost of decryption is constant. The security can be proven under reasonable assumptions without using random oracles. Our scheme achieves selective-ID security notion.},
keywords={},
doi={10.1587/transfun.E94.A.45},
ISSN={1745-1337},
month={January},}
Salinan
TY - JOUR
TI - Anonymous Hierarchical Identity-Based Encryption with Short Ciphertexts
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 45
EP - 56
AU - Jae Hong SEO
AU - Tetsutaro KOBAYASHI
AU - Miyako OHKUBO
AU - Koutarou SUZUKI
PY - 2011
DO - 10.1587/transfun.E94.A.45
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2011
AB - We propose an anonymous Hierarchical Identity-Based Encryption (anonymous HIBE) scheme with short ciphertexts. Prior to our work, most anonymous HIBE schemes have long ciphertexts increased according to the hierarchical depth of recipient. The size of the ciphertext in our scheme does not depend on the depth of the hierarchy. Moreover, our scheme achieves the lowest computational cost because during the decryption phase the computational cost of decryption is constant. The security can be proven under reasonable assumptions without using random oracles. Our scheme achieves selective-ID security notion.
ER -