Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Broadcast protocols to support efficient retrieval from databases by mobile users
ACM Transactions on Database Systems (TODS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Selectivity estimation using probabilistic models
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Dynamic sample selection for approximate query processing
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Analysis of Multi-Dimensional Space-Filling Curves
Geoinformatica
Authentic data publication over the internet
Journal of Computer Security - IFIP 2000
Authenticating Query Results in Edge Computing
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Verifying completeness of relational query results in data publishing
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Dynamic authenticated index structures for outsourced databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
REHIST: relative error histogram construction algorithms
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
CADS: continuous authentication on data streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Proof-infused streams: enabling authentication of sliding window queries on streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Spatial Outsourcing for Location-based Services
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Authenticating multi-dimensional query results in data publishing
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Authentication of outsourced databases using signature aggregation and chaining
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Verifying spatial queries using Voronoi neighbors
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Design and analysis of a ranking approach to private location-based services
ACM Transactions on Database Systems (TODS)
APR-Quad: an update efficient authenticated dictionary for spatial data
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS
Authentication of moving range queries
Proceedings of the 21st ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
Recent advances in wireless communications and positioning devices have generated a tremendous amount of interest in the continuous monitoring of spatial queries. However, such applications can incur a heavy burden on the data owner (DO), due to very frequent location updates. Database outsourcing is a viable solution, whereby the DO delegates its database functionality to a service provider (SP) that has the infrastructure and resources to handle the high workload. In this framework, authenticated query processing enables the clients to verify the correctness of the query results that are returned by the SP. In addition to correctness, the dynamic nature of the monitored data requires the provision for temporal completeness , i.e., the clients must be able to verify that there are no missing results in between data updates. This paper constitutes the first work that deals with the authentication of continuous spatial queries, focusing on ranges. We first introduce a baseline solution (BSL) that achieves correctness and temporal completeness, but incurs false transmissions; that is, the SP has to notify clients whenever there is a data update, even if it does not affect their results. Then, we propose CSA, a mechanism that minimizes the processing and transmission overhead through an elaborate indexing scheme and a virtual caching mechanism. Finally, we derive analytical models to optimize the performance of our methods, and evaluate their effectiveness through extensive experiments.