Publicly Verifiable Boolean Query over Outsourced Encrypted Data
Publicly Verifiable Boolean Query over Outsourced Encrypted Data
复制标题
DOI：
10.1109/glocom.2014.7417807
复制
发表时间：
2014-12
期刊：
影响因子：
--
通讯作者：
Shunrong Jiang;Xiao-yan Zhu;Linke Guo;Jianqing Liu
中科院分区：
文献类型：
--
作者：
Shunrong Jiang;Xiao-yan Zhu;Linke Guo;Jianqing Liu
将存储和计算外包到云已经成为企业和个人的普遍做法。由于云是半可信的或容易受到攻击，许多研究建议，外包数据应加密，然后使用可搜索对称加密（SSE）方案检索。由于云不是完全可信的，我们怀疑它是否总是正确地处理查询。因此，用户需要验证他们的查询结果。基于此，本文提出了一种基于累加树的可公开验证的动态可搜索对称加密方案。我们首先基于加密数据构建一个累积树，然后将两者都外包到云端。接下来，在搜索操作期间，云通过将布尔查询操作映射到集合操作来根据查询结果生成相应的证明，同时保持隐私保护并实现验证要求：真实性，新鲜性和完整性。安全性分析和性能评估表明，该方案具有较好的隐私保护性和实用性。
Outsourcing storage and computation to the cloud has become a common practice for businesses and individuals. As the cloud is semi-trusted or susceptible to attacks, many researches suggest that the outsourced data should be encrypted and then retrieved by using searchable symmetric encryption (SSE) schemes. Since the cloud is not fully trusted, we doubt whether it would always process queries correctly or not. Therefore, there is a need for users to verify their query results. Motivated by this, in this paper, we propose a publicly verifiable dynamic searchable symmetric encryption scheme based on the accumulation tree. We first construct an accumulation tree based on encrypted data and then outsource both of them to the cloud. Next, during the search operation, the cloud generates the corresponding proof according to the query result by mapping Boolean query operations to set operations while keeping privacy-preservation and achieving the verification requirements: authenticity, freshness, and completeness. The security analysis and performance evaluation show that the proposed scheme is privacy-preserving and practical.