IEICE TRANSACTIONS on Communications
Attribute-Based Keyword Search with Proxy Re-Encryption in the Cloud
Summary :
This work is conducted to solve the current problem in the attribute-based keyword search (ABKS) scheme about how to securely and efficiently delegate the search rights to other users when the authorized user is not online. We first combine proxy re-encryption (PRE) with the ABKS technology and propose a scheme called attribute-based keyword search with proxy re-encryption (PABKS). The scheme not only realizes the functions of data search and fine-grained access control, but also supports search function sharing. In addition, we randomly blind the user's private key to the server, which ensures the confidentiality and security of the private key. Then, we also prove that the scheme is selective access structure and chosen keyword attack (IND-sAS-CKA) secured in the random oracle model. A performance analysis and security proof show that the proposed scheme can achieve efficient and secure data search in the cloud.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E101-B No.8 pp.1798-1808
- Publication Date
- 2018/08/01
- Publicized
- 2018/02/16
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2017EBP3274
- Type of Manuscript
- PAPER
- Category
- Fundamental Theories for Communications
Authors
Yanli CHEN
Nanjing University of Posts and Telecommunications
Yuanyuan HU
Nanjing University of Posts and Telecommunications
Minhui ZHU
Nanjing University of Posts and Telecommunications
Geng YANG
Nanjing University of Posts and Telecommunications
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
Yanli CHEN, Yuanyuan HU, Minhui ZHU, Geng YANG, "Attribute-Based Keyword Search with Proxy Re-Encryption in the Cloud" in IEICE TRANSACTIONS on Communications,
vol. E101-B, no. 8, pp. 1798-1808, August 2018, doi: 10.1587/transcom.2017EBP3274.
Abstract: This work is conducted to solve the current problem in the attribute-based keyword search (ABKS) scheme about how to securely and efficiently delegate the search rights to other users when the authorized user is not online. We first combine proxy re-encryption (PRE) with the ABKS technology and propose a scheme called attribute-based keyword search with proxy re-encryption (PABKS). The scheme not only realizes the functions of data search and fine-grained access control, but also supports search function sharing. In addition, we randomly blind the user's private key to the server, which ensures the confidentiality and security of the private key. Then, we also prove that the scheme is selective access structure and chosen keyword attack (IND-sAS-CKA) secured in the random oracle model. A performance analysis and security proof show that the proposed scheme can achieve efficient and secure data search in the cloud.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2017EBP3274/_p
Copy
@ARTICLE{e101-b_8_1798,
author={Yanli CHEN, Yuanyuan HU, Minhui ZHU, Geng YANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Attribute-Based Keyword Search with Proxy Re-Encryption in the Cloud},
year={2018},
volume={E101-B},
number={8},
pages={1798-1808},
abstract={This work is conducted to solve the current problem in the attribute-based keyword search (ABKS) scheme about how to securely and efficiently delegate the search rights to other users when the authorized user is not online. We first combine proxy re-encryption (PRE) with the ABKS technology and propose a scheme called attribute-based keyword search with proxy re-encryption (PABKS). The scheme not only realizes the functions of data search and fine-grained access control, but also supports search function sharing. In addition, we randomly blind the user's private key to the server, which ensures the confidentiality and security of the private key. Then, we also prove that the scheme is selective access structure and chosen keyword attack (IND-sAS-CKA) secured in the random oracle model. A performance analysis and security proof show that the proposed scheme can achieve efficient and secure data search in the cloud.},
keywords={},
doi={10.1587/transcom.2017EBP3274},
ISSN={1745-1345},
month={August},}
Copy
TY - JOUR
TI - Attribute-Based Keyword Search with Proxy Re-Encryption in the Cloud
T2 - IEICE TRANSACTIONS on Communications
SP - 1798
EP - 1808
AU - Yanli CHEN
AU - Yuanyuan HU
AU - Minhui ZHU
AU - Geng YANG
PY - 2018
DO - 10.1587/transcom.2017EBP3274
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E101-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2018
AB - This work is conducted to solve the current problem in the attribute-based keyword search (ABKS) scheme about how to securely and efficiently delegate the search rights to other users when the authorized user is not online. We first combine proxy re-encryption (PRE) with the ABKS technology and propose a scheme called attribute-based keyword search with proxy re-encryption (PABKS). The scheme not only realizes the functions of data search and fine-grained access control, but also supports search function sharing. In addition, we randomly blind the user's private key to the server, which ensures the confidentiality and security of the private key. Then, we also prove that the scheme is selective access structure and chosen keyword attack (IND-sAS-CKA) secured in the random oracle model. A performance analysis and security proof show that the proposed scheme can achieve efficient and secure data search in the cloud.
ER -
English
