Searchable symmetric encryption: Improved definitions and efficient constructions
Searchable symmetric encryption: Improved definitions and efficient constructions
复制标题
DOI：
10.3233/jcs-2011-0426
复制
发表时间：
2011-01-01
影响因子：
1.2
通讯作者：
Ostrovsky, Rafail
中科院分区：
文献类型：
--
作者：
Curtmola, Reza;Garay, Juan;Ostrovsky, Rafail
可搜索对称加密（SSE）允许一方以私有的方式将其数据的存储外包给另一方，同时保持对其进行选择性搜索的能力。在本文中，我们开始通过审查现有的安全概念，并提出新的和更强的安全定义。然后，我们提出了两个结构，我们显示安全下我们的新定义。有趣的是，除了满足更强的安全保证外，我们的构造比以前所有的构造都更有效。此外，以前的SSE工作只考虑了只有数据所有者能够提交搜索查询的设置。我们考虑的自然扩展，其中任意一组的所有者以外的各方可以提交搜索查询。我们正式定义SSE在这个多用户设置，并提出了一个有效的建设。
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.