Authenticating Top-k Queries in Location-based Services with Confidentiality
Authenticating Top-k Queries in Location-based Services with Confidentiality
复制标题
DOI：
10.14778/2732219.2732224
复制
发表时间：
2013-09-01
影响因子：
2.5
通讯作者：
Xu, Jianliang
中科院分区：
文献类型：
--
作者：
Chen, Qian;Hu, Haibo;Xu, Jianliang
最先进的基于位置的服务（LBS）涉及数据所有者，请求客户端和服务提供商。随着LBS成为新的商业机会，越来越有必要验证服务结果的可靠性。不幸的是，虽然传统的查询认证技术可以解决这个问题，他们无法保护数据的机密性，这是敏感的位置信息时，LBS的关注。最近的工作已经研究了如何在查询认证中保护这样的位置隐私。然而，以前的工作仅限于范围查询，其中私有值只出现在范围比较的一侧。在本文中，我们解决了更具挑战性的top-k查询的身份验证问题，其中私有值出现在比较的两侧。首先，我们提出了两个新的密码构建块，其次是一个全面的设计的认证方案的top-k查询的基础上R树和Power Diagram索引。优化，安全性分析和实验结果一致表明，在各种系统设置和查询工作负载下，所提出的方案的有效性和鲁棒性。
State-of-the-art location-based services (LBSs) involve data owners, requesting clients, and service providers. As LBSs become new business opportunities, there is an increasing necessity to verify the genuineness of service results. Unfortunately, while traditional query authentication techniques can address this issue, they fail to protect the confidentiality of data, which is sensitive location information when LBSs are concerned. Recent work has studied how to preserve such location privacy in query authentication. However, the prior work is limited to range queries, where private values only appear on one side of the range comparison. In this paper, we address the more challenging authentication problem on top-k queries, where private values appear on both sides of a comparison. To start with, we propose two novel cryptographic building blocks, followed by a comprehensive design of authentication schemes for top-k queries based on R-tree and Power Diagram indexes. Optimizations, security analysis, and experimental results consistently show the effectiveness and robustness of the proposed schemes under various system settings and query workloads.