Conjunctive Keyword Search With Designated Tester and Timing Enabled Proxy Re-Encryption Function for E-Health Clouds

被引:180
作者
Yang, Yang [1 ]
Ma, Maode [2 ]
机构
[1] Fuzhou Univ, Sch Math & Comp Sci, Fujian 350108, Peoples R China
[2] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
基金
中国国家自然科学基金;
关键词
Searchable encryption; time control; conjunctive keywords; designated tester; e-health; resist offline keyword guessing attack; PUBLIC-KEY ENCRYPTION; GUESSING ATTACKS; SECURE; SCHEMES; SUBSET; MODEL;
D O I
10.1109/TIFS.2015.2509912
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
An electronic health (e-health) record system is a novel application that will bring great convenience in healthcare. The privacy and security of the sensitive personal information are the major concerns of the users, which could hinder further development and widely adoption of the systems. The searchable encryption (SE) scheme is a technology to incorporate security protection and favorable operability functions together, which can play an important role in the e-health record system. In this paper, we introduce a novel cryptographic primitive named as conjunctive keyword search with designated tester and timing enabled proxy reencryption function (Re-dtPECK), which is a kind of a time-dependent SE scheme. It could enable patients to delegate partial access rights to others to operate search functions over their records in a limited time period. The length of the time period for the delegatee to search and decrypt the delegator's encrypted documents can be controlled. Moreover, the delegatee could be automatically deprived of the access and search authority after a specified period of effective time. It can also support the conjunctive keywords search and resist the keyword guessing attacks. By the solution, only the designated tester is able to test the existence of certain keywords. We formulate a system model and a security model for the proposed Re-dtPECK scheme to show that it is an efficient scheme proved secure in the standard model. The comparison and extensive simulations demonstrate that it has a low computation and storage overhead.
引用
收藏
页码:746 / 759
页数:14
相关论文
共 34 条
[1]  
[Anonymous], THE PBC LIB
[2]  
Baek J, 2008, LECT NOTES COMPUT SC, V5072, P1249, DOI 10.1007/978-3-540-69839-5_96
[3]  
Bellare M, 2004, LECT NOTES COMPUT SC, V3027, P171
[4]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[5]  
Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
[6]  
Byun JW, 2006, LECT NOTES COMPUT SC, V4165, P75
[7]   On a security model of conjunctive keyword search over encrypted relational database [J].
Byun, Jin Wook ;
Lee, Dong Hoon .
JOURNAL OF SYSTEMS AND SOFTWARE, 2011, 84 (08) :1364-1372
[8]   The random oracle methodology, revisited [J].
Canetti, R ;
Goldreich, O ;
Halevi, S .
JOURNAL OF THE ACM, 2004, 51 (04) :557-594
[9]  
Cash D, 2013, LECT NOTES COMPUT SC, V8042, P353, DOI 10.1007/978-3-642-40041-4_20
[10]  
Ding MZ, 2012, PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON NETWORK INFRASTRUCTURE AND DIGITAL CONTENT (IEEE IC-NIDC 2012), P526, DOI 10.1109/ICNIDC.2012.6418809