当前位置: X-MOL 学术IEEE Trans. Cloud Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Key-Policy Attribute-Based Temporary Keyword Search scheme for Secure Cloud Storage
IEEE Transactions on Cloud Computing ( IF 6.5 ) Pub Date : 2020-07-01 , DOI: 10.1109/tcc.2018.2825983
Mohammad Hassan Ameri , Mahshid Delavar , Javad Mohajeri , Mahmoud Salmasizadeh

Temporary keyword search on confidential data in a cloud environment is the main focus of this research. The cloud providers are not fully trusted. So, it is necessary to outsource data in the encrypted form. In the attribute-based keyword search (ABKS) schemes, the authorized users can generate some search tokens and send them to the cloud for running the search operation. These search tokens can be used to extract all the ciphertexts which are produced at any time and contain the corresponding keyword. Since this may lead to some information leakage, it is more secure to propose a scheme in which the search tokens can only extract the ciphertexts generated in a specified time interval. To this end, in this paper, we introduce a new cryptographic primitive called key-policy attribute-based temporary keyword search (KP-ABTKS) which provide this property. To evaluate the security of our scheme, we formally prove that our proposed scheme achieves the keyword secrecy property and is secure against selectively chosen keyword attack (SCKA) both in the random oracle model and under the hardness of Decisional Bilinear Diffie-Hellman (DBDH) assumption. Furthermore, we show that the complexity of the encryption algorithm is linear with respect to the number of the involved attributes. Performance evaluation shows our scheme's practicality.

中文翻译:

一种基于密钥策略属性的安全云存储临时关键字搜索方案

在云环境中对机密数据进行临时关键字搜索是本研究的主要重点。云提供商并不完全可信。因此,有必要以加密形式外包数据。在基于属性的关键字搜索(ABKS)方案中,授权用户可以生成一些搜索令牌并将它们发送到云端以运行搜索操作。这些搜索令牌可用于提取任何时间产生的包含相应关键字的所有密文。由于这可能会导致一些信息泄漏,因此提出一种搜索令牌只能提取指定时间间隔内生成的密文的方案更为安全。为此,在本文中,我们引入了一种新的加密原语,称为基于密钥策略属性的临时关键字搜索(KP-ABTKS),它提供了此属性。为了评估我们方案的安全性,我们正式证明我们提出的方案实现了关键字保密性,并且在随机预言模型和决策双线性 Diffie-Hellman (DBDH) 的硬度下都是安全的,可以抵御选择性选择的关键字攻击 (SCKA)假设。此外,我们表明加密算法的复杂性与所涉及属性的数量呈线性关系。性能评估显示了我们方案的实用性。我们正式证明,我们提出的方案实现了关键字保密性,并且在随机预言模型和决策双线性 Diffie-Hellman (DBDH) 假设的硬度下都可以抵御选择性选择的关键字攻击 (SCKA)。此外,我们表明加密算法的复杂性与所涉及属性的数量呈线性关系。性能评估显示了我们方案的实用性。我们正式证明,我们提出的方案实现了关键字保密性,并且在随机预言模型和决策双线性 Diffie-Hellman (DBDH) 假设的硬度下都可以抵御选择性选择的关键字攻击 (SCKA)。此外,我们表明加密算法的复杂性与所涉及属性的数量呈线性关系。性能评估显示了我们方案的实用性。
更新日期:2020-07-01
down
wechat
bug