IEICE TRANSACTIONS on Fundamentals
Partially Wildcarded Ciphertext-Policy Attribute-Based Encryption and Its Performance Evaluation
Summary :
Attribute-based encryption (ABE) enables flexible data access control based on attributes and policies. In ciphertext-policy ABE (CP-ABE), a secret key is associated with a set of attributes and a policy is associated with a ciphertext. If the set of attributes satisfies the policy, the ciphertext can be decrypted. CP-ABE can be applied to a variety of services such as access control for file sharing systems and content distribution services. However, a CP-ABE scheme usually has larger costs for encryption and decryption than conventional public-key encryption schemes due to flexible policy setting. In particular, wildcards, which mean that certain attributes are not relevant to the ciphertext policy, are not essential for a certain service. In this paper, we propose a partially wildcarded CP-ABE scheme with a lower encryption and decryption cost. In our scheme, user's attributes are separated into those requiring wildcards and those not requiring wildcards. Our scheme embodies a CP-ABE scheme with a wildcard functionality and an efficient CP-ABE scheme without wildcard functionality. We show that our scheme is provably secure under the DBDH assumption. Then, we compare our scheme with the conventional CP-ABE schemes and describe a content distribution service as an application of our scheme. Also, we implement our scheme on a PC and measure the processing time. The result shows that our scheme can reduce all of the costs for key generation, encryption, and decryption as much as possible.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.9 pp.1846-1856
- Publication Date
- 2017/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E100.A.1846
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Go OHTAKE
Japan Broadcasting Corporation (NHK)
Kazuto OGAWA
Japan Broadcasting Corporation (NHK)
Goichiro HANAOKA
National Institute of Advanced Industrial Science and Technology (AIST)
Shota YAMADA
National Institute of Advanced Industrial Science and Technology (AIST)
Kohei KASAMATSU
NTT Software Corporation
Takashi YAMAKAWA
National Institute of Advanced Industrial Science and Technology (AIST),The University of Tokyo
Hideki IMAI
The University of Tokyo
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Go OHTAKE, Kazuto OGAWA, Goichiro HANAOKA, Shota YAMADA, Kohei KASAMATSU, Takashi YAMAKAWA, Hideki IMAI, "Partially Wildcarded Ciphertext-Policy Attribute-Based Encryption and Its Performance Evaluation" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 9, pp. 1846-1856, September 2017, doi: 10.1587/transfun.E100.A.1846.
Abstract: Attribute-based encryption (ABE) enables flexible data access control based on attributes and policies. In ciphertext-policy ABE (CP-ABE), a secret key is associated with a set of attributes and a policy is associated with a ciphertext. If the set of attributes satisfies the policy, the ciphertext can be decrypted. CP-ABE can be applied to a variety of services such as access control for file sharing systems and content distribution services. However, a CP-ABE scheme usually has larger costs for encryption and decryption than conventional public-key encryption schemes due to flexible policy setting. In particular, wildcards, which mean that certain attributes are not relevant to the ciphertext policy, are not essential for a certain service. In this paper, we propose a partially wildcarded CP-ABE scheme with a lower encryption and decryption cost. In our scheme, user's attributes are separated into those requiring wildcards and those not requiring wildcards. Our scheme embodies a CP-ABE scheme with a wildcard functionality and an efficient CP-ABE scheme without wildcard functionality. We show that our scheme is provably secure under the DBDH assumption. Then, we compare our scheme with the conventional CP-ABE schemes and describe a content distribution service as an application of our scheme. Also, we implement our scheme on a PC and measure the processing time. The result shows that our scheme can reduce all of the costs for key generation, encryption, and decryption as much as possible.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.1846/_p
Copy
@ARTICLE{e100-a_9_1846,
author={Go OHTAKE, Kazuto OGAWA, Goichiro HANAOKA, Shota YAMADA, Kohei KASAMATSU, Takashi YAMAKAWA, Hideki IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Partially Wildcarded Ciphertext-Policy Attribute-Based Encryption and Its Performance Evaluation},
year={2017},
volume={E100-A},
number={9},
pages={1846-1856},
abstract={Attribute-based encryption (ABE) enables flexible data access control based on attributes and policies. In ciphertext-policy ABE (CP-ABE), a secret key is associated with a set of attributes and a policy is associated with a ciphertext. If the set of attributes satisfies the policy, the ciphertext can be decrypted. CP-ABE can be applied to a variety of services such as access control for file sharing systems and content distribution services. However, a CP-ABE scheme usually has larger costs for encryption and decryption than conventional public-key encryption schemes due to flexible policy setting. In particular, wildcards, which mean that certain attributes are not relevant to the ciphertext policy, are not essential for a certain service. In this paper, we propose a partially wildcarded CP-ABE scheme with a lower encryption and decryption cost. In our scheme, user's attributes are separated into those requiring wildcards and those not requiring wildcards. Our scheme embodies a CP-ABE scheme with a wildcard functionality and an efficient CP-ABE scheme without wildcard functionality. We show that our scheme is provably secure under the DBDH assumption. Then, we compare our scheme with the conventional CP-ABE schemes and describe a content distribution service as an application of our scheme. Also, we implement our scheme on a PC and measure the processing time. The result shows that our scheme can reduce all of the costs for key generation, encryption, and decryption as much as possible.},
keywords={},
doi={10.1587/transfun.E100.A.1846},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Partially Wildcarded Ciphertext-Policy Attribute-Based Encryption and Its Performance Evaluation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1846
EP - 1856
AU - Go OHTAKE
AU - Kazuto OGAWA
AU - Goichiro HANAOKA
AU - Shota YAMADA
AU - Kohei KASAMATSU
AU - Takashi YAMAKAWA
AU - Hideki IMAI
PY - 2017
DO - 10.1587/transfun.E100.A.1846
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2017
AB - Attribute-based encryption (ABE) enables flexible data access control based on attributes and policies. In ciphertext-policy ABE (CP-ABE), a secret key is associated with a set of attributes and a policy is associated with a ciphertext. If the set of attributes satisfies the policy, the ciphertext can be decrypted. CP-ABE can be applied to a variety of services such as access control for file sharing systems and content distribution services. However, a CP-ABE scheme usually has larger costs for encryption and decryption than conventional public-key encryption schemes due to flexible policy setting. In particular, wildcards, which mean that certain attributes are not relevant to the ciphertext policy, are not essential for a certain service. In this paper, we propose a partially wildcarded CP-ABE scheme with a lower encryption and decryption cost. In our scheme, user's attributes are separated into those requiring wildcards and those not requiring wildcards. Our scheme embodies a CP-ABE scheme with a wildcard functionality and an efficient CP-ABE scheme without wildcard functionality. We show that our scheme is provably secure under the DBDH assumption. Then, we compare our scheme with the conventional CP-ABE schemes and describe a content distribution service as an application of our scheme. Also, we implement our scheme on a PC and measure the processing time. The result shows that our scheme can reduce all of the costs for key generation, encryption, and decryption as much as possible.
ER -
English
