IDCrypt: A Multi-User Searchable Symmetric Encryption Scheme for Cloud Applications

被引:22
作者
Wang, Guofeng [1 ]
Liu, Chuanyi [2 ]
Dong, Yingfei [3 ]
Han, Peiyi [1 ]
Pan, Hezhong [1 ]
Fang, Binxing [2 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Comp Sci, Beijing 100876, Peoples R China
[2] Harbin Inst Technol, Sch Comp & Technol, Shenzhen 518055, Peoples R China
[3] Univ Hawaii, Dept Elect Engn, Honolulu, HI 96822 USA
基金
国家高技术研究发展计划(863计划); 中国国家自然科学基金;
关键词
Cloud security; searchable encryption; inference attacks;
D O I
10.1109/ACCESS.2017.2786026
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Searchable Encryption (SE) has been extensively examined by both academic and industry researchers. While many academic SE schemes show provable security, they usually expose some query information (e.g., search and access patterns) to achieve high efficiency. However, several inference attacks have exploited such leakage, e.g., a query recovery attack can convert opaque query trapdoors to their corresponding keywords based on some prior knowledge. On the other hand, many proposed SE schemes require significant modification of existing applications, which makes them less practical, weak in usability, and difficult to deploy. In this paper, we introduce a secure and practical searchable symmetric encryption scheme with provable security strength for cloud applications, called IDCrypt, which improves the search efficiency, and enhances the security strength of SE using symmetric cryptography. We further point out the main challenges in securely searching on multiple indexes and sharing encrypted data between multiple users. To address the above issues, we propose a token-adjustment search scheme to preserve the search functionality among multi-indexes, and a key sharing scheme which combines identity-based encryption and public-key encryption. Our experimental results show that the overhead of the key sharing scheme is fairly low.
引用
收藏
页码:2908 / 2921
页数:14
相关论文
共 30 条
[1]  
Al-Riyami SS, 2003, LECT NOTES COMPUT SC, V2894, P452
[2]  
[Anonymous], 2009, INTRO INFORM RETRIEV
[3]   Dynamic and Efficient Key Management for Access Hierarchies [J].
Atallah, Mikhail J. ;
Blanton, Marina ;
Fazio, Nelly ;
Frikken, Keith B. .
ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2009, 12 (03)
[4]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[5]  
Boneh D., 2001, Advances in Cryptology - CRTPTO 2001. 21st Annual International Cryptology Conference, Proceedings (Lecture Notes in Computer Science Vol.2139), P213
[6]   A Survey of Provably Secure Searchable Encryption [J].
Bosch, Christoph ;
Hartel, Pieter ;
Jonker, Willem ;
Peter, Andreas .
ACM COMPUTING SURVEYS, 2015, 47 (02)
[7]  
C. S. Alliance, 2016, CSAS CLOUD COMP TOP
[8]   Leakage-Abuse Attacks Against Searchable Encryption [J].
Cash, David ;
Grubbs, Paul ;
Perry, Jason ;
Ristenpart, Thomas .
CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, :668-679
[9]   Searchable symmetric encryption: Improved definitions and efficient constructions [J].
Curtmola, Reza ;
Garay, Juan ;
Kamara, Seny ;
Ostrovsky, Rafail .
JOURNAL OF COMPUTER SECURITY, 2011, 19 (05) :895-934
[10]  
Fujisaki E., 1999, Advances in Cryptology - CRYPTO'99. 19th Annual International Cryptology Conference. Proceedings, P537