Searchable Symmetric Encryption Supporting Queries with Multiple-Character Wildcards
Searchable Symmetric Encryption Supporting Queries with Multiple-Character Wildcards
复制标题
DOI：
10.1007/978-3-319-46298-1_18
复制
发表时间：
2016-09
期刊：
影响因子：
--
通讯作者：
Fangming Zhao;T. Nishide
中科院分区：
文献类型：
--
作者：
Fangming Zhao;T. Nishide
我们考虑的问题，可搜索的加密方案，允许用户搜索加密的数据而不解密它。现有的计划在对称设置只处理相等的搜索或有限的相似性关键字搜索。在本文中，我们研究了基于Bloom过滤器的可搜索对称加密方案，该方案使加密关键字的搜索更具表达性和灵活性，即，支持模糊搜索或多字符搜索。我们的计划是更有效的比以前的解决方案的计算成本和通信成本。我们的主要建设的安全性进行了分析的基础上，一个正式的，强安全模型的可搜索的对称加密。
We consider the problem of searchable encryption scheme which allows a user to search over encrypted data without decrypting it. Existing schemes in the symmetric setting only deal with equality search or a limited similarity keyword search. In this paper, we study Bloom filter-based searchable symmetric encryption schemes which make search on encrypted keywords more expressive and flexible, i.e., support fuzzy search or wildcard search by using multiple wildcard characters. Our schemes are more efficient than previous solutions on both computation cost and communication cost. Security of our main construction is analyzed based on a formal, strong security model for searchable symmetric encryption.