Searchable symmetric encryption: Improved definitions and efficient constructions

被引:770
作者
Curtmola, Reza [1 ]
Garay, Juan [2 ]
Kamara, Seny [3 ]
Ostrovsky, Rafail [4 ]
机构
[1] New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA
[2] AT&T Labs Res, Florham Pk, NJ USA
[3] Microsoft Res, Redmond, WA USA
[4] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90024 USA
基金
美国国家科学基金会;
关键词
Searchable encryption; storage outsourcing; cloud storage;
D O I
10.3233/JCS-2011-0426
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search over it. This problem has been the focus of active research and several security definitions and constructions have been proposed. In this paper we begin by reviewing existing notions of security and propose new and stronger security definitions. We then present two constructions that we show secure under our new definitions. Interestingly, in addition to satisfying stronger security guarantees, our constructions are more efficient than all previous constructions. Further, prior work on SSE only considered the setting where only the owner of the data is capable of submitting search queries. We consider the natural extension where an arbitrary group of parties other than the owner can submit search queries. We formally define SSE in this multi- user setting, and present an efficient construction.
引用
收藏
页码:895 / 934
页数:40
相关论文
共 38 条
[1]  
Abdalla M, 2005, LECT NOTES COMPUT SC, V3621, P205
[2]  
Adya A., 2002, AVAILABLE RELI ABLE
[3]  
Amanatidis G, 2007, LECT NOTES COMPUT SC, V4602, P14
[4]  
Ballard L, 2005, LECT NOTES COMPUT SC, V3783, P414
[5]   Universal arguments and their applications [J].
Barak, B ;
Goldreich, O .
17TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2002, :194-203
[6]  
Bellarc M, 2009, LECT NOTES COMPUT SC, V5867, P295, DOI 10.1007/978-3-642-05445-7_19
[7]  
Bellare M, 2007, LECT NOTES COMPUT SC, V4622, P535
[8]  
Bellovin S. M., 2004, 2004022 IACR
[9]  
Ben-Or M., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P1, DOI 10.1145/62212.62213
[10]  
Black J., 2002, Topics in Cryptology - CT-RSA 2002. Cryptographers' Track at the RSA Conference 2002. Proceedings (Lecture Notes in Computer Science Vol.2271), P114