Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage

被引:75
作者
Zhang, Xiaojun [1 ,2 ,3 ]
Tang, Yao [1 ]
Wang, Huaxiong [2 ]
Xu, Chunxiang [3 ]
Miao, Yinbin [2 ,4 ]
Cheng, Hang [2 ,5 ]
机构
[1] Southwest Petr Univ, Sch Comp Sci, Res Ctr Cyber Secur, Chengdu 610500, Sichuan, Peoples R China
[2] Nanyang Technol Univ, Sch Phys & Math Sci, Singapore, Singapore
[3] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Ctr Cyber Secur, Chengdu 611731, Sichuan, Peoples R China
[4] Xidian Univ, Sch Cyber Engn, Xian 710071, Shaanxi, Peoples R China
[5] Fuzhou Univ, Coll Math & Comp Sci, Fuzhou 350108, Fujian, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金; 国家重点研发计划; 新加坡国家研究基金会;
关键词
Proxy-oriented; Identity-based encryption; Keyword search; Lattices; Post-quantum secure; Inside keyword guessing attacks; PUBLIC-KEY ENCRYPTION; RE-ENCRYPTION; SECURITY; PRIVACY; SCHEME; DECRYPTION; DATABASE;
D O I
10.1016/j.ins.2019.04.051
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Public-key encryption with keyword search (PEKS) enables users to search over encrypted data and retrieve target data efficiently. However, most of existing PEKS schemes are vulnerable to adversaries equipped with quantum computers in the near future, and even incur complex certificate management procedures due to the public key infrastructure (PKI). To this end, we propose a proxy-oriented identity-based encryption with keyword search (PO-IBEKS) scheme from lattices for cloud storage, which is post-quantum secure. In PO-IBEKS, an original data owner authorizes a proxy to encrypt sensitive data as well as corresponding keywords and upload ciphertexts to clouds, which alleviates the data processing burden on the original data owner. Besides, PO-IBEKS can resist inside keyword guessing attacks (IKGA) from misbehaved cloud servers by integrating the learning with errors (LWE) encryption and preimage sampleable function. Each entity in PO-IBEKS is identified with her/his recognizable information, thereby eliminating managing certificates. Formal security analysis proves that PO-IBEKS can achieve ciphertext indistinguishability, existential unforgeability, and delegation security. Experimental results demonstrate PO-IBEKS is much more practical when compared with existing schemes. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:193 / 207
页数:15
相关论文
共 50 条
[1]  
Agrawal S, 2010, LECT NOTES COMPUT SC, V6223, P98, DOI 10.1007/978-3-642-14623-7_6
[2]  
Ajtai M., 1999, Automata, Languages and Programming. 26th International Colloquium, ICALP'99. Proceedings (Lecture Notes in Computer Science Vol.1644), P1
[3]   Generating Shorter Bases for Hard Random Lattices [J].
Alwen, Joel ;
Peikert, Chris .
THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) :535-553
[4]  
[Anonymous], IEEE T SERV COMPUT
[5]  
[Anonymous], 2006, P AUSTR C INF SEC PR
[6]  
[Anonymous], 2017, IBM MAK BREAKTHR RAC
[7]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[8]   Server-Aided Public Key Encryption With Keyword Search [J].
Chen, Rongmao ;
Mu, Yi ;
Yang, Guomin ;
Guo, Fuchun ;
Huang, Xinyi ;
Wang, Xiaofen ;
Wang, Yongjun .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2016, 11 (12) :2833-2842
[9]   Dual-Server Public-Key Encryption With Keyword Search for Secure Cloud Storage [J].
Chen, Rongmao ;
Mu, Yi ;
Yang, Guomin ;
Guo, Fuchun ;
Wang, Xiaofen .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2016, 11 (04) :789-798
[10]   Verifiable Computation over Large Database with Incremental Updates [J].
Chen, Xiaofeng ;
Li, Jin ;
Weng, Jian ;
Ma, Jianfeng ;
Lou, Wenjing .
IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (10) :3184-3195