计算机科学
随机预言
加密
云计算
云存储
关键字搜索
密码学
钥匙(锁)
方案(数学)
密码原语
甲骨文公司
理论计算机科学
公钥密码术
计算机安全
情报检索
密码协议
数学
操作系统
软件工程
数学分析
作者
Mohammad Hassan Ameri,Mahshid Delavar,Javad Mohajeri,Mahmoud Salmasizadeh
出处
期刊:IEEE Transactions on Cloud Computing
[Institute of Electrical and Electronics Engineers]
日期:2018-04-12
卷期号:8 (3): 660-671
被引量:53
标识
DOI:10.1109/tcc.2018.2825983
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI