Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing via Cloud Storage

被引:144
作者
Cui, Baojiang [1 ,2 ]
Liu, Zheli [3 ]
Wang, Lingyu [4 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Comp Sci, Beijing, Peoples R China
[2] Beijing Univ Posts & Telecommun, Natl Engn Lab Mobile Network Secur, Beijing, Peoples R China
[3] Nankai Univ, Coll Comp & Control Engn, Tianjin 300071, Peoples R China
[4] Concordia Univ, Concordia Inst Informat Syst Engn, Montreal, PQ, Canada
基金
中国国家自然科学基金; 高等学校博士学科点专项科研基金;
关键词
Searchable encryption; data sharing; cloud storage; data privacy;
D O I
10.1109/TC.2015.2389959
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The capability of selectively sharing encrypted data with different users via public cloud storage may greatly ease security concerns over inadvertent data leaks in the cloud. A key challenge to designing such encryption schemes lies in the efficient management of encryption keys. The desired flexibility of sharing any group of selected documents with any group of users demands different encryption keys to be used for different documents. However, this also implies the necessity of securely distributing to users a large number of keys for both encryption and search, and those users will have to securely store the received keys, and submit an equally large number of keyword trapdoors to the cloud in order to perform search over the shared data. The implied need for secure communication, storage, and complexity clearly renders the approach impractical. In this paper, we address this practical problem, which is largely neglected in the literature, by proposing the novel concept of key-aggregate searchable encryption and instantiating the concept through a concrete KASE scheme, in which a data owner only needs to distribute a single key to a user for sharing a large number of documents, and the user only needs to submit a single trapdoor to the cloud for querying the shared documents. The security analysis and performance evaluation both confirm that our proposed schemes are provably secure and practically efficient.
引用
收藏
页码:2374 / 2385
页数:12
相关论文
共 27 条
[21]   TinyTate: computing the tate pairing in resource-constrained sensor nodes [J].
Oliveira, Leonardo B. ;
Aranha, Diego F. ;
Morais, Eduardo ;
Daguano, Felipe .
SIXTH IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS, PROCEEDINGS, 2007, :318-323
[22]   Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts [J].
Phan, Duong-Hieu ;
Pointcheval, David ;
Shahandashti, Siamak F. ;
Strefler, Mario .
INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2013, 12 (04) :251-265
[23]  
Song DXD, 2000, P IEEE S SECUR PRIV, P44, DOI 10.1109/SECPRI.2000.848445
[24]  
van Liesdonk P, 2010, LECT NOTES COMPUT SC, V6358, P87, DOI 10.1007/978-3-642-15546-8_7
[25]  
Wang, 2012, Proc. 10th Intl Conf. Applied Cryptography and Network Security, P507, DOI DOI 10.1007/978-3-642-31284-7_30
[26]   Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing [J].
Yu, Shucheng ;
Wang, Cong ;
Ren, Kui ;
Lou, Wenjing .
2010 PROCEEDINGS IEEE INFOCOM, 2010,
[27]  
Zhang JH, 2013, PROCEEDINGS OF THE 2013 FOURTH INTERNATIONAL CONFERENCE ON INTELLIGENT CONTROL AND INFORMATION PROCESSING (ICICIP), P257