The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Middle-tier database caching for e-business
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Constrained Nearest Neighbor Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
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
A General Model for Authenticated Data Structures
Algorithmica
An analysis of internet content delivery systems
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
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
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Controlling access to published data using cryptography
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Verifying Completeness of Relational Query Answers from Online Servers
ACM Transactions on Information and System Security (TISSEC)
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Authenticating kNN query results in data publishing
SDM'07 Proceedings of the 4th VLDB conference on Secure data management
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
Authenticating the query results of text search engines
Proceedings of the VLDB Endowment
Authenticated indexing for outsourced spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Scalable verification for outsourced dynamic databases
Proceedings of the VLDB Endowment
Verifying spatial queries using Voronoi neighbors
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Authenticating location-based services without compromising location privacy
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Enforcing k nearest neighbor query integrity on road networks
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Predictive spatio-temporal queries: a comprehensive survey and future directions
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
| Hi-index | 0.00 |
In data outsourcing model, data owners engage third-party data servers (called publishers) to manage their data and process queries on their behalf. As these publishers may be untrusted or susceptible to attacks, it could produce incorrect query results to users. In this paper, we introduce an authentication scheme for outsourced multi-dimensional databases. With the proposed scheme, users can verify that their query answers from a publisher are complete (i.e., no qualifying tuples are omitted) and authentic (i.e., all the result values are legitimate). In addition, our scheme guarantees minimality (i.e., no non-answer points are returned in the plain). Our scheme supports window, range, kNN and RNN queries on multi-dimensional databases. We have implemented the proposed scheme, and our experimental results on kNN queries show that our approach is a practical scheme with low overhead.