TY - JOUR
T1 - Authenticating Top-k Queries in Location-based Services with Confidentiality
AU - Chen, Qian
AU - HU, Haibo
AU - XU, Jianliang
N1 - This work was supported by RGC/GRF HKBU 211512, 210811 and 210612.
PY - 2013/9
Y1 - 2013/9
N2 - 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 verifythe genuineness of service results. Unfor-tunately, 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 privacyin 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 pa-per, we address the more challenging authentication prob-lem 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 ef-fectiveness and robustness of theproposed schemes under various system settings and query workloads.
AB - 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 verifythe genuineness of service results. Unfor-tunately, 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 privacyin 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 pa-per, we address the more challenging authentication prob-lem 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 ef-fectiveness and robustness of theproposed schemes under various system settings and query workloads.
UR - http://vldb.org/pvldb/vol7-volume-info/
UR - http://www.scopus.com/inward/record.url?scp=84884509675&partnerID=8YFLogxK
U2 - 10.14778/2732219.2732224
DO - 10.14778/2732219.2732224
M3 - Conference article
AN - SCOPUS:84884509675
SN - 2150-8097
VL - 7
SP - 49
EP - 60
JO - Proceedings of the VLDB Endowment
JF - Proceedings of the VLDB Endowment
IS - 1
T2 - Proceedings of the 40th International Conference on Very Large Data Bases, VLDB 2014
Y2 - 1 September 2014 through 5 September 2014
ER -