Identity-based hierarchical designated decryption

Shu Hui Chang, Chuan Ming Li, Tzone-Lih Hwang

Research output: Contribution to journalArticle

Abstract

This paper presents an identity-based hierarchical designated decryption (IHDD) scheme which allows a message sender to generate ciphertexts that can be decrypted by (1) only a specified recipient or (2) a specified recipient and all or some of its ancestor users in the hierarchy tree. The newly proposed scheme can be considered as a combination of the hierarchical identity-based encryption (HIBE) and the identity-based multirecipient encryption scheme (ID-based MRES). However, the purpose and structure of the proposed IHDD scheme are different from those of the HIBE and the ID-based MRES. The proposed IHDD scheme has low computation complexity, in which the decryption operation needs only one bilinear pairing computation, and constant length private keys wherein the length of users' private keys is independent of the hierarchy depth. The security of the proposed scheme is based on the decision bilinear Diffie-Hellman inversion assumption without using random oracles.

Original languageEnglish
Pages (from-to)1243-1259
Number of pages17
JournalJournal of Information Science and Engineering
Volume26
Issue number4
Publication statusPublished - 2010 Jul

Fingerprint

Cryptography
recipient

All Science Journal Classification (ASJC) codes

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Computational Theory and Mathematics
  • Library and Information Sciences

Cite this

Chang, Shu Hui ; Li, Chuan Ming ; Hwang, Tzone-Lih. / Identity-based hierarchical designated decryption. In: Journal of Information Science and Engineering. 2010 ; Vol. 26, No. 4. pp. 1243-1259.
@article{2752c8df3fc74c84be5e2f24eb5acf41,
title = "Identity-based hierarchical designated decryption",
abstract = "This paper presents an identity-based hierarchical designated decryption (IHDD) scheme which allows a message sender to generate ciphertexts that can be decrypted by (1) only a specified recipient or (2) a specified recipient and all or some of its ancestor users in the hierarchy tree. The newly proposed scheme can be considered as a combination of the hierarchical identity-based encryption (HIBE) and the identity-based multirecipient encryption scheme (ID-based MRES). However, the purpose and structure of the proposed IHDD scheme are different from those of the HIBE and the ID-based MRES. The proposed IHDD scheme has low computation complexity, in which the decryption operation needs only one bilinear pairing computation, and constant length private keys wherein the length of users' private keys is independent of the hierarchy depth. The security of the proposed scheme is based on the decision bilinear Diffie-Hellman inversion assumption without using random oracles.",
author = "Chang, {Shu Hui} and Li, {Chuan Ming} and Tzone-Lih Hwang",
year = "2010",
month = "7",
language = "English",
volume = "26",
pages = "1243--1259",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "4",

}

Identity-based hierarchical designated decryption. / Chang, Shu Hui; Li, Chuan Ming; Hwang, Tzone-Lih.

In: Journal of Information Science and Engineering, Vol. 26, No. 4, 07.2010, p. 1243-1259.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Identity-based hierarchical designated decryption

AU - Chang, Shu Hui

AU - Li, Chuan Ming

AU - Hwang, Tzone-Lih

PY - 2010/7

Y1 - 2010/7

N2 - This paper presents an identity-based hierarchical designated decryption (IHDD) scheme which allows a message sender to generate ciphertexts that can be decrypted by (1) only a specified recipient or (2) a specified recipient and all or some of its ancestor users in the hierarchy tree. The newly proposed scheme can be considered as a combination of the hierarchical identity-based encryption (HIBE) and the identity-based multirecipient encryption scheme (ID-based MRES). However, the purpose and structure of the proposed IHDD scheme are different from those of the HIBE and the ID-based MRES. The proposed IHDD scheme has low computation complexity, in which the decryption operation needs only one bilinear pairing computation, and constant length private keys wherein the length of users' private keys is independent of the hierarchy depth. The security of the proposed scheme is based on the decision bilinear Diffie-Hellman inversion assumption without using random oracles.

AB - This paper presents an identity-based hierarchical designated decryption (IHDD) scheme which allows a message sender to generate ciphertexts that can be decrypted by (1) only a specified recipient or (2) a specified recipient and all or some of its ancestor users in the hierarchy tree. The newly proposed scheme can be considered as a combination of the hierarchical identity-based encryption (HIBE) and the identity-based multirecipient encryption scheme (ID-based MRES). However, the purpose and structure of the proposed IHDD scheme are different from those of the HIBE and the ID-based MRES. The proposed IHDD scheme has low computation complexity, in which the decryption operation needs only one bilinear pairing computation, and constant length private keys wherein the length of users' private keys is independent of the hierarchy depth. The security of the proposed scheme is based on the decision bilinear Diffie-Hellman inversion assumption without using random oracles.

UR - http://www.scopus.com/inward/record.url?scp=77955537868&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955537868&partnerID=8YFLogxK

M3 - Article

VL - 26

SP - 1243

EP - 1259

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 4

ER -