Fast keyword search over encrypted data with short ciphertext in clouds

被引:4
作者
Tseng, Yi-Fan [1 ]
Fan, Chun-, I [2 ,3 ,4 ]
Liu, Zi-Cheng [2 ]
机构
[1] Natl Chengchi Univ, Dept Comp Sci, Taipei, Taiwan
[2] Natl Sun Yat sen Univ, Dept Comp Sci & Engn, Kaohsiung, Taiwan
[3] Natl Sun Yat sen Univ, Secur Res Ctr, Kaohsiung, Taiwan
[4] Natl Sun Yat sen Univ, Intelligent Elect Commerce Res Ctr, Kaohsiung, Taiwan
关键词
Public key searchable encryption; Key-policy attribute-based encryption; Anonymous KP-ABE; The standard model; Monotonic access structure; ATTRIBUTE-BASED ENCRYPTION; PUBLIC-KEY ENCRYPTION; PREDICATE ENCRYPTION; EFFICIENT; SCHEME;
D O I
10.1016/j.jisa.2022.103320
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Nowadays, it is convenient for people to store their data on clouds. To protect the privacy, people tend to encrypt their data before uploading them to clouds. Due to the widespread use of cloud services, public key searchable encryption is necessary for users to search the encrypted files efficiently and correctly. However, the existing public key searchable encryption schemes supporting monotonic queries suffer from either infeasibility in keyword testing or inefficiency such as heavy computing cost of testing, large size of ciphertext or trapdoor, and so on. In this work, we first propose a novel and efficient anonymous key-policy attribute-based encryption (KP-ABE). Then by applying Shen et al.'s generic construction to the proposed anonymous KP-ABE, we obtain an efficient and expressive public key searchable encryption, which to the best of our knowledge achieves the best performance in testing among the existing such schemes. Only 2 pairings are needed in testing. By applying our searchable encryption, one is able to expressively and efficiently search their encrypted data on clouds, without leaking the keyword information. Besides, we also implement our scheme and others with Python for comparing the performance. From the implementation results, our scheme owns the best performance on testing, and the size of ciphertexts and trapdoors are smaller than most of the existing schemes.
引用
收藏
页数:12
相关论文
共 46 条
[1]  
Abdalla M, 2005, LECT NOTES COMPUT SC, V3621, P205
[2]   Rethinking Security in the Era of Cloud Computing [J].
Aikat, Jay ;
Akella, Aditya ;
Chase, Jeffrey S. ;
Juels, Ari ;
Reiter, Michael K. ;
Ristenpart, Thomas ;
Sekar, Vyas ;
Swift, Michael .
IEEE SECURITY & PRIVACY, 2017, 15 (03) :60-69
[3]   Charm: a framework for rapidly prototyping cryptosystems [J].
Akinyele, Joseph A. ;
Garman, Christina ;
Miers, Ian ;
Pagano, Matthew W. ;
Rushanan, Michael ;
Green, Matthew ;
Rubin, Aviel D. .
JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2013, 3 (02) :111-128
[4]  
Ameri MH, 2018, IEEE TRANS CLOUD COM, V1
[5]  
Beimel A., 1996, Secure schemes for secret sharing and key distribution
[6]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[7]  
Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
[8]   Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation [J].
Boneh, Dan ;
Zhandry, Mark .
ADVANCES IN CRYPTOLOGY - CRYPTO 2014, PT I, 2014, 8616 :480-499
[9]  
Boneh D, 2013, LECT NOTES COMPUT SC, V8043, P461, DOI 10.1007/978-3-642-40084-1_26
[10]  
Cai J -W, 2013, THESIS NATL TAIWAN O, V2