Logo image
Taking Authenticated Range Queries to Arbitrary Dimensions
Conference proceeding   Open access

Taking Authenticated Range Queries to Arbitrary Dimensions

Dimitrios Papadopoulos, Stavros Papadopoulos, Nikos Triandopoulos and ACM
CCS'14: PROCEEDINGS OF THE 21ST ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, pp 819-830
01 Jan 2014
url
https://doi.org/10.5391/IJFIS.2016.16.3.157View
Published, Version of Record (VoR)Open Access (License Unspecified) Open

Abstract

Computer Science Computer Science, Theory & Methods Engineering Engineering, Electrical & Electronic Science & Technology Technology Telecommunications
We study the problem of authenticated multi-dimensional range queries over outsourced databases, where an owner outsources its database to an untrusted server, which maintains it and answers queries to clients. Previous schemes either scale exponentially in the number of query dimensions, or rely on heuristic data structures without provable bounds. Most importantly, existing work requires an exponential, in the database attributes, number of structures to support queries on every possible combination of dimensions in the database. In this paper, we propose the first schemes that (i) scale linearly with the number of dimensions, and (ii) support queries on any set of dimensions with linear in the number of attributes setup cost and storage. We achieve this through an elaborate fusion of novel and existing set-operation sub-protocols. We prove the security of our solutions relying on the q-Strong Bilinear Diffie-Hellman assumption, and experimentally confirm their feasibility.

Metrics

11 Record Views
38 citations in Scopus

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Industry collaboration
Domestic collaboration
Web of Science research areas
Computer Science, Theory & Methods
Engineering, Electrical & Electronic
Telecommunications
Logo image